Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Moision, B. ; Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA ; Hamkins, J.

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