Noncoherent lattice decoding of PAM and ASK

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

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 proceeding › Conference proceeding contribution › peer-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 language	English
Title of host publication	2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	1703-1707
Number of pages	5
Volume	4
ISBN (Print)	0780393929, 9780780393929
Publication status	Published - 2006
Externally published	Yes
Event	2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Melbourne, Australia Duration: 7 May 2006 → 10 Jul 2006

Other

Other	2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring
Country/Territory	Australia
City	Melbourne
Period	7/05/06 → 10/07/06

Cite this

@inproceedings{840ca860993840a3af0acc1eb56e9538,

title = "Noncoherent lattice decoding of PAM and ASK",

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

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

year = "2006",

language = "English",

isbn = "0780393929",

volume = "4",

pages = "1703--1707",

booktitle = "2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings",

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

address = "United States",

note = "2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring ; Conference date: 07-05-2006 Through 10-07-2006",

}

Ryan, DJ, Collings, IB & Clarkson, IVL 2006, Noncoherent lattice decoding of PAM and ASK. in 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings. vol. 4, 1683137, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 1703-1707, 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring, Melbourne, Australia, 7/05/06.

Noncoherent lattice decoding of PAM and ASK. / Ryan, Daniel J.; Collings, Iain B.; Clarkson, I. Vaughan L.
2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings. Vol. 4 Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2006. p. 1703-1707 1683137.

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

TY - GEN

T1 - Noncoherent lattice decoding of PAM and ASK

AU - Ryan, Daniel J.

AU - Collings, Iain B.

AU - Clarkson, I. Vaughan L

PY - 2006

Y1 - 2006

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

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

UR - http://www.scopus.com/inward/record.url?scp=34047141066&partnerID=8YFLogxK

M3 - Conference proceeding contribution

AN - SCOPUS:34047141066

SN - 0780393929

SN - 9780780393929

VL - 4

SP - 1703

EP - 1707

BT - 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

T2 - 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring

Y2 - 7 May 2006 through 10 July 2006

ER -

Noncoherent lattice decoding of PAM and ASK

Abstract

Other

Other files and links

Fingerprint

Cite this