Computer Science – Information Theory
Scientific paper
2010-08-25
Computer Science
Information Theory
To appear in IEICE Trans. Fundamentals, vol.E93-A, no.11 November 2010
Scientific paper
For decoding non-binary low-density parity check (LDPC) codes, logarithm-domain sum-product (Log-SP) algorithms were proposed for reducing quantization effects of SP algorithm in conjunction with FFT. Since FFT is not applicable in the logarithm domain, the computations required at check nodes in the Log-SP algorithms are computationally intensive. What is worth, check nodes usually have higher degree than variable nodes. As a result, most of the time for decoding is used for check node computations, which leads to a bottleneck effect. In this paper, we propose a Log-SP algorithm in the Fourier domain. With this algorithm, the role of variable nodes and check nodes are switched. The intensive computations are spread over lower-degree variable nodes, which can be efficiently calculated in parallel. Furthermore, we develop a fast calculation method for the estimated bits and syndromes in the Fourier domain.
Kasai Kenta
Sakaniwa Kohichi
No associations
LandOfFree
Fourier Domain Decoding Algorithm of Non-Binary LDPC codes for Parallel Implementation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fourier Domain Decoding Algorithm of Non-Binary LDPC codes for Parallel Implementation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fourier Domain Decoding Algorithm of Non-Binary LDPC codes for Parallel Implementation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-703140