New algorithm for LDPC decoding over GF(q)
- 1 January 2005
- proceedings article
- Published by Institution of Engineering and Technology (IET)
- Vol. 2005, 425-430
- https://doi.org/10.1049/cp:20050348
Abstract
This paper present a novel decoding scheme for low density parity check codes (LDPC) over GF(q). The scheme is a variation of the sum-product algorithm. The novel algorithm has a low complexity and reduces the number of look up table accesses necessary. Moreover, the algorithm does not compute division or multiplication, making it suitable for hardware implementation. The new algorithm has been compared with existing algorithms showing that both the BER performance and the speed of convergence are identical.Keywords
This publication has 0 references indexed in Scilit: