|
||
|
Erasure Code based on Reed Solomon Codes
|
|
Overview The erasure Code is based on Reed Solomon Codes. Every code word and primitive polynomial used is also of degree 'm'. 'n' gets set from 'm' which is ((1<<'m')-1) .There could be shortened 'n' which will be less than 'n' . The codewords 'n' – 'n_short' are assumed to be 0 . If the code has 't'error correcting capability then 'k' = 'n' – 2*'t'. The erasure code is completely configurable to any 'm' , 'n_short' or 't'. The maximum number of erasures that can be corrected are 2*'t' whereas the maximum number of errors that can be corrected are 't' when number of erasures are 0. For every error bit correction, it consumes 2 parity code words and every erasure code word consumes 1 parity code word. The number of parity blocks is 2*'t'. Every erasure has one piece of additional information which is its location in codeword space so it can correct more number of erasures than maximum number of errors where the locations of errors is not known. Errors_correctable = floor((2*tt-no_eras)/2) The Erasure correcting Code consists of:
Encoder: It has programmable input data bus width. The whole encoding can be completed in 1 cycle Decoder:
Please sign in to view full IP description :
|
业务合作 |
广告发布访问我们的广告选项 |
添加产品供应商免费录入产品信息 | ||||||||