DocumentCode
1124635
Title
Low-Complexity High-Rate Reed--Solomon Block Turbo Codes
Author
Zhou, Rong ; Le Bidan, Raphaël ; Pyndiah, Ramesh ; Goalic, André
Author_Institution
Ecole Nat. Suprieure des Telecommun., Brest
Volume
55
Issue
9
fYear
2007
Firstpage
1656
Lastpage
1660
Abstract
This letter considers high-rate block turbo codes (BTC) obtained by concatenation of two single-error-correcting Reed-Solomon (RS) constituent codes. Simulation results show that these codes perform within 1 dB of the theoretical limit for binary transmission over additive white Gaussian noise with a low-complexity decoder. A comparison with Bose-Chaudhuri-Hocquenghem BTCs of similar code rate reveals that RS BTCs have interesting advantages in terms of memory size and decoder complexity for very-high-data-rate decoding architectures.
Keywords
Gaussian noise; Reed-Solomon codes; error correction codes; turbo codes; white noise; additive white Gaussian noise; binary transmission; block turbo codes; low-complexity decoder; single-error-correcting Reed-Solomon code; Additive white noise; Concatenated codes; Convolutional codes; Digital communication; Error correction codes; Forward error correction; Iterative decoding; Parity check codes; Product codes; Turbo codes; Block turbo codes (BTC); Reed--Solomon codes; product codes;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2007.904365
Filename
4303371
Link To Document