Soft decoding method for systematic raptor codes

Raptor codes are a class of rateless codes that were originally designed for binary erasure channels. To enhance their performance, multiple soft iterative loops can be employed in the decoder. In this study, the authors propose a method to construct modified Tanner graphs for systematic raptor code...

Full description

Saved in:
Bibliographic Details
Published in:IET communications Vol. 9; no. 16; pp. 1933 - 1940
Main Authors: Zhang, Meixiang, Kim, Sooyoung, Chang, Jin Yeong, Kim, Won-Yong
Format: Journal Article
Language:English
Published: The Institution of Engineering and Technology 05.11.2015
Subjects:
Algorithms
binary erasure channels
channel coding
Channels
Computer simulation
decoder
Decoders
Decoding
decoding performance
Graphs
iterative decoding
iterative soft decoding method
Luby transform codes
modified Tanner graph
parallel decoding method
Performance enhancement
rateless codes
soft decoding method
soft iterative decoding algorithm
systematic Raptor codes
transform coding
Transforms
channel coding
binary erasure channels
rateless codes
decoder
decoding performance
decoding
iterative decoding
soft decoding method
iterative soft decoding method
systematic Raptor codes
modified Tanner graph
transform coding
soft iterative decoding algorithm
Luby transform codes
parallel decoding method
ISSN:1751-8628, 1751-8636
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Raptor codes are a class of rateless codes that were originally designed for binary erasure channels. To enhance their performance, multiple soft iterative loops can be employed in the decoder. In this study, the authors propose a method to construct modified Tanner graphs for systematic raptor codes in order to increase the efficiency of soft decoding. A modified Tanner graph is drawn in terms of bit and check nodes for each component code, instead of encoding and information nodes, as in conventional Tanner graphs, for its component Luby transform codes. This modified Tanner graph enables the use of a more simplified soft iterative decoding algorithm and provides improved decoding performance compared with the conventional method. In addition, they propose an efficient joint iterative soft decoding method with a parallel process to speed up the iterative decoding. The simulation results in this study reveal that the modified Tanner graph works better than the conventional Tanner graph for joint iterative decoding, and that the proposed parallel decoding method can contribute to further enhance the performance as well as the decoding speed by reducing the average number of iterations.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1751-8628
1751-8636
DOI:10.1049/iet-com.2015.0100