Noncoherent lattice decoding of PAM and ASK

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

*Corresponding author for this work

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

Abstract

In this paper we present a novel maximum-likelihood polynomial-time algorithm for noncoherent detection of PAM over fading channels. The algorithm is based on a geometric interpretation of the noncoherent detection metric. This interpretation leads to a novel low complexity decoder based on an angular criterion, rather than the usual Euclidean distance sense. We prove that the ML estimate of the data must lie in a reduced search space which is of log-linear complexity with the block length. We then provide an algorithm that enumerates the codewords and their corresponding metrics in an efficient, recursive manner. We also consider detection of ASK, by combining the maximum-likelihood algorithm with a simple phase estimator.

Original languageEnglish
Title of host publication2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1703-1707
Number of pages5
Volume4
ISBN (Print)0780393929, 9780780393929
Publication statusPublished - 2006
Externally publishedYes
Event2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Melbourne, Australia
Duration: 7 May 200610 Jul 2006

Other

Other2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring
CountryAustralia
CityMelbourne
Period7/05/0610/07/06

Fingerprint Dive into the research topics of 'Noncoherent lattice decoding of PAM and ASK'. Together they form a unique fingerprint.

Cite this