Turbo-principle-based decoding in LDPC and turbo codes
Several modern error-correcting codes can perform close to the Shannon limit thanks to the turbo principle applied in their iterative decoding algorithms. In this paper the principle is discussed in relation to LDPC codes and turbo codes. Methods for improvement of both these codes are described...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
UT Press Publishing House
2017-02-01
|
Series: | Carpathian Journal of Electronic and Computer Engineering |
Subjects: | |
Online Access: | http://cjece.ubm.ro/vol/10-2017/1707.06-10104.pdf |
Summary: | Several modern error-correcting codes can
perform close to the Shannon limit thanks to the turbo principle
applied in their iterative decoding algorithms. In this paper the
principle is discussed in relation to LDPC codes and turbo codes.
Methods for improvement of both these codes are described,
namely removal of short cycles for LDPC codes and trellis
termination for turbo codes. Performance of reference LDPC
and turbo codes with and without these improvements is
simulated and compared. |
---|---|
ISSN: | 1844-9689 2343-8908 |