Maximum-likelihood noncoherent lattice decoding of QAM

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

Maximum-likelihood noncoherent lattice decoding of QAM

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

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

4 Citations (Scopus)

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

Cite this

@inproceedings{32b45f5c7ca34cc7ae735e1455e47654,

title = "Maximum-likelihood noncoherent lattice decoding of QAM",

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.",

author = "Ryan, \{Daniel J.\} and Collings, \{Iain B.\} and Clarkson, \{I. Vaughan L\}",

year = "2006",

language = "English",

isbn = "142440469X",

volume = "4",

pages = "1--4",

booktitle = "2006 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006 ; Conference date: 14-05-2006 Through 19-05-2006",

}

Ryan, DJ, Collings, IB & Clarkson, IVL 2006, Maximum-likelihood noncoherent lattice decoding of QAM. in 2006 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings. vol. 4, 1660937, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 1-4, 2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006, Toulouse, France, 14/05/06.

Maximum-likelihood noncoherent lattice decoding of QAM. / Ryan, Daniel J.; Collings, Iain B.; Clarkson, I. Vaughan L.
2006 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings. Vol. 4 Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2006. p. 1-4 1660937.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Maximum-likelihood noncoherent lattice decoding of QAM

AU - Ryan, Daniel J.

AU - Collings, Iain B.

AU - Clarkson, I. Vaughan L

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/33947656867

M3 - Conference proceeding contribution

AN - SCOPUS:33947656867

SN - 142440469X

SN - 9781424404698

VL - 4

SP - 1

EP - 4

BT - 2006 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

T2 - 2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006

Y2 - 14 May 2006 through 19 May 2006

ER -

Maximum-likelihood noncoherent lattice decoding of QAM

Abstract

Other

Other files and links

Fingerprint

Cite this