Optimization of binary LDPC codes for the q-ary symmetric channel with moderate q
Date
2008
Authors
Lechner, G.
Weidmann, C.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings 5th International Symposium on Turbo Codes and Related Topics, 2008, pp.221-224
Statement of Responsibility
Conference Name
5th International Symposium on Turbo Codes and Related Topics (1 Sep 2008 - 5 Sep 2008 : Lausanne, Switzerland)
Abstract
We study the optimization of binary LDPC codes for the q-ary symmetric channel with moderate alphabet sizes q. For q = 2<sup>m</sup>, a coding scheme can be viewed as a front-end mapping q-ary symbols to groups of m bits connected to a binary code. We derive a factor graph representation of the front-end and show that it can be processed with a complexity linear in m, the number of bits per symbol. We perform an extrinsic information transfer chart analysis and use it for code optimization. © 2008 IEEE.