Name
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 |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/TIT.2006.888999 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
turbo codes,interleaved fading channels,near-ergodic block-fading channel,linear codes,proposed gallager,fading channels,binary linear codes,block-fading channels,second-bounding technique,channel coding,new gallager bounds,special case,proposed bound,general form,ds2-exponential bound,block codes,existing bound,gallager's bounding techniques,binary codes,spherical bound,gallager bounds,binary linear code,block-fading channel,upper bounds,interleaved codes,weight enumeration,error performance,turbo code,upper bound,linear code,indexing terms,fading channel | Discrete mathematics,Ergodicity,Combinatorics,Computer science,Fading,Upper and lower bounds,Quasistatic process,Binary code,Turbo code,Block code,Linear code | Journal |
Volume | Issue | ISSN |
53 | 2 | 0018-9448 |
Citations | PageRank | References |
12 | 0.57 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaofu Wu | 1 | 223 | 29.74 |
| Haige Xiang | 2 | 154 | 30.35 |
| Cong Ling | 3 | 688 | 68.90 |