An improved algorithm for optimal noncoherent QAM detection

Robby G. McKilliam, Daniel J. Ryan, I. Vaughan L Clarkson, Iain B. Collings

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

13 Citations (Scopus)

Abstract

Ryan et al. [1] recently described two polynomial time algorithms for noncoherent detection of square QAM in block fading channels with additive white Gaussian noise (AWGN). The first algorithm is optimal with respect to the generalized likelihood ratio test (GLRT) and requires O(T3) arithmetic computations, where T is the block length of the noncoherent receiver. The second algorithm requires only O(T2 log T) arithmetic computations but is statistically suboptimal. This paper derives a new algorithm that is optimal yet requires only O(T2 log T) arithmetic computations. The new algorithm has the geometric interpretation of finding the nearest codeword to a plane (2 dimensional subspace). The nearest codeword is found by testing codewords that are near a finite number of lines formed by the intersection of the plane and the nearest neighbour boundaries of the codewords.

Original languageEnglish
Title of host publicationProceedings of the 2008 Australian Communications Theory Workshop, AusCTW08
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages64-68
Number of pages5
ISBN (Print)9781424420384
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event2008 Australian Communications Theory Workshop, AusCTW08 - Christchurch, New Zealand
Duration: 30 Jan 20081 Feb 2008

Other

Other2008 Australian Communications Theory Workshop, AusCTW08
CountryNew Zealand
CityChristchurch
Period30/01/081/02/08

Keywords

  • Lattice decoding
  • Noncoherent detection
  • Wireless communications

Fingerprint Dive into the research topics of 'An improved algorithm for optimal noncoherent QAM detection'. Together they form a unique fingerprint.

Cite this