DocumentCode :
778502
Title :
Performance-Complexity Tradeoffs of Raptor Codes over Gaussian Channels
Author :
Hu, Ketai ; Castura, Jeff ; Mao, Yongyi
Author_Institution :
SITE, Ottawa Univ., Ont.
Volume :
11
Issue :
4
fYear :
2007
fDate :
4/1/2007 12:00:00 AM
Firstpage :
343
Lastpage :
345
Abstract :
We investigate the performance-complexity tradeoffs of Raptor codes over Gaussian channels. Two different implementations of the belief-propagation (BP) decoding algorithm are considered, which we respectively refer to as "message-reset decoding" and "incremental decoding". We show that incremental decoding offers great advantages over message-reset decoding in terms of this tradeoff
Keywords :
Gaussian channels; channel coding; decoding; Gaussian channels; Raptor codes; belief-propagation decoding algorithm; incremental decoding; message-reset decoding; AWGN; Additive white noise; Belief propagation; Fading; Gaussian channels; Gaussian noise; Helium; Iterative decoding; Parity check codes; Uncertainty;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOM.2007.348295
Filename :
4155637
Link To Document :
بازگشت