Concatenated zigzag Hadamard codes

被引:26
|
作者
Leung, WKR [1 ]
Yue, GS
Ping, L
Wang, XD
机构
[1] Huawei Technol Co Ltd, Res Dept PSMT, Shenzhen 518129, Peoples R China
[2] NEC Labs Amer Inc, Princeton, NJ 08540 USA
[3] City Univ Hong Kong, Dept Elect Engn, Kowloon, Hong Kong, Peoples R China
[4] Columbia Univ, Dept Elect Engn, New York, NY 10027 USA
基金
美国国家科学基金会;
关键词
extrinsic mutual information transfer (EXIT) chart; Hadamard codes; low-complexity decoding; low rate; parallel concatenation; union bound; zigzag codes;
D O I
10.1109/TIT.2006.871613
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this correspondence, we introduce a new class of low-rate error correction codes called zigzag Hadamard (ZH) codes and their concatenation schemes. Each member of this class of codes is specified by a highly structured zigzag graph with each segment being a Hadamard codeword. The ZH codes enjoy extremely simple encoding and very low-complexity soft-input-soft-output (SISO) decoding based on a posteriori probability (APP) fast Hadamard transform (FHT) technique. We present an asymptotic performance analysis of the proposed concatenated ZH codes using the extrinsic mutual information transfer (EXIT) chart for infinite-length codes. We also provide a union bound analysis of the error performance for finite-length codes. Furthermore, the concatenated ZH codes are shown to be a good class of codes in the low-rate region. Specifically, a rate-0.0107 concatenated code with three ZH components and an inter-leaver size of 65536 can achieve the bit error rate (BER) performance of 10(-5) at -1.15 dB, which is only 0.44 dB away from the ultimate Shannon limit. The proposed concatenated ZH codes offer similar performance as another class of low-rate codes-the turbo-Hadamard codes, and better performance than superorthogonal turbo codes, with much lower encoding and decoding complexities.
引用
收藏
页码:1711 / 1723
页数:13
相关论文
共 50 条
  • [31] Concatenated Polar Codes
    Bakshi, Mayank
    Jaggi, Sidharth
    Effros, Michelle
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 918 - 922
  • [32] SUPERIMPOSED CONCATENATED CODES
    SUGIYAMA, Y
    KASAHARA, M
    HIRASAWA, S
    NAMEKAWA, T
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (06) : 735 - 736
  • [33] ON DECODING CONCATENATED CODES
    HASSAN, AA
    STARK, WE
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (03) : 677 - 683
  • [34] On generalised concatenated codes
    Sonander, S
    Honary, B
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 1997, 1355 : 307 - 316
  • [35] Concatenated prime codes
    Hong, CF
    Yang, GC
    IEEE COMMUNICATIONS LETTERS, 1999, 3 (09) : 260 - 262
  • [36] CONCATENATED CODES WITH CONVOLUTIONAL INNER CODES
    JUSTESEN, J
    THOMMESEN, C
    ZYABLOV, VV
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) : 1217 - 1225
  • [37] Block codes concatenated polar codes
    Zhou T.
    Li Y.
    Zhou, Tianxin (tianxinzhou628@163.com), 2018, Science Press (45): : 64 - 68
  • [38] CONCATENATED SPHERICAL CODES
    ERICSON, T
    ZINOVIEV, VA
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 514 : 2 - 5
  • [39] Concatenated kernel codes
    Selvakumar, R.
    Kumar, C. Pavan
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020, 12 (03)
  • [40] Concatenated block codes
    Hwegi, Yousef
    Ali, Nasser
    Osman, Mahmod
    2010 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND AUTOMATION ENGINEERING (ICCAE 2010), VOL 4, 2010, : 246 - 249