By Topic

Convolutional Code Performance in the Rician Fading Channel

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
$33 $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

2 Author(s)
J. Modestino ; Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY ; Shou Mui

The performance of short constraint length convolutional codes in conjunction with binary phase-shift keyed (BPSK) modulation and Viterbi maximum likelihood decoding on the classical Rician fading channel is examined in detail. Primary interest is in the bit error probability performance as a function of E_{b}/N_{0} parameterized by the fading channel parameters. Fairly general upper bounds on bit error probability performance in the presence of fading are obtained and compared with simulation results in the two extremes of zero channel memory and infinite channel memory. The efficacy of simple block interleaving in combating the memory of the channel is thoroughly explored. Results include the effects of fading on tracking loop performance and the subsequent impact on overall coded system performance. The approach is analytical where possible; otherwise resort is made to digital computer simulation.

Published in:

IEEE Transactions on Communications  (Volume:24 ,  Issue: 6 )