Open AccessLow‐complexity encoder for LDPC codes in space applications
Author(s) -
Chen Weigang,
Han Changcai,
Yang Jinsheng
Publication year - 2019
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2019.2417
Subject(s) - low density parity check code , encoder , parity check matrix , computer science , generator matrix , circulant matrix , computational complexity theory , algorithm , encoding (memory) , block code , parallel computing , theoretical computer science , decoding methods , artificial intelligence , operating system
A low complexity encoding method and encoder architecture are proposed for the low‐density parity‐check (LDPC) codes in space applications recommended by Consultant Committee for Space Data Systems. This method uses the generator matrix partition and decomposition to obtain a much smaller dense core matrix. Thus, only one quarter of dense block matrices need to be implemented using the traditional circulant encoding structure. Therefore, the encoder can be implemented with lower computation and storage complexity.