Forney algorithm
≈ 3 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In coding theory, the Forney algorithm (or Forney's algorithm) calculates the error values at known error locations. It is used as one of the steps in decoding BCH codes and Reed–Solomon codes (a subclass of BCH codes). George David Forney Jr. developed the algorithm in 1965.[1]
Procedure
edit edit source- Need to introduce terminology and the setup...
Code words look like polynomials. By design, the generator polynomial has consecutive roots αc, αc+1, ..., αc+d−2.
Syndromes
Error location polynomial[2]
- Λ(x)=∏i=1ν(1−xXi)=1+∑i=1νλixi
The zeros of Λ(x) are X1−1, ..., Xν−1. The zeros are the reciprocals of the error locations Xj=αij.
Once the error locations are known, the next step is to determine the error values at those locations. The error values are then used to correct the received values at those locations to recover the original codeword.
In the more general case, the error weights ej can be determined by solving the linear system
- s0=e1α(c+0)i1+e2α(c+0)i2+⋯
- s1=e1α(c+1)i1+e2α(c+1)i2+⋯
- ⋯
However, there is a more efficient method known as the Forney algorithm, which is based on Lagrange interpolation. First calculate the error evaluator polynomial[3]
- Ω(x)=S(x)Λ(x)(modx2t)
Where S(x) is the partial syndrome polynomial:[4]
- S(x)=s0x0+s1x1+s2x2+⋯+s2t−1x2t−1.
Then evaluate the error values:[3]
- ej=−Xj1−cΩ(Xj−1)Λ′(Xj−1)
The value c is often called the "first consecutive root" or "fcr". Some codes select c = 1, so the expression simplifies to:
- ej=−Ω(Xj−1)Λ′(Xj−1)
Formal derivative
edit edit sourceΛ'(x) is the formal derivative of the error locator polynomial Λ(x):[3]
- Λ′(x)=∑i=1νi⋅λixi−1
In the above expression, note that i is an integer, and λi would be an element of the finite field. The operator ⋅ represents ordinary multiplication (repeated addition in the finite field) which is the same as the finite field's multiplication operator, i.e.
- iλ=(1+…+1)λ=λ+…+λ.
For instance, in characteristic 2, iλ=0,λ according as i is even or odd.
Derivation
edit edit sourceGill (n.d., pp. 52–54) gives a derivation of the Forney algorithm.
Erasures
edit edit sourceDefine the erasure locator polynomial
- Γ(x)=∏(1−xαji)
Where the erasure locations are given by ji. Apply the procedure described above, substituting Γ for Λ.
If both errors and erasures are present, use the error-and-erasure locator polynomial
- Ψ(x)=Λ(x)Γ(x)
See also
edit edit sourceReferences
edit edit source- ^ Forney 1965
- ^ Gill n.d., p. 24
- ^ a b c Gill n.d., p. 47
- ^ Gill (n.d., p. 48)
- Forney, G. (October 1965), "On Decoding BCH Codes", IEEE Transactions on Information Theory, 11 (4): 549–557, doi:10.1109/TIT.1965.1053825, ISSN 0018-9448
- Gill, John (n.d.), EE387 Notes #7, Handout #28 (PDF), Stanford University, pp. 42–45, archived from the original (PDF) on June 30, 2014, retrieved April 21, 2010
- W. Wesley Peterson's book
Text derived from https://en.wikipedia.org/w/index.php?oldid=1320716449 under CC BY-SA 4.0; modifications have been made.