Abstract
We present a novel, maximum-likelihood (ML), lattice-decoding algorithm for noncoherent block detection of QAM signals. The computational complexity is polynomial in the block length; making it feasible for implementation compared with the exhaustive search ML detector. The algorithm works by enumerating the nearest neighbor regions for a plane defined by the received vector; in a conceptually similar manner to sphere decoding. Simulations show that the new algorithm significantly outperforms existing approaches.
Original language | English |
---|---|
Title of host publication | 2006 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings |
Place of Publication | Piscataway, NJ |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 1-4 |
Number of pages | 4 |
Volume | 4 |
ISBN (Print) | 142440469X, 9781424404698 |
Publication status | Published - 2006 |
Externally published | Yes |
Event | 2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006 - Toulouse, France Duration: 14 May 2006 → 19 May 2006 |
Other
Other | 2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006 |
---|---|
Country/Territory | France |
City | Toulouse |
Period | 14/05/06 → 19/05/06 |