0% found this document useful (0 votes)
79 views7 pages

CT 4 Construction of Codes

This document discusses methods for constructing codes, including an example of using a cyclic code's generator polynomial to encode a message and the shift register method. It also provides an example of cyclic encoding to generate a codeword from a message and describes cyclic decoding by using a syndrome circuit to detect errors in a received vector.

Uploaded by

Bhushan Kale
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
79 views7 pages

CT 4 Construction of Codes

This document discusses methods for constructing codes, including an example of using a cyclic code's generator polynomial to encode a message and the shift register method. It also provides an example of cyclic encoding to generate a codeword from a message and describes cyclic decoding by using a syndrome circuit to detect errors in a received vector.

Uploaded by

Bhushan Kale
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Construction of Codes …

➢ Example of Analytical Method:


➢ Dividing X3.u(X) =X3+X5 +X6 by g(X)

g(x)

b(x)=1 0 0
Codeword = 1 0 0 1 0 1 1 1
Construction of Codes …
➢ Shift Register Method:
➢ Consider the (7,4) cyclic code Generated by 𝑔 𝑋 = 1 + 𝑋 + 𝑋 3 .
➢ Suppose that the message 𝑢 = 1011 is to be encoded.

Fig 7 Encoder Circuit for an (7,4) cyclic code Generated by


𝑔 𝑋 = 1 + 𝑋 + 𝑋3

2
Construction of Codes …
➢ Example of Cyclic Encoding:

u=1011

𝑆1 = 𝑆0 + 𝑚 + 𝑆2
𝑆0 = 𝑆2 + 𝑚
𝑆2 = 𝑆1

After four shifts, the content of the register are (100).


Thus, the complete codeword is ( 1 0 0 1 0 1 1), and the code polynomial is
1+X3+X5+X6 Message bits
Parity bits
3
Construction of Codes …
➢ Cyclic Decoding:
➢ A syndrome circuit for (7,4) cyclic code generated by

𝑔 𝑋 = 1 + 𝑋 + 𝑋 3.

➢ Suppose that the received vector is 𝑟 = (0 0 1 0 1 1 0)

➢ As the received vector is shifted in to the circuit, the register contents are
given in table – 4.

➢ At the end of seventh shift, the register contains the syndrome


𝑆 = 101

4
Construction of Codes …
Consider r=(0010110) is received

r=(0010110)

Table 4 :Input & Register Content

Fig 8 Syndrome circuit for an (7,4) cyclic code


generated by g(X)=1+X+X3

5
Construction of Codes …
Consider r=(0001011) is received
find the syndrome

r=(0001011)

Table 5 :Input & Register Content

Fig 9 Syndrome circuit for an (7,4) cyclic code


generated by g(X)=1+X+X3

6
Construction of Codes …
Consider r=(1000101) is received
find the syndrome

r=(0001011)

Table 6 :Input & Register Content

Fig 10 Syndrome circuit for an (7,4) cyclic


code generated by g(X)=1+X+X3

You might also like