Abstract
An improved hard iterative decoding (IHID) algorithm is presented to efficiently terminate hard iterations in the decoding of multi-level codes. The proposed terminating policy stops iterations as soon as a valid path on the super trellis is found thereby only running the minimum required number of iterations. The IHID decoding algorithm performs better than the conventional multi-stage decoding by reducing the effects of error multiplicity. Compared with known hard iterative decoding with fixed number of iterations, the IHID algorithm can significantly reduce decoding complexity and decoding delay.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
