1 / 9

Chapter 2

Chapter 2. Concatenated codes. Introduction. Single level Concatenation usualy done by using done by using non-binary outer code and binary simple inner code. This reduce complexity and increase reliability of the code.

mahlah
Download Presentation

Chapter 2

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 2 Concatenated codes  Ammar Abh-Hhdrohss Islamic University -Gaza

  2. Introduction • Single level Concatenation usualy done by using done by using non-binary outer code and binary simple inner code. • This reduce complexity and increase reliability of the code. • Multilevel concatenation can achieve very powerful codes with very simple inner and outer codes. • The decoding is done in multiple stages which reduce the overall complexity.

  3. Single level Concatenation Codes

  4. Single level Concatenation Codes • Reed-Solomon is used usually as the outer code. • First, the k1k2 binary information digits are divided into k2 bytes of k1 information digits each. These k2 bytes are encoded using C2. • The n2 codewords of C2 are encoded using C1. • The information is transmitted one codeword of C1 at time. • The resultant code (n1n2, k1k2) with minimum distance d1d2; • where d1,d2 are the minimum distances for C1, C2, respectively.

  5. k2 n2 - k2 k1 n1 - k1

  6. Interleaving with concatenation codes

  7. Another example

More Related