Linear-time block noncoherent detection of PSK

We propose a new algorithm for noncoherent sequence detection of M-ary phase-shift-keying (M-PSK) symbols transmitted over a block fading channel. The algorithm is of complexity O(T), where T is the sequence length, and is therefore computationally superior to existing maximum-likelihood (ML) detectors of complexity O(T logT). Our detector is based on a new approximation we propose to the noncoherent ML function. We show that by using this close approximation, the detection problem reduces to a nearest lattice point problem for the lattice An*, from which we derive our O(T) approach. Simulation results are provided that show the difference in bit error rate is negligibly small for a wide range of signal-to-noise ratios.

[1]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

[2]  W. Weber,et al.  Differential Encoding for Multiple Amplitude and Phase Shift Keying Systems , 1978, IEEE Trans. Commun..

[3]  I.V.L. Clarkson,et al.  A linear-time nearest point algorithm for the lattice An* , 2008, 2008 International Symposium on Information Theory and Its Applications.

[4]  Kenneth M. Mackenthun,et al.  A fast algorithm for multiple-symbol differential detection of MPSK , 1994, IEEE Trans. Commun..

[5]  N. J. A. Sloane,et al.  Fast quantizing and decoding and algorithms for lattice quantizers and codes , 1982, IEEE Trans. Inf. Theory.

[6]  S. C. Kwatra,et al.  An analysis of the MPSK scheme with differential recursive detection (DRD) , 1991, [1991 Proceedings] 41st IEEE Vehicular Technology Conference.

[7]  Dimitrios Makrakis,et al.  Optimal noncoherent detection of PSK signals , 1990 .

[8]  Daniel J. Ryan,et al.  GLRT-Optimal Noncoherent Lattice Decoding , 2007, IEEE Transactions on Signal Processing.

[9]  N. J. A. Sloane,et al.  Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice , 1986, IEEE Trans. Inf. Theory.

[10]  I. Vaughan L. Clarkson,et al.  An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$ , 2008, IEEE Transactions on Information Theory.

[11]  Upamanyu Madhow,et al.  Joint noncoherent demodulation and decoding for the block fading channel: a practical framework for approaching Shannon capacity , 2003, IEEE Trans. Commun..

[12]  I. Collings,et al.  An improved algorithm for optimal noncoherent QAM detection , 2008, 2008 Australian Communications Theory Workshop.

[13]  Wim Sweldens Fast block noncoherent decoding , 2001, IEEE Communications Letters.

[14]  I. Vaughan L. Clarkson,et al.  An Algorithm to Compute a Nearest Point in the Lattice An* , 1999, AAECC.

[15]  M. Ajtai The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.

[16]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[17]  Upamanyu Madhow,et al.  Spectrally efficient noncoherent communication , 2002, IEEE Trans. Inf. Theory.

[18]  Stephen G. Wilson,et al.  Multi-symbol detection of M-DPSK , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.