The following documentation is available for download. However, we would be very happy to know who is using this information, so please send us an email!
Master's thesis at the Laboratory for Signal and Information Processing, ETH Zurich, Switzerland. Written by Stefan M. Moser, March 1999.
Abstract
In this thesis, the basic concepts of factor graphs are introduced and the principles of decoders that rely on the sum-product algorithm are presented. The problem of determining which realization shall be chosen for such decoders is examined. For the [8,4,4] extended Hamming code, several factor graph realizations are given and their decoding performance and behavior is compared. The bit error rate is calculated exactly for a binary symmetric channel and simulated for an additive white Gaussian noise channel. A short comparison of the complexity is listed as well. Moreover, a few results for the more complex [24,12,8] extended Golay code are presented.
All simulations are written in Java. The corresponding programs as well as the detailed results can be found on the enclosed compact disc and will also be available on the World Wide Web.
The master's thesis can be downloaded here.
Submitted to IEEE Transactions on Information Theory. Written by Frank R. Kschischang, Brendan J. Frey, and Hans-Andrea Loeliger.
Available from http://www.comm.utoronto.ca/frank/factor.