TS-LDPC codes: Turbo-structured codes with large girth

被引：8
|
作者：
Lu, Jin [1 ]
Moura, Jose M. F.
机构：
[1] Sun Microsyst, Louisville, CO 80028 USA
[2] Carnegie Mellon Univ, Dept Elect & Comp Engn, Pittsburgh, PA 15213 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2007年 / 53卷 / 03期
基金：
美国安德鲁·梅隆基金会;
关键词：
error floor; girth; interleaver; low-density parity-check (LDPC) codes; turbo-structured;
D O I：
10.1109/TIT.2006.890690
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We consider turbo-structured low-density parity-check (TS-LDPC) codes-structured regular codes whose Tanner graph is composed of two trees connected by an interleaver. TS-LDPC codes with good girth properties are easy to construct: careful design of the interleaver component prevents short cycles of any desired length in its Tanner graph. We present algorithms to construct TS-LDPC codes with arbitrary column weight j >= 2 and row weight k and arbitrary girth g. We develop a linear complexity encoding algorithm for a type of TS-LDPC codes-encoding friendly TS-LDPC (EFTS-LDPC) codes. Simulation results demonstrate that the bit-error rate (BER) performance at low signal-to-noise ratio (SNR) is competitive with the error performance of random LDPC codes of the same size, with better error floor properties at high SNR.
引用
收藏
页码：1080 / 1094
页数：15
相关论文
共 50 条
  • [31] Some voltage graph-based LDPC tailbiting codes with large girth
    Bocharova, Irina E.
    Hug, Florian
    Johannesson, Rolf
    Kudryashov, Boris D.
    Satyukov, Roman V.
    IEEE International Symposium on Information Theory - Proceedings, 2011, : 732 - 736
  • [32] Node-splitting Constructions for Large Girth Irregular and Protograph LDPC Codes
    Subramanian, Srinivas
    Pradhan, Asit Kumar
    Thangaraj, Andrew
    2014 TWENTIETH NATIONAL CONFERENCE ON COMMUNICATIONS (NCC), 2014,
  • [33] Research on Regular LDPC Codes with better Performance than Turbo Codes
    Han Jian-Bing
    He Chen
    He He Yun
    2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II, 2009, : 390 - +
  • [34] Large-Girth Nonbinary QC-LDPC Codes of Various Lengths
    Huang, Jie
    Liu, Lei
    Zhou, Wuyang
    Zhou, Shengli
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (12) : 3436 - 3447
  • [35] Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth
    Bocharova, Irina E.
    Hug, Florian
    Johannesson, Rolf
    Kudryashov, Boris D.
    Satyukov, Roman V.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (04) : 2265 - 2279
  • [36] Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth
    Bocharova, Irina E.
    Hug, Florian
    Johannesson, Rolf
    Kudryashov, Boris D.
    Satyukov, Roman V.
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 732 - 736
  • [37] A Fast Searching Method for the Construction of QC-LDPC Codes with Large Girth
    Lau, Francis C. M.
    Tam, Wai Man
    2012 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS (ISCC), 2012, : 125 - 128
  • [38] Recursive Design of High Girth (2,k) LDPC Codes from (k,k) LDPC Codes
    Tao, Xiongfei
    Zheng, Lixin
    Liu, Weizhong
    Liu, Dongsheng
    IEEE COMMUNICATIONS LETTERS, 2011, 15 (01) : 70 - 72
  • [39] UNIFIED DECODER ARCHITECTURE FOR LDPC/TURBO CODES
    Sun, Yang
    Cavallaro, Joseph R.
    2008 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS: SIPS 2008, PROCEEDINGS, 2008, : 13 - 18
  • [40] ML performance bounds of Turbo and LDPC codes
    Chen, Kuan-Chi
    Wu, Meng-Lin
    Chen, Hsiao-Hsien
    Shiu, Da-Shan
    2012 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2012,
12345