Title :
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications
Author :
Sason, Igal ; Wiechman, Gil
Author_Institution :
Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa
Abstract :
A variety of communication scenarios can be modeled by a set of parallel channels. Upper bounds on the achievable rates under maximum-likelihood (ML) decoding, and lower bounds on the decoding complexity per iteration of ensembles of low-density parity-check (LDPC) codes are presented. The communication of these codes is assumed to take place over statistically independent parallel channels where the component channels are memoryless, binary-input, and output-symmetric. The bounds are applied to ensembles of punctured LDPC codes where the puncturing patterns are either random or possess some structure. Our discussion is concluded by a diagram showing interconnections between the new theorems and some previously reported results
Keywords :
channel coding; iterative decoding; maximum likelihood decoding; parity check codes; LDPC codes; iterative decoding; low-density parity-check codes; maximum-likelihood decoding; memoryless binary-input output-symmetric channel; parallel channels; AWGN; Block codes; Error correction codes; Gas insulated transmission lines; Iterative decoding; Maximum likelihood decoding; Parity check codes; Performance analysis; Signal analysis; Upper bound; Complexity; iterative decoding; low-density parity-check (LDPC) codes; maximum-likelihood (ML) decoding; parallel channels; punctured codes;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2006.889462
