Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
+ u1 x
n k +1
+ ....... + uk 1 x
n 1
Cond
We have x nk u( x) = a( x) g ( x) + b( x) where a( x) and b( x) are quotient and remainder respectively Since the degree of g(x) is n-k, the degree of b(x) is n-k-1 or less. ie. b( x) = b0 + b1 x + ...... + bnk 1 x nk 1 Rearranging eqn.(1), we get the following polynomial of degree n-1 or less b( x) + x nk u( x) = a( x) g ( x)
This polynomial is a multiple of the generator polynomial g(x) and hence it is a code polynomial of the cyclic code generated by g(x).
Cond
Substituting the expressions, b( x) + x n k u ( x) = b0 + b1 x + ........ + bn k 1 x n k 1 +u0 x n k + u1 x n k +1 + ........ + uk 1 x n 1 This corresponds to the code vector, (b0 , b1 ,......, bn k 1 , u0 , u1 , .......uk 1 )
Thus we generated a systematic code
The n k parity check digits are the coefficients of the remainder resulting from dividing the message polynomial x n-ku(x) by the generator polynomial g(x) To summarize, systematic encoding consists of the following steps
Step 1: Premultiply the message u ( x) by x n k Step 2 : Obtain the remainder b( x)[the parity check digits ] from dividing x n k u ( x) by the generator polynomial g( x) Step 3 : Combine b( x) and x n k u ( x) to obtain the code polynomial b( x) + x n k u ( x)
Generator polynomial
Parity-check polynomial
Syndrome polynomial
Some properties
Since g(x).h(x)=0 mod xn+1, g(x) and h(x) are orthogonal The polynomials xi g(x) and xj h(x) are also orthogonal for all i and j However, the vectors corresponding to g(x) and h(x) are orthogonal only if the ordered elements of one of these vectors are reversed. This applies to xi g(x) and xj h(x) as well. The (n, n-k) code generated by h(x) is just the same as the code generated by the reciprocal polynomial of h(x), except that the code words are reversed.