Low-complexity and piecewise systematic encoding of non-full-rank QC-LDPC codes

Chien Fu Tseng, Jenn-Hawn Tarng

研究成果: Article同行評審

7 引文 斯高帕斯(Scopus)

摘要

In this letter, we present a low-complexity encoding method for quasi-cyclic (QC) low-density parity-check (LDPC) codes in the case of non-full-rank parity-check matrices. Gaussian elimination can achieve systematic encoding, but it is usually too complex to implement. For QC-LDPC codes, efficient encoding methods have been presented by using shift-registers, but the encoded codewords are not systematic when parity-check matrices are non-full-rank. However, a systematic structure is important in practice. Therefore, we propose an encoding method which allows all information bits appear piecewise in the codeword, called piecewise systematic encoding.

原文English
文章編號7056546
頁(從 - 到)897-900
頁數4
期刊IEEE Communications Letters
19
發行號6
DOIs
出版狀態Published - 1 6月 2015

指紋

深入研究「Low-complexity and piecewise systematic encoding of non-full-rank QC-LDPC codes」主題。共同形成了獨特的指紋。

引用此