fanna
Guest
|
 Posted:
Wed Nov 30, 2005 7:45 am Post subject:
problem about reed solomon decoding with erasure |
|
|
Hi all,
i use the BM algorithm written in Clark and Cain, but i changed the loo
ending judge to the begining of the loop from the end, to avoid th
iteration when 2t erasure occures.
But then, i met a difficulty to distinguish whether the codeword has som
other errors. the decoder steps are below:
1) syndrome compute;
2) BM
3) modified omega compute;
4) Chien search;
5) Forney correct.
So, if i don't iterate the loop in BM when 2t erausure occures, no othe
place can tell me whether decoder can correct all the errors. Finally
decoder will send out the incorrect decoded codewords, which is not ou
expected.
Anybody met this case yet? Please give me your advise, Thanks a lot. |
|
FAQ
Memberlist
Register
Profile
Log in to check your private messages
Log in