Name
Abstract | ||
|---|---|---|
We introduce several low complexity sub-optimal MIMO detection schemes based on the List-BLAST algorithm, which exhausts the constellation points in the first layer of a BLAST scheme to generate multiple candidate solutions from which the maximum likelihood solution is determined. The candidates can also be used as initial points for the space alternating generalized expectation-maximization (SAGE) algorithm to further improve performance. The proposed schemes can achieve close to optimal performance for both hard and soft output detection with lower complexity than that of the sphere detection in our simulation settings |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/TWC.2007.348310 | IEEE Transactions on Wireless Communications |
Keywords | Field | DocType |
maximum likelihood,polynomials,indexing terms,em algorithm,fading,helium,detectors,mimo,computational complexity,fading channel | Mathematical optimization,Polynomial,Fading,Expectation–maximization algorithm,MIMO,Algorithm,Communication channel,Real-time computing,Decoding methods,Detector,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
6 | 4 | 1536-1276 |
Citations | PageRank | References |
10 | 0.57 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongzhe Xie | 1 | 144 | 10.07 |
| Qiang Li | 2 | 10 | 0.57 |
| Costas N. Georghiades | 3 | 301 | 32.18 |