New Gallager bounds in block-fading channels

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.http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000243953400015&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701Computer Science, Information SystemsEngineering, Electrical & ElectronicSCI(E)EI9ARTICLE2684-6945