Low complexity LDPC codes for partial response channels
作者： Hongwei Song , Jingfeng Liu , BVK Vijaya Kumar
DOI: 10.1109/GLOCOM.2002.1188406
关键词: Computer science 、 Error detection and correction 、 Block code 、 Serial concatenated convolutional codes 、 Parity-check matrix 、 Low-density parity-check code 、 Raptor code 、 Turbo code 、 Linear code 、 Error floor 、 Algorithm 、 Concatenation 、 Block error 、 Bit error rate 、 Concatenated error correction code 、 Forward error correction 、 Communication channel 、 Decoding methods 、 Hamming code
摘要: This paper constructs and analyzes a class of regular LDPC codes with column weight j=2, in contrast to the often-used j/spl ges/3 setting. These possess several significant features. First, they are free 6-cycle, can be easily constructed for large range code rates. Secondly, parity check matrix represented by simple set, thus lending itself low complexity implementation. Thirdly, proposed concatenated proper precoder outperform partial response (PR) channels. Finally, exhibit block error statistics significantly different from ges/3, making them more compatible Reed-Solomon correction codes. The coded channel is formulated as dynamical model analyzed using density evolution technique, which used explain behavior system. A high rate (8/9) size 4608 an example, its bit (BER), statistics, decoding convergence over ideal PR investigated simulation. simulation results consistent analysis, both indicating that j=2 attractive targets magnetic recording examples illustrate performance
sci-hub.se 参考文章(16)
Yu Kou, Shu Lin, Marc Fossorier, Low Density Parity Check Codes Based on Finite Geometries: A Rediscovery and More Proceeding of ISITA2000, Sorrento, Italy, June. ,(1999)
L. R. Bahl, Optimal decoding of linear codes for minimizing symbol error rate IEEE Transactions on Information Theory. ,vol. 20, pp. 284- 287 ,(1974)
David J. C. MacKay, Matthew C. Davey, Evaluation of Gallager Codes for Short Block Length and High Rate Applications IMA. ,vol. 123, pp. 113- 130 ,(2001) , 10.1007/978-1-4613-0165-3_6
B. Vasic, Structured iteratively decodable codes based on Steiner systems and their application in magnetic recording global communications conference. ,vol. 5, pp. 2954- 2960 ,(2001) , 10.1109/GLOCOM.2001.965969
Zhi Chen, Pingzhi Fan, Fan Jin, Disjoint difference sets, difference triangle sets, and related codes IEEE Transactions on Information Theory. ,vol. 38, pp. 518- 522 ,(1992) , 10.1109/18.119715
L. Bahl, J. Cocke, F. Jelinek, J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) IEEE Transactions on Information Theory. ,vol. 20, pp. 284- 287 ,(1974) , 10.1109/TIT.1974.1055186
K.R. Narayanan, Effect of precoding on the convergence of turbo equalization for partial response channels IEEE Journal on Selected Areas in Communications. ,vol. 19, pp. 686- 698 ,(2001) , 10.1109/49.920177
Xiao-Yu Hu, E. Eleftheriou, D.-M. Arnold, Progressive edge-growth Tanner graphs global communications conference. ,vol. 2, pp. 995- 1001 ,(2001) , 10.1109/GLOCOM.2001.965567
H. El Gamal, A.R. Hammons, Analyzing the turbo decoder using the Gaussian approximation international symposium on information theory. ,vol. 47, pp. 671- 686 ,(2000) , 10.1109/18.910581
Sae-Young Chung, G. David Forney, On the construction of some capacity-approaching coding schemes Massachusetts Institute of Technology. ,(2000)