Please use this identifier to cite or link to this item:
|Title:||Design and performance of LDPC codes extended with parity-check symbols from a larger alphabet||Authors:||Mo, E.
|Issue Date:||2007||Citation:||Mo, E.,Armand, M.A. (2007). Design and performance of LDPC codes extended with parity-check symbols from a larger alphabet. 2007 6th International Conference on Information, Communications and Signal Processing, ICICS : -. ScholarBank@NUS Repository. https://doi.org/10.1109/ICICS.2007.4449724||Abstract:||This paper describes a method for constructing a certain class of LDPC codes over mixed integer residue rings. These codes are essentially extended LDPC codes where the additional redundant symbols come from a larger alphabet. In particular, we address the effects that zero divisors as edge weights in the Tanner graph of LDPC codes over ℤq have, from the pseudocodeword perspective. First, we show that weighting certain edges of a Tanner graph with zero divisors of ℤq can reduce the number of pseudocodewords arising from its finite degree covers. Second, we prove that in adding a redundant row to a given parity-check matrix, the smaller the number of zero divisors it contains, the more effective it is in constricting the corresponding fundamental polytope. Moreover, we argue that cycles of length four are not bad provided at least one of the four corresponding edge weights is a zero divisor. The culmination of these findings is a procedure for judiciously adding redundant check nodes to the Tanner graph representation of a mixed-alphabet code such that significant performance improvements under iterative decoding may be obtained. © 2007 IEEE.||Source Title:||2007 6th International Conference on Information, Communications and Signal Processing, ICICS||URI:||http://scholarbank.nus.edu.sg/handle/10635/83610||ISBN:||1424409837||DOI:||10.1109/ICICS.2007.4449724|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 18, 2019
checked on Aug 17, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.