Abstract
This chapter discusses efficient implementation techniques for widely used error correction algorithms. Bose-Chaudhuri-Hocquenghem (BCH) code simulation and implementation techniques are discussed. The BCH codes are popularly used in correcting the bit errors in the header information included in data frame communications. The BCH code framework supports a large class of powerful, random-error-correcting cyclic binary and nonbinary linear block codes. A subset of BCH codes called Reed-Solomon (RS) codes is also explained. RS codes are widely used in digital communications and digital storage and retrieval systems for forward error correction (FEC). The error correction with the RS decoder is achieved with the following four steps: syndrome computation, error locator polynomial computation, error locator polynomial roots computation, and error magnitude polynomial computation.
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.
