Reduced-Complexity Soft-Decision Aided PSK Detection

In this paper, we propose to reduce the complexity of both the Approx-Log-MAP algorithm as well as of the Max-Log-MAP algorithm, which were designed for soft-decision aided PSK detectors. First of all, we extend the shown a posteriori PSK symbol probability formula and streamline it by eliminating its unnecessary calculations in the context of the Approx-Log-MAP algorithm. Secondly, we reduce the complexity of the Max-Log-MAP algorithm, where the maximum a posteriori symbol probability may be obtained without evaluating and comparing all the candidate symbol probabilities. Furthermore, we apply our new soft detection arrangement to a variety of coded systems. Our simulation results demonstrate that a significant detection complexity reduction was achieved by our design without any performance loss. For example, a factor two complexity reduction was achieved by the proposed Max-Log-MAP algorithm, when it was invoked for detecting QPSK symbols, which is expected to be significantly higher, when invoked for 16QAM.

[1]  Lajos Hanzo,et al.  On the MIMO channel capacity of multidimensional signal sets , 2006, IEEE Transactions on Vehicular Technology.

[2]  Michael Tüchler,et al.  Design of Serially Concatenated Systems Depending on the Block Length , 2004, IEEE Trans. Commun..

[3]  Wolfgang Koch,et al.  Optimum and sub-optimum detection of coded data disturbed by time-varying intersymbol interference (applicable to digital mobile radio receivers) , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[4]  Patrick Robertson,et al.  A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[5]  T. H. Liew,et al.  Turbo Coding, Turbo Equalisation and Space-Time Coding: EXIT-Chart-Aided Near-Capacity Designs for Wireless Channels , 2011 .

[6]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[7]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[8]  Lajos Hanzo,et al.  Near-Capacity Multi-Functional MIMO Systems: Sphere-Packing, Iterative Detection and Cooperation , 2009 .

[9]  Paul H. Siegel,et al.  Serial concatenated TCM with an inner accumulate code-part I: maximum-likelihood analysis , 2005, IEEE Transactions on Communications.

[10]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[11]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[12]  Soon Xin Ng,et al.  Quadrature Amplitude Modulation: From Basics to Adaptive Trellis-Coded, Turbo-Equalised and Space-Time Coded OFDM, CDMA and MC-CDMA Systems , 2004 .

[13]  Lajos Hanzo,et al.  Near-Capacity Multi-Functional MIMO Systems , 2009 .

[14]  S. Brink,et al.  Iterative demapping for QPSK modulation , 1998 .

[15]  M. Tuchler,et al.  Design of serially concatenated systems depending on the block length , 2004, IEEE Transactions on Communications.

[16]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .