Binary Wyner-Ziv code design based on compound LDGM-LDPC structures

被引:6
作者
Nangir, Mahdi [1 ]
Ahmadian-Attari, Mahmoud [1 ]
Asvadi, Reza [2 ]
机构
[1] KN Toosi Univ Technol, Fac Elect Engn, Tehran, Iran
[2] Shahid Beheshti Univ, Fac Elect Engn, Tehran, Iran
关键词
codecs; message passing; binary codes; parity check codes; binary Wyner-Ziv code design; compound LDGM-LDPC structures; coding scheme; low-density generator-matrix; low-density parity-check codes; LDPC codes; binary quantisation; syndrome-coding technique; iterative message-passing algorithms; encoding; decoding; GENERATOR MATRIX CODES; SIDE INFORMATION; CONSTRUCTION; COMPRESSION; DECODER;
D O I
10.1049/iet-com.2017.0032
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this study, a practical coding scheme is designed for the binary Wyner-Ziv (WZ) problem by using nested low-density generator-matrix (LDGM) and low-density parity-check (LDPC) codes. This scheme contains two steps in the encoding procedure. The first step involves applying the binary quantisation by employing LDGM codes and the second one is using the syndrome-coding technique by utilising LDPC codes. The decoding algorithm of the proposed scheme is based on the sum-product algorithm with the help of a side information available at the decoder side. It is theoretically shown that the compound structure has the capability of achieving the WZ bound. The proposed method approaches this bound by utilising the iterative message-passing algorithms in both encoding and decoding, although theoretical results show that it is asymptotically achievable.
引用
收藏
页码:375 / 383
页数:9
相关论文
共 22 条
  • [1] Approaching the Rate-Distortion Limit With Spatial Coupling, Belief Propagation, and Decimation
    Aref, Vahid
    Macris, Nicolas
    Vuffray, Marc
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (07) : 3954 - 3979
  • [2] Improving irregular turbo codes
    Ben Ismail, D. Kbaier
    Douillard, C.
    Kerouedan, S.
    [J]. ELECTRONICS LETTERS, 2011, 47 (21) : 1184 - U43
  • [3] Eghbalian-Arani S., 2013, P IEEE 10 INT S WIR, P1
  • [4] Filler T., 2007, THESIS
  • [5] Filler T., 2007, 45 ALL C COMM CONTR
  • [6] Selective max-min algorithm for low-density parity-check decoding
    Hareedy, Ahmed H.
    Khairy, Mohamed M.
    [J]. IET COMMUNICATIONS, 2013, 7 (01) : 65 - 70
  • [7] Hsu C.-C. N., 2006, THESIS
  • [8] Algebraic Constructions of Graph-Based Nested Codes from Protographs
    Kelley, Christine A.
    Kliewer, Joerg
    [J]. 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 829 - 833
  • [9] Kumar S, 2014, IEEE INT SYMP INFO, P516, DOI 10.1109/ISIT.2014.6874886
  • [10] Liu L, 2015, 2015 IEEE INFORMATION THEORY WORKSHOP - FALL (ITW), P342, DOI 10.1109/ITWF.2015.7360792