By Topic

Bounds on the Decoding Error Probability of Binary Block Codes over Noncoherent Block AWGN and Fading Channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Xiaofu Wu ; Dept. of Electron., Peking Univ., Beijing ; Haige Xiang ; Cong Ling ; Xiaohu You
more authors

We derive upper bounds on the decoding error probability of binary block codes over noncoherent block additive white Gaussian noise (AWGN) and fading channels, with applications to turbo codes. By a block AWGN (or fading) channel, we mean that the carrier phase (or fading) is assumed to be constant over each block but independently varying from one block to another. The union bounds are derived for both noncoherent block AWGN and fading channels. For the block fading channel with a small number of fading blocks, we further derive an improved bound by employing Gallager's first bounding technique. The analytical bounds are compared to the simulation results for a coded block-based differential phase shift keying (B-DPSK) system under a practical noncoherent iterative decoding scheme proposed by Chen et al. We show that the proposed Gallager bound is very tight for the block fading channel with a small number of fading blocks, and the practical noncoherent receiver performs well for a wide range of block fading channels

Published in:

Wireless Communications, IEEE Transactions on  (Volume:5 ,  Issue: 11 )