GLRT-Optimal Noncoherent Lattice Decoding

DOI10.1109/TSP.2007.894237MaRDI QIDQ4564759zbMATH OpenOpenAlexFDO

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

Publication date 12 June 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0704.1524

Mathematics Subject Classification ID

Source coding (94A29) Decoding (94B35)

Abstract: This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of QAM and PAM signals over complex-valued fading channels. The algorithms are optimal in terms of the generalized likelihood ratio test (GLRT). The computational complexity is polynomial in the block length; making GLRT-optimal noncoherent detection feasible for implementation. We also provide even lower complexity suboptimal algorithms. Simulations show that the suboptimal algorithms have performance indistinguishable from the optimal algorithms. Finally, we consider block based transmission, and propose to use noncoherent detection as an alternative to pilot assisted transmission (PAT). The new technique is shown to outperform PAT.

Cited in

(1)

• FGLM-Like Decoding: from Fitzpatrick’s Approach to Recent Developments

This page was built for publication: GLRT-Optimal Noncoherent Lattice Decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564759)