Paper Info
Title
Low-Complexity High-Rate Reed--Solomon Block Turbo Codes
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.
Year
DOI
Venue
2007
10.1109/TCOMM.2007.904365
IEEE Transactions on Communications
Keywords
Field
DocType
turbo codes,block turbo codes,reed-solomon codes,low-complexity decoder,error correction codes,single-error-correcting reed-solomon code,product codes,reed--solomon codes,additive white gaussian noise,white noise,gaussian noise,binary transmission,block turbo codes (btc),turbo code,product code,error correction,reed solomon,reed solomon code
Concatenated error correction code,Computer science,Serial concatenated convolutional codes,Turbo code,Block code,Algorithm,Arithmetic,Reed–Solomon error correction,Error detection and correction,Linear code,Turbo equalizer
Journal
Volume
Issue
ISSN
55
9
0090-6778
Citations 
PageRank 
References 
7
0.63
10
Authors
4
Name
Order
Citations
PageRank
Rong Zhou170.97
Raphaël Le Bidan2143.39
Ramesh Pyndiah37917.12
André Goalic4142.84