Hard-decision decoding scheme Codeword length (n) : 31 symbols. Message length (k) : 19 symbols. Error correction capability (t) : 6 symbols One symbol represents 5 bit. Uses GF(2^5) with primitive polynomial p(x) = X^5 X^2 + 1 Generator polynomial, g(x) = a^15 a^21*X + a^6*X^2 + a^15*X^3 + a^25*X^4 + a^17*X^5 + a^18*X^6 + a^30*X^7 + a^20*X^8 + a^23*X^9 + a^27*X^10 + a^24*X^11 + X^12. Note: a = alpha, primitive element in GF(2^5) and a^i is root of g(x) for i = 19, 20, ..., 30. Uses Verilog description with synthesizable RTL modelling. Consists of 5 main blocks: SC (Syndrome Computation), KES (Key Equation Solver), CSEE (Chien Search and Error Evaluator), Controller and FIFO Register.
标签： symbols length Hard-decision Codeword
上传时间： 2014-07-08
上传用户：曹云鹏
实现8比特字节的RS纠错编码，可以指定极性校验字节数目，能产生的最大校验序列长度为255字节（含极性校验字节）.This is an implementation of a Reed-Solomon code with 8 bit bytes, and a configurable number of parity bytes. The maximum sequence length (Codeword) that can be generated is 255 bytes, including parity bytes.
上传时间： 2016-08-24
上传用户：思琦琦
Here are the functions for Hamming code 7.4 and Extended Hamming code 8.4 encoding and decoding. For 7.4 code, one error per 7-bit Codeword can be corrected. For 8.4 code, one error per 8-bit Codeword can be corrected and not less than 2 errors can be detected.
标签： Hamming code and functions
上传时间： 2014-01-04
上传用户：Amygdala
