By Topic

Low-complexity serially-concatenated coding for the deep space optical 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)
B. Moision ; Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA ; J. Hamkins

This paper discusses the iterative decoding of a serial concatenation of a short constraint length convolutional code and coded PPM through a bit interleaver. To reduce the complexity of iterative decoding, we propose to compute and store only a subset of the channel likelihoods. We show that this can be done while suffering a negligible loss in performance. The complexity of implementing the forward-backward algorithm is also reduced when partial likelihoods are retained and when optical links are used to support deep space communication at high data rates.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003