Maximum-Likelihood Noncoherent Lattice Decoding of QAM

Author

Ryan, Daniel J. ; Collings, Iain B. ; Clarkson, I. Vaughan L

Author_Institution

Sch. of Electr. & Inf. Eng., Univ. of Sydney, Sydney, NSW, Australia

Volume

4

fYear

2006

fDate

14-19 May 2006

Firstpage

189

Lastpage

192

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.

Keywords

computational complexity; maximum likelihood decoding; maximum likelihood detection; polynomials; quadrature amplitude modulation; QAM; computational complexity; maximum-likelihood noncoherent lattice decoding; noncoherent block detection; polynomial; sphere decoding; Computational complexity; Computational modeling; Detectors; Lattices; Maximum likelihood decoding; Maximum likelihood detection; Nearest neighbor searches; Polynomials; Quadrature amplitude modulation; Signal detection;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on

Conference_Location

Toulouse

ISSN

1520-6149

Print_ISBN

1-4244-0469-X

Type

conf

DOI

10.1109/ICASSP.2006.1660937

Filename

1660937