Abstract
This paper investigates iterative decoding of product codes over the binary erasure channel. A simplified row-column iterative decoding algorithm combining bit guessing with bounded-distance erasure decoding is introduced. This algorithm shares many similarities with the original Chase-Pyndiah turbo decoding algorithm and offers a wide range of trade-offs between performance and complexity. The performance of the proposed iterative decoding algorithm has been evaluated by Monte-Carlo simulation for several selected high-rate product codes. Both binary Bose-Chaudhuri-Hocquenghem and non-binary Reed-Solomon component codes have been considered. The results show that product codes provide near-capacity performance without exhibiting error floors in the simulated word-erasure-rate region.
Sign-in/Register to access full text options 
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.
