基于稀疏二进制序列的低密度奇偶校验码.pdfVIP

26 6 Vol. 26 No. 6 2005 6 Journal on Communications June 2005 2 10096 LDPC LDPC 1 Tanner 8 LDPC TN911.22 A 1000-436X(2005)06-0081-06 Low-density parity-check codes based on sparse binary sequences HE Shan-bao, ZHAO Chun-ming, SHI Zhi-hua, JIANG Ming (National Mobile Communications Research Lab., outheast Univ., Nanj ing 210096, China) Abstract: A novel and s mple construct on of regular LDPC codes was proposed, wh ch used sparse b nary sequences, through study ng construct on methods of LDPC codes. The d str but on matr x of ones n par ty-check matr x was ntroduced nto the new construct on. The cycl c cross correlat on funct on and the cycl c auto correlat on funct on were ut l zed to ensure that the g rth of Tanner graph was e ght. The new codes perform well us ng the sum-product algor thm for terat ve decod ng. Low encod ng complex ty can also be ach eved due to the nherent quas -cycl c structure of the LDPC codes. Key words: low-dens ty par ty-check codes; sparse b nary sequences; quas -cycl c codes; terat ve decod ng; sum-product algor thm Gallager 1 MacKay LDPC Gallager [6], [7] 2 6 [1, 2] MacKay PEG MacKay Neal[3] Sipser Spielman[4] Wiberg[5]