Design and implementation of channel decoder with LDPC code

被引:0
作者
Hu, Diqing [1 ]
Wang, Peng [1 ]
Wang, Jianzong [1 ]
Li, Tianquan [2 ]
机构
[1] Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Peoples R China
[2] Dezhou Vocat & Tech Coll, Dezhou, Peoples R China
来源
EIGHTH INTERNATIONAL SYMPOSIUM ON OPTICAL STORAGE AND 2008 INTERNATIONAL WORKSHOP ON INFORMATION DATA STORAGE | 2009年 / 7125卷
关键词
Low-Density Parity Check code; Error rate; Channel Decoding; High-Density Optical Disk; PARITY-CHECK CODES;
D O I
10.1117/12.822646
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Because Toshiba quit the competition, there is only one standard of blue-ray disc: BLU-RAY DISC, which satisfies the demands of high-density video programs. But almost all the patents are gotten by big companies such as Sony, Philips. As a result we must pay much for these patents when our productions use BD. As our own high-density optical disk storage system, Next-Generation Versatile Disc(NVD) which proposes a new data format and error correction code with independent intellectual property rights and high cost performance owns higher coding efficiency than DVD and 12GB which could meet the demands of playing the high-density video programs. In this paper, we develop Low-Density Parity-Check Codes (LDPC): a new channel encoding process and application scheme using Q-matrix based on LDPC encoding has application in NVD's channel decoder. And combined with the embedded system portable feature of SOPC system, we have completed all the decoding modules by FPGA. In the NVD experiment environment, tests are done. Though there are collisions between LDPC and Run-Length-Limited modulation codes (RLL) which are used in optical storage system frequently, the system is provided as a suitable solution. At the same time, it overcomes the defects of the instability and inextensibility, which occurred in the former decoding system of NVD-it was implemented by hardware.
引用
收藏
页数:5
相关论文
共 18 条
[1]  
Aji S.M., 1998, IEEE International Symposium of Information Theory, P276
[2]   Expander graph arguments for message-passing algorithms [J].
Burshtein, D ;
Miller, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :782-790
[3]  
Chen J., 2001, IEEE T COMMUN, V50, P189
[4]   Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation [J].
Chung, SY ;
Richardson, TJ ;
Urbanke, RL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :657-670
[5]   On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit [J].
Chung, SY ;
Forney, GD ;
Richardson, TJ ;
Urbanke, R .
IEEE COMMUNICATIONS LETTERS, 2001, 5 (02) :58-60
[6]  
Davey M.C., 1999, Ph.D. Thesis
[7]   Iterative reliability-based decoding of low-density parity check codes [J].
Fossorier, MPC .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2001, 19 (05) :908-917
[8]   Reduced complexity iterative decoding of low-density parity check codes based on belief propagation [J].
Fossorier, MPC ;
Mihaljevic, M ;
Imai, H .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1999, 47 (05) :673-680
[9]  
GALLAGER RG, 1960, THESIS MIT CAMBRIDGE
[10]   Factor graphs and the sum-product algorithm [J].
Kschischang, FR ;
Frey, BJ ;
Loeliger, HA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :498-519