Title :
Design of Low Complexity Non-Binary LDPC Codes with an Approximated Performance-Complexity Tradeoff
Author :
Yu, Yang ; Chen, Wen
Author_Institution :
Dept. of Electron. Eng., Shanghai Jiao Tong Univ., Shanghai, China
fDate :
4/1/2012 12:00:00 AM
Abstract :
By presenting an approximated performance-complexity tradeoff (PCT) algorithm, a low-complexity non-binary low density parity check (LDPC) code over q-ary-input symmetric-output channel is designed in this manuscript which converges faster than the threshold-optimized non-binary LDPC codes in the low error rate regime. We examine our algorithm by both hard and soft decision decoders. Moreover, simulation shows that the approximated PCT algorithm has accelerated the convergence process by 30% regarding the number of the decoding iterations.
Keywords :
channel coding; communication complexity; decoding; error statistics; parity check codes; PCT algorithm; convergence process; decoding iteration; hard decision decoder; low error rate regime; low-complexity nonbinary low density parity check code; performance-complexity tradeoff algorithm; q-ary-input symmetric-output channel; soft decision decoder; threshold-optimized nonbinary LDPC code; Algorithm design and analysis; Complexity theory; Decoding; Error probability; Iterative decoding; Optimization; EXIT chart; Gallager decoding algorithm b; Nonbinary LDPC; performance-complexity tradeoff;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2012.021612.112467
