DocumentCode :
995759
Title :
New Gallager Bounds in Block-Fading Channels
Author :
Wu, Xiaofu ; Xiang, Haige ; Ling, Cong
Author_Institution :
Dept. of Electron., Tsinghua Univ., Beijing
Volume :
53
Issue :
2
fYear :
2007
Firstpage :
684
Lastpage :
694
Abstract :
In this paper, we propose a new upper bound on the error performance of binary linear codes over block-fading channels by employing Gallager´s first- and second-bounding techniques. As the proposed bound is numerically intensive in its general form, we consider two special cases, namely, the spherical bound and the DS2-exponential bound, which are found to be tight in nonergodic and near-ergodic block-fading channels, respectively. The tightness of the proposed bounds is demonstrated for turbo codes. Many existing bounds for quasistatic or fully interleaved fading channels can be viewed as special cases of the proposed Gallager bound
Keywords :
binary codes; block codes; channel coding; fading channels; interleaved codes; linear codes; turbo codes; DS2-exponential bound; Gallager´s bounding techniques; binary linear codes; block-fading channels; error performance; interleaved fading channels; spherical bound; turbo codes; AWGN; Additive white noise; Block codes; Error probability; Fading; Linear code; Maximum likelihood decoding; Parity check codes; Turbo codes; Upper bound; Block-fading channels; Gallager bounds; turbo codes; upper bounds; weight enumeration;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2006.888999
Filename :
4069164
Link To Document :
بازگشت