標題: Low-Complexity and Piecewise Systematic Encoding of Non-Full-Rank QC-LDPC Codes
作者: Tseng, Chien-Fu
Tarng, Jenn-Hwan
電機資訊學士班
電信工程研究所
Undergraduate Honors Program of Electrical Engineering and Computer Science
Institute of Communications Engineering
關鍵字: Systematic;encoding;quasi-cyclic (QC) low-density parity-check (LDPC) codes
公開日期: 1-Jun-2015
摘要: 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.
URI: http://dx.doi.org/10.1109/LCOMM.2015.2411255
http://hdl.handle.net/11536/127913
ISSN: 1089-7798
DOI: 10.1109/LCOMM.2015.2411255
期刊: IEEE COMMUNICATIONS LETTERS
Volume: 19
起始頁: 897
結束頁: 900
Appears in Collections:Articles