Professional Documents
Culture Documents
11.1 Systematic Cyclic Code: Communications Systems II, Fourth Stage-Lec.11 2020-2021
11.1 Systematic Cyclic Code: Communications Systems II, Fourth Stage-Lec.11 2020-2021
11 2020-2021
(11.1)
(11.2)
(11.3)
(11.4)
Example 11.1
Solution
(NOTE that the polynomial here is the reverse of the method used before e.g.
start from left and give it the higher order and so forth)
We could also have found the codeword directly by using Eq.(11.4). Thus, c(x)=
the manner (table below). This is quite tedious procedure. There is, however, a shortcut
so on.
The table shows complete code. Note that 𝑑𝑚𝑖𝑛 the minimum distance between
Example 11.2
Solution
Using Long-division
𝑋 𝑛−𝑘 𝑑(𝑥) 𝑋3 (1 + X + 𝑋2 ) (𝑋5 + 𝑋4 +𝑋3 ) 𝑋
= = = X + 𝑋2 +
𝑔(𝑥) 1 + X + 𝑋3 1 + X + 𝑋3 1 + X + 𝑋3
In order to find codeword
C(X) = 𝑋 3 (1 + X + 𝑋 2 )+ X
= 𝑋5 + 𝑋4 + 𝑋3 + 𝑋
and C = 0101110
11.2 Encoder
generated code is described in Eqs.(12.1-12.4).It involves division 𝑋 𝑛−𝑘 𝑑(𝑥) by g(x) that can
gain gk are either 0 or 1. An encoding circuit with n-k shift registers is shown in Figure .below.
An
11.3 Decoder
error. For example, for the code in Ex.12.2, if r = 0110010, this code mean c=1110010
error. For any r, we compute the syndrome from Eq.11.6, and from the table we find
the corresponding correctable error e. Then we determine c = e ⨁ r as been explained
in the linear block coding.
Example 11.3
Construct the decoding table for the single-error correcting (7,4) code in table (used in
Example 11.2). Determine the data vectors transmitted for the following received
vectors r; (a) 1101101; (b) 0101000;(c) 0001100.