Papers
Topics
Authors
Recent
Search
2000 character limit reached

Reed-Solomon and Concatenated Codes with Applications in Space Communication

Published 13 Aug 2016 in cs.IT and math.IT | (1608.03961v1)

Abstract: In this paper we provide a detailed description of Reed-Solomon (RS) codes, the most important algorithms for decoding them, and their use in concatenated coding systems for space applications. In the current literature there is scattered information regarding the bit-level implementation of such codes for either space systems or any other type of application. Consequently, we start with a general overview of the channel coding systems used in space communications and then we focus in the finest details. We first present a detailed description of the required algebra of RS codes with detailed examples. Next, the steps of the encoding and decoding algorithms are described with detail and again with additional examples. Next, we focus on a particularly important class of concatenated encoders/decoders namely the Consultative Committee for Space Data Systems (CCSDS) concatenated coding system that uses RS as the outer code, and a convolutional inner code. Finally, we perform a thorough performance evaluation of the presented codes under the AWGN channel model.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.