Publications – Details
Low-Complexity Belief Propagation by Approximation with Lookup-Tables
- Authors:
- Thorsten Clevorn and Peter Vary
- Book Title:
- Proceedings of International ITG Conference on Source and Channel Coding (SCC)
- Venue:
- Erlangen, Germany
- Date:
- Jan. 2004
- Language:
- English
Abstract
Belief propagation decoding of low-density parity-check codes or one-step majority logic decodable codes has been proven to be a very powerful coding scheme. In this paper an approximation for the belief propagation algorithm, also known as sumproduct decoding, is presented which uses correction functions, implemented as precomputed lookup-tables, to significantly reduce the computational complexity. The new lookup-sum algorithm requires no multiplications, divisions, exponential or logarithmic operations in the iterative process. Already for lookup-tables containing a single entry simulation results show that the performance of non-approximated belief propagation can be approached by 0.1 dB in Eb/N0. With slightly larger tables a performance not noticeably differing from nonapproximated belief propagation can be achieved.
Download of Publication
Copyright Notice
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
The following notice applies to all IEEE publications:
© IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.