Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
| Paper: | SPCOM-P4.9 |
| Session: | Iterative Decoding Algorithms and Architectures |
| Time: | Wednesday, May 19, 09:30 - 11:30 |
| Presentation: |
Poster |
| Topic: |
Signal Processing for Communications: Compression, Coding, and Modulation |
| Title: |
COMPUTATIONAL COMPLEXITY AND QUANTIZATION EFFECTS OF DECODING ALGORITHMS FOR NON-BINARY LDPC CODES |
| Authors: |
Henk Wymeersch; University of Ghent | | |
| | Heidi Steendam; University of Ghent | | |
| | Marc Moeneclaey; University of Ghent | | |
| Abstract: |
This contribution deals with the comparison of the sum-product algorithm(SPA) and its log-domain version (log-SPA) for decoding LDPC codes overgeneral binary extension fields. For both algorithms, we determine their computational complexitybased on the number of real-valued operations and investigate theirsensitivity to quantization effects. Whereas the log-SPA yields theshorter decoding time in the case of binary LDPC codes, we point outthat increasing the field size tends to favor the SPA, especiallywhen a multiplication takes only slightly more time than an addition.Further, we show that log-SPA requires fewer quantization levels andsuffers less from a quantization induced error-floor. |
| |
| Back | |