Generic iterative search-centre-shifting K-best sphere detection for rank-deficient SDM-OFDM systems

@inproceedings{Wang2008GenericIS,
  title={Generic iterative search-centre-shifting K-best sphere detection for rank-deficient SDM-OFDM systems},
  author={Li-Chun Wang and Liangguang Xu and Sheng Chen and Lajos Hanzo Hanzo},
  year={2008}
}
Motivation: The sphere detector (SD) constitutes a computationally efficient solution to the maximum likelihood (ML) detection problem in uncoded multiple-input, multiple-output (MIMO) systems [1, 2]. However, when employed in an iterative detection aided channel coded system, the SD has to generate soft information for every transmitted bit, which requires the observation of a high number of hypotheses about the transmitted MIMO symbol, resulting in a potentially excessive complexity. To… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-8 of 8 extracted citations

Low Complexity, Quasi-Optimal MIMO Detectors for Iterative Receivers

IEEE Transactions on Wireless Communications • 2010
View 18 Excerpts
Highly Influenced

Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs

IEEE Communications Surveys & Tutorials • 2015
View 1 Excerpt

Similar Papers

Loading similar papers…