On a Reduced-Complexity Inner Decoder for the Davey-MacKay Construction

ETRI Journal

关键词: LDPC code;    synchronization;    watermark code;    Insertion/deletion channel;   

Others  :  1186357
DOI  :  10.4218/etrij.12.0211.0461

【 摘 要 】

The Davey-MacKay construction is a promising concatenated coding scheme involving an outer 2^k-ary code and an inner code of rate k/n, for insertion-deletion-substitution channels. Recently, a lookup table (LUT)-based inner decoder for this coding scheme was proposed to reduce the computational complexity of the inner decoder, albeit at the expense of a slight degradation in word error rate (WER) performance. In this letter, we show that negligible deterioration in WER performance can be achieved with an LUT as small as 7•2^k+n–1, but no smaller, when the probability of receiving less than n–1 or greater than n+1 bits corresponding to one outer code symbol is at least an order of magnitude smaller than the WER when no LUT is used.

   

【 参考文献 】

• [1]J. Hu et al., “Achievable Information Rates for Channels with Insertions, Deletions, and Intersymbol Interference with i.i.d. Inputs,” IEEE Trans. Commun., vol. 58, no. 4, Apr. 2010, pp. 1101-1111.
• [2]M. Davey and D.J.C. MacKay, “Reliable Communications over Channels with Insertions, Deletions, and Substitutions,” IEEE Trans. Inf. Theory, vol. 47, no. 2, Feb. 2001, pp. 687-698.
• [3]J.A. Briffa, H.G. Schaathun, and S. Wesemeyer, “An Improved Decoding Algorithm for the Davey-MacKay Construction,” IEEE Int. Conf. Commun., Cape Town, South Africa, May 2010.
• [4]X. Jiao and M.A. Armand, “Interleaved LDPC Codes, Reduced-Complexity Inner Decoder and an Iterative Decoder for the Davey-MacKay Construction,” IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Aug. 2011.
• [5]H. Wymeersch, H. Steendam, and M. Moeneclaey, “Log-Domain Decoding of LDPC Codes over GF(q),” IEEE Int. Conf. Commun., Paris, France, June 2004.