Codes on Graphs and More
Author
Summary, in English
After an introduction to coding theory, different graphical representations for channel codes are reviewed. Based on ideas from graph theory, new algorithms are introduced to iteratively search for LDPC block codes with large girth and to determine their minimum distance. In particular, new LDPC block codes of different rates and with girth up to 24 are presented. Woven convolutional codes are introduced as a generalization of graph-based codes and an asymptotic bound on their free distance, namely, the Costello lower bound, is proven. Moreover, promising examples of woven convolutional codes are given, including a rate 5/20 code with overall constraint length 67 and free distance 120.
The remaining part of this dissertation focuses on basic properties of convolutional codes. First, a recurrent equation to determine a closed form expression of the exact decoding bit error probability for convolutional codes is presented. The obtained closed form expression is evaluated for various realizations of encoders, including rate 1/2 and 2/3 encoders, of as many as 16 states. Moreover, MacWilliams-type identities are revisited and a recursion for sequences of spectra of truncated as well as tailbitten convolutional codes and their duals is derived. Finally, the dissertation is concluded with exhaustive searches for convolutional codes of various rates with either optimum free distance or optimum distance profile, extending previously published results.
Publishing year
2012
Language
English
Publication/Series
Series of licentiate and doctoral dissertations
Full text
Document type
Dissertation
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Keywords
- convolutional codes
- woven graph codes
- Low-density parity-check (LDPC) codes
- tailbiting codes
- bit error probability
- MacWilliams Identity
Status
Published
Research group
- Information Theory
Supervisor
ISBN/ISSN/Other
- ISSN: 1654-790X
- ISBN: 978-91-7473-284-9
Defence date
16 May 2012
Defence time
10:15
Defence place
Lecture hall E:1406, E-building, Ole Römers väg 3, Lund University Faculty of Engineering
Opponent
- Jr. Costello (Professor Emeritus)