Low-Complexity and Piecewise Systematic Encoding of Non-Full-Rank QC-LDPC Codes

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2015-06-01

類型

期刊名稱

IEEE COMMUNICATIONS LETTERS

卷期與頁次

第 19 卷,頁 897–900

ISSN

1089-7798

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Tseng, C.-F., & Tarng, J.-H. (2015). Low-Complexity and Piecewise Systematic Encoding of Non-Full-Rank QC-LDPC Codes. IEEE COMMUNICATIONS LETTERS, 19, 897–900. https://doi.org/10.1109/LCOMM.2015.2411255

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/127913