I am trying to understand and design an RS Decoder. Can anyone help me understand how the syndrome is computed and how does the syndrome computation help in reducing the search to find the errors in the input code word?
Syndrome computation for Reed Solomon code words
Started by ●July 22, 2006
Reply by ●July 24, 20062006-07-24
Hi, One way of computing the syndrome of a (n,k) RS codeword is to evaluate the received polynomial (vector) at the (n-k) roots of the generator polynomial. If the results are all zero, no detectable errors occurred and we assumed that the received polynomial is a codeword (code polynomial), otherwise errors occurred. Basically, from the syndrome, a system of equations can be set up and solved. However, more efficient algorithms exist like the Euclidean decoder and the Massey-Berlekamp decoder. Hope this helps, Jaco gvprathap wrote:> I am trying to understand and design an RS Decoder. > Can anyone help me understand how the syndrome is computed and how does > the syndrome computation help in reducing the search to find the errors in > the input code word?