The Encoding Algorithm of Non-Binary Quasi-Cyclic LDPC Cycle Codes on Tanner Graph

Wang Xiuni

9th International Conference on Communications and Networking in China

Research Article

The Encoding Algorithm of Non-Binary Quasi-Cyclic LDPC Cycle Codes on Tanner Graph

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/icst.chinacom.2014.256221,
    author={Wang Xiuni},
    title={The Encoding Algorithm of Non-Binary Quasi-Cyclic LDPC Cycle Codes on Tanner Graph},
    proceedings={9th International Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2015},
    month={1},
    keywords={encoding algorithm cycle codes non-binary low-density parity check codes tanner graph},
    doi={10.4108/icst.chinacom.2014.256221}
}

Wang Xiuni
Year: 2015
The Encoding Algorithm of Non-Binary Quasi-Cyclic LDPC Cycle Codes on Tanner Graph
CHINACOM
IEEE
DOI: 10.4108/icst.chinacom.2014.256221

Wang Xiuni^,*

*Contact email: wang.xiuni@gmail.com

Abstract

A low-density parity-check (LDPC) code of column weight of 2 is known as an LDPC cycle code. In this letter, we study the encoding algorithm about a type of non-binary quasicyclic LDPC cycle codes. The position of parity check symbols is located firstly through parity check equations. Then, we show that these parity check symbols can be calculated linearly through the corresponding Tanner graph. It turns out that the decoder can be used as the encoder.

Keywords: encoding algorithm cycle codes non-binary low-density parity check codes tanner graph

Published: 2015-01-21
Publisher: IEEE
Appears in: IEEEXplore

: http://dx.doi.org/10.4108/icst.chinacom.2014.256221