Title :
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications
Author :
Sason, Igal ; Wiechman, Gil
Author_Institution :
Technion, Haifa
Abstract :
The paper presents bounds on the achievable rates and the decoding complexity per iteration of low-density parity-check (LDPC) codes. It is assumed that the communication of these codes takes place over statistically independent parallel channels where these channels are memoryless, binary-input and output-symmetric. The bounds are applied to punctured LDPC codes. A diagram concludes our discussion by showing interconnections between the theorems in this paper and some previously reported results
Keywords :
channel coding; computational complexity; iterative decoding; parity check codes; statistical analysis; LDPC codes; decoding complexity; information-theoretic bounds; low-density parity-check; statistically independent parallel channels; Bipartite graph; Communication systems; Distortion; Error probability; Gas insulated transmission lines; Iterative decoding; Maximum likelihood decoding; Parity check codes; Quantization; Upper bound;
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
DOI :
10.1109/ISIT.2006.261700
