Paper Info
Title
Achieving Channel Capacity with Low Complexity RS-BTC Using QPSK over AWGN Channel
Abstract
High code rate Block Turbo Codes (BTC) using Bose-Chaudhuri-Hocquenghem (BCH) codes have already demonstrated near Shannon performances for Quadrature Phase-Shift Keying (QPSK) over Additive White Gaussian Noise (AWGN) channel. We show here that reliable transmission can be achieved at less than I dB from Shannon limit with very low complexity Reed-Solomon (RS) BTC under the same transmission condition. This is due to a proper choice of RS component codes used to construct RS product codes. Furthermore the size of the coded blocks required for RS-BTC to achieve a given code rate is much smaller than for BCH-BTC which is very attractive for practical considerations.
Year
DOI
Venue
2004
10.1007/978-3-540-27824-5_24
LECTURE NOTES IN COMPUTER SCIENCE
Keywords
Field
DocType
bch code,turbo code,reed solomon,additive white gaussian noise,product code,channel capacity
Discrete mathematics,Concatenated error correction code,Block code,Turbo code,Arithmetic,Algorithm,Reed–Solomon error correction,BCH code,Channel capacity,Noisy-channel coding theorem,Mathematics,Phase-shift keying
Conference
Volume
ISSN
Citations 
3124
0302-9743
0
PageRank 
References 
Authors
0.34
5
4
Name
Order
Citations
PageRank
Rong Zhou170.97
Annie Picart255351.00
Ramesh Pyndiah37917.12
André Goalic4142.84