Name
Abstract | ||
|---|---|---|
In this paper, we propose a novel maximum-likelihood (ML) decoding scheme based on the combination of depth- and breadth-first search methods on a partitioned tree for multiple input multiple output systems. The proposed scheme first partitions the searching tree into several stages, each of which is then searched by a depth- or breadth-first search method, possibly exploiting the advantages of both the depth- and breadth-first search methods in an organized way. Numerical results indicate that, when the depth- and breadth-first search algorithms are adopted appropriately, the proposed scheme exhibits substantially lower computational complexity than conventional ML decoders while maintaining the ML bit error performance. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ITNG.2010.59 | ITNG |
Keywords | Field | DocType |
multiple input,novel ml decoding scheme,ml bit error performance,mimo signals,breadth-first search algorithm,decoding scheme,proposed scheme,multiple output system,conventional ml decoder,breadth-first search method,computational complexity,partitioned tree,mimo,measurement,constellation diagram,bit error rate,signal to noise ratio,lattices,breadth first search,maximum likelihood,decoding | Search algorithm,Lattice (order),Computer science,Signal-to-noise ratio,Algorithm,MIMO,Theoretical computer science,Constellation diagram,Decoding methods,Bit error rate,Computational complexity theory,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Myung-Soo Lee | 1 | 12 | 5.15 |
| Chonghan Song | 2 | 3 | 3.23 |
| Young-Yoon Lee | 3 | 68 | 9.62 |
| Seok-Ho Yoon | 4 | 256 | 47.78 |