fanna
Guest
|
 Posted:
Tue Nov 29, 2005 5:17 pm Post subject:
problem about erasure RS decoding limit |
|
|
Hi,
i am now building an RS(204,188) decoder with erasure. The modifie
Berlekamp-Massey (Clark and Cain) works well in normal cases.
But i met a case which i can not handle. When the input data has alread
2t erasures, so psi(or lambda) polynomial has been initialized to 2
order, and the BM iteration will not be excuted, because it can no
correct any more errors. Then it can compute omega poly, Chien search an
Forney correct.
If there are some other errors in this case, how can i tell the decode
it's exceed the correction limit? what is the difference about th
syndrome,omega,psi(lambda) poly?
Or i can only use the BM algorithm in Stephen.B Wicker only ? |
|
FAQ
Memberlist
Register
Profile
Log in to check your private messages
Log in