DocumentCode
1727994
Title
New codes on graphs constructed by connecting spatially coupled chains
Author
Truhachev, Dmitry ; Mitchell, David ; Lentmaier, Michael ; Costello, Daniel J.
Author_Institution
Dept. of Comput. Sci., Univ. of Alberta, Edmonton, AB, Canada
fYear
2012
Firstpage
392
Lastpage
397
Abstract
A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) code chains is presented. The proposed code ensembles are described by graphs in which individual SC-LDPC code chains of various lengths serve as edges. We demonstrate that connecting several appropriately chosen SC-LDPC code chains results in improved iterative decoding thresholds compared to those of a single coupled chain in addition to reducing the decoding complexity required to achieve a specific bit error probability.
Keywords
error statistics; graph theory; iterative decoding; parity check codes; SC-LDPC code; bit error probability; code construction; graph theory; iterative decoding; low density parity check code; spatially coupled LDPC code chains; Block codes; Convergence; Couplings; Error probability; Iterative decoding; Joining processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Applications Workshop (ITA), 2012
Conference_Location
San Diego, CA
Print_ISBN
978-1-4673-1473-2
Type
conf
DOI
10.1109/ITA.2012.6181771
Filename
6181771
Link To Document