FPGA Central

hi all

notation
F = erasure polynomial
S = syndrome
E = modified syndrome
A = error location polynomial
n = error/erasure magnitude polynomial
Y = error/erasure location polynomial
BM= Berlekamp-Massey Algorithm
CF= Chien & Forney
EC = error/erasure corrector
t = num of error can be corrected

i had written and verified RS error-correction codec in Matlab and want t
convert to RS error&erasure correction codec.
However i had troubles to get it correct.

Here is my source
"Error control system" by Stephen B. Wicker


Here is my approach
new key equation
A*F*S = n mod x^2t (9-43)

two method
1. i called it multiplying
E = F*S;
E=>BM=>A (put E as S into BM and get output A)
Y=A*F
n = A*E = A*F*S
n,Y => CF => EC

2. i called it loading <= read it from some papers
E = F*S;
E, F =>BM=>Y (put E as S into BM and initial A=F)
n = Y*S
n,Y => CF => EC

I had verified my approaches to the following examples
example 9.10
example 9.11
BUT!!!!!
when I increase my easures beyond t, everything goes wild
the Y from approaches 1,2 are different + the both EC are totally wron
!!!!

any pointer ???

Thank you