On the Construction and Analysis of Iteratively Decodable Codes

Forskningsoutput: AvhandlingDoktorsavhandling (monografi)


Iterative decoding methods allow efficient decoding of long codes that are composed of smaller component codes. As a result reliable communication can be achieved with low decoding complexity even for rates close to Shannon capacity. This makes iteratively decodable codes a very attractive object of study in modern coding theory.

This thesis focuses on different kinds of cycles which appear in the matrices specifying the interconnection between the component codes. It is shown that the possibility to manipulate the cycle structure of these matrices is a key to the construction of good codes. A method to construct low-density parity-check matrices and permutation matrices without undesired cycles is developed. It is inspired by Gallager's construction of low-density parity-check matrices without short cycles. The construction method is applied to obtain low-density parity-check codes and turbo codes for which a given number of correct decoding iterations can be performed. Such codes are used for deriving bounds on the asymptotic performance of iterative decoding.

Moreover, the construction of matrices without undesired cycles is used to obtain iteratively decodable codes with good distance properties. Turbo codes with minimum distance logarithmically increasing with the block length are constructed. This growth rate is asymptotically optimal for this code family. Additionally, a strategy for the design of turbo codes with practical block lengths is proposed. Furthermore, serially concatenated convolutional codes with good tradeoff between length and minimum distance are constructed where the minimum distance can be flexibly attuned to the length.

In addition to the component code interconnection the performance of the component codes themselves is also investigated. Time-invariant convolutional codes are studied for transmission over the binary symmetric channel. New upper bounds on the burst and bit error probabilities for maximum-likelihood decoding are proposed. For memory two encoders, closed form expressions for the exact bit error probability are derived.

Finally, a new class of iteratively decodable codes operating on continuous data streams, braided block codes, is introduced. For the proposed codes, bounds on the free distance are derived and decoding performance is analyzed.


  • Dmitri Truhachev
Enheter & grupper

Ämnesklassifikation (UKÄ) – OBLIGATORISK

  • Elektroteknik och elektronik


Tilldelande institution
Handledare/Biträdande handledare
  • [unknown], [unknown], handledare, Extern person
Tilldelningsdatum2004 jun 10
  • Department of Information Technology, Lund Univeristy
Tryckta ISBN91-7167-030-0
StatusPublished - 2004