UPGRADE YOUR BROWSER

We have detected your current browser version is not the latest one. Xilinx.com uses the latest web technologies to bring you the best online experience possible. Please upgrade to a Xilinx.com supported browser:Chrome, Firefox, Internet Explorer 11, Safari. Thank you!

AR# 31619

Reed-Solomon Decoder v6.1 - Why is the width of ERR_CNT the number of binary bits required to represent (n-k)?

Description

The maximum number of symbol errors in a block that can be guaranteed to be corrected by the Reed-Solomon algorithm is t = (n-k)/2. Why is the width of ERR_CNT the number of binary bits required to represent (n-k)?

Solution

The ERR_CNT bus gives the number of errors, erasures, and punctures that were corrected in the most recent output block. Because the decoder corrects the code block if 2e + E <= n-k, the bus width is equal to the number of binary bits required to represent (n-k). "e" is the number of errors and "E" is the number of erasures.

AR# 31619
Date Created 09/10/2008
Last Updated 12/15/2012
Status Active
Type General Article