By Topic

The Cramer-Rao bound for phase estimation from coded linearly modulated signals

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

3 Author(s)
Noels, N. ; Dept. of Telecommun. & Inf. Process., Ghent Univ., Gent, Belgium ; Steendam, H. ; Moeneclaey, M.

In this letter, we express the Cramer-Rao bound (CRB) for carrier phase estimation from a noisy linearly modulated signal with encoded data symbols, in terms of the marginal a posteriori probabilities (APPs) of the coded symbols. For a wide range of classical codes (block codes, convolutional codes, and trellis-coded modulation), these marginal APPs can be computed efficiently by means of the Bahl-Cocke-Jelinke-Raviv (BCJR) algorithm, whereas for codes that involve interleaving (turbo codes and bit interleaved coded modulation), iterated application of the BCJR algorithm is required. Our numerical results show that when the BER of the coded system is less than about 10/sup -3/, the resulting CRB is essentially the same as when transmitting a training sequence.

Published in:

Communications Letters, IEEE  (Volume:7 ,  Issue: 5 )