Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
• The message to be sent is encoded into a code word using a encoding rule.
• When the coded word passes through the channel, errors may occur due to weather
interference, electrical problems and so on and it becomes distorted.
• The decoder corrects the error in the distorted message and decode the corrected
version using decoding rule into the original message.
Definitions:
Message: The basic unit of information, called a message, is a
finite sequence of characters from a finite alphabet.
Word: A sequence of symbols from an alphabet is often referred
to as word.
Code: A code is a collection of words that are to be used to
represent distinct messages.
Code word: A word in a code is called a codeword.
Block Code: A block code is a code consisting of words that are of
the same length.
In a binary alphabet {0, 1}, there are 2n binary words of length n.
For n≥1, let
• Here we decode b, by examining the first, fourth and seventh positions to see which
signal appears more times. Hence 1 occurs all three times so the first entry in the
decoded message is 1. Next we examine second, fifth and eighth positions and here 0
occurs all three times so the second entry in the decoded message is 0.
• Continuing with entries in the third, sixth and ninth position, 1 occurs twice and 0
occurs once, hence the result for third entry in the decoded message is 1. So, the
transmitted message was 101.
Generally, designs for communication systems are analyzed
mathematically using simplified models for the channel. Let
binary, represented by 0's and 1's be transmitted sequentially
through a channel to a receiver as shown in Fig. 19.1.
This simple model for the channel is called the binary symmetric
channel.
To maximize the transmission rate we want enough code words
to encode a given message alphabet but at the same time the words
should be no longer than necessary to achieve sufficient error
detection and/or correction.
The good error control coding scheme should have the following
features:
(i) Capability to correct more number of errors.
(ii) Fast and efficient scheme for encoding the message
(iii) Fast and efficient scheme for decoding the received message
(iv) Maximum transfer of information bits per unit time.
Hamming Weight and Distance
• Let A denote the set of all binary sequence of length n. If x be a
word in A, then Hamming weight w(x) is defined by- the
number of 1's in x and denoted by w(x).
• It is easy to show that (Bm, +),and (Bn, +)are commutative groups under
component wise addition (mod 2) of words.
• Note that every element in Bm and Bn has its own inverse and zero word is
the identity element.
• Let E : Bm →Bn be an encoding function .
• The code C = E(Bm) is called a group code if C is a subgroup of Bn.
• From the definition of the subgroup , C the subset of Bn consisting of all code
words is a subgroup of Bn if
1) The identity element in Bn is in C.
2) If x, y ∈ C, then x + y ∈ C.
3) If x in C, then its inverse is also in C.
In this case (iii) is obvious since every element in Bn is its own inverse.
Decoding Methods
• We, Create codewords by addition of other codewords, which means that there is no
need to hold every code word.
• The easiest way to find m linearly independent codewords is to choose those which
have 1 in just one of the m positions and 0 in other m-1of the first m positions.
• For (7, 4) encoding function, we need just the four codewords.
1000011
0100101
0010110
0001111
• If we wish to obtain the codeword for 0111, we add together the second, third and
fourth codewords to the list to give 0111100.
• The process of encoding by addition can be represented in matrix form by
v = uG
where u is the message , v the codeword and G the generator matrix.
• So we can represent the code by the generator matrix as given below:
v = [0111]G = [0111100]
• The coding of the message can thus be considered as a multiplication of 1x m vector (the
message) and a m x n generator matrix G which can be written in normal form as
G = [Im | A]