An Adaptive Joint Viterbi Detector Decoder (AJVDD)

The Joint Viterbi Detector Decoder (JVDD) is a novel detection/decoding algorithm that can functionally replace the iterative detector/decoder in the channel. The algorithm performs detection and decoding on a single trellis structure and is conditionally optimal over an ISI/AWGN channel. Preliminary analysis of the algorithm indicates better performance at shorter codeword lengths when compared to an iterative detector, but the latter catches up and surpasses it at longer codeword lengths due to the high complexity the JVDD. The commercial viability of channel decoders for real-time systems is dependent on two important parameters — performance and computational complexity. In this paper, a novel algorithm called the Adaptive Joint Viterbi Detector Decoder (AJVDD) is proposed that enhances the performance and reduces the computational complexity of the JVDD algorithm. The proposed algorithm reduces the average number of survivors per frame by applying varying metric threshold values across different states of the trellis at each time index. It improves the chances of the Minimum Metric Legal Codeword (MMLC) surviving until the end of the frame while filtering out survivors with the least chance of being the MMLC. Extensive simulations are used to verify the improved performance and reduced computational requirements of the proposed algorithm.

[1]  Sari Shafidah Bte Shafi'ee,et al.  A Performance Study of the Joint Viterbi Detector Decoder (JVDD) with GDLD and GDPD Codes , 2014, 2014 International Conference on Computational Intelligence and Communication Networks.

[2]  Alessandro Tomasoni,et al.  Non-Binary Message-Passing Algorithms for Magnetic Channels with Data-Dependent Noise , 2008 .

[3]  Paul H. Siegel,et al.  Graph-Based Decoding in the Presence of ISI , 2011, IEEE Transactions on Information Theory.

[4]  Robert J. McEliece,et al.  Performance of binary block codes at low signal-to-noise ratios , 1992, IEEE Trans. Inf. Theory.

[5]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[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]  R. Koetter,et al.  Turbo equalization , 2004, IEEE Signal Processing Magazine.

[8]  Yong Liang Guan,et al.  Optimal Joint Viterbi Detector Decoder (JVDD) over AWGN/ISI channel , 2014, 2014 International Conference on Computing, Networking and Communications (ICNC).

[9]  David Burshtein,et al.  Bounds on the performance of belief propagation decoding , 2002, IEEE Trans. Inf. Theory.

[10]  B. V. Vijaya Kumar,et al.  Low-density parity check codes for partial response channels , 2004, IEEE Signal Processing Magazine.

[11]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[12]  Joseph A. O'Sullivan,et al.  Iterative detection and decoding for separable two-dimensional intersymbol interference , 2003 .

[13]  Stephen G. Wilson,et al.  Digital Modulation and Coding , 1995 .

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

[15]  P. K. Chaturvedi,et al.  Communication Systems , 2002, IFIP — The International Federation for Information Processing.

[16]  B.V.K.V. Kumar,et al.  A high-throughput, field programmable gate array implementation of soft output Viterbi algorithm for magnetic recording , 2004, IEEE Transactions on Magnetics.

[17]  Kheong Sann Chan,et al.  Multi-pass joint Viterbi detector decoder (MP-JVDD) over AWGN/ISI channels , 2016, 2016 International Conference on Computing, Networking and Communications (ICNC).

[18]  Giulio Colavolpe,et al.  On the application of factor graphs and the sum-product algorithm to ISI channels , 2005, IEEE Transactions on Communications.

[19]  D. Burshtein,et al.  Bounds on the performance of belief propagation decoding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).