Please use this identifier to cite or link to this item:
Title: On a reduced-complexity inner decoder for the Davey-MacKay construction
Authors: Jiao, X. 
Armand, M.A. 
Keywords: Insertion/deletion channel
LDPC code
Watermark code
Issue Date: Aug-2012
Citation: Jiao, X., Armand, M.A. (2012-08). On a reduced-complexity inner decoder for the Davey-MacKay construction. ETRI Journal 34 (4) : 637-640. ScholarBank@NUS Repository.
Abstract: The Davey-MacKay construction is a promising concatenated coding scheme involving an outer 2k-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. © 2012 ETRI.
Source Title: ETRI Journal
ISSN: 12256463
DOI: 10.4218/etrij.12.0211.0461
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.