Scribd
Upload
71 views1 page

1.2.2 Reliable Communication: Transmitter Receiver

The document discusses reliable communication over unreliable communication channels. It presents a basic block diagram of the communication process including channel encoder and decoder blocks. The channel encoder adds redundancy to the information bits before transmission over the channel to enable error correction. The channel decoder uses the redundancy to eliminate errors in the received bits. Error correction codes add more redundancy to allow correction of more errors but reduce the rate of information transmission.

Uploaded by

de veron
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
71 views1 page

1.2.2 Reliable Communication: Transmitter Receiver

The document discusses reliable communication over unreliable communication channels. It presents a basic block diagram of the communication process including channel encoder and decoder blocks. The channel encoder adds redundancy to the information bits before transmission over the channel to enable error correction. The channel decoder uses the redundancy to eliminate errors in the received bits. Error correction codes add more redundancy to allow correction of more errors but reduce the rate of information transmission.

Uploaded by

de veron
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/ 1

Transmitter Receiver

Information Channel Channel Information


Modulator Channel Demodulator
Source Encoder Decoder Destination

Noise Source

Figure 1.3: Basic block diagram of the communication process including channel encoder and
decoder blocks

have some bits flipped relative to the input strings. We will focus our attention on the strategies
which are used to enable reliable communication between the nodes of a communication network
given that the channels connecting the nodes are unreliable.

1.2.2 Reliable Communication

Most users of computer communication networks cannot tolerate errors irrespective of whether
the information being transferred is a text message or a bank account number. Given that the
links connecting the nodes in the communication network introduce errors, we need strategies
which will eliminate such errors and make the communication reliable or error-free.

Error Correction and Detection

One way to eliminate errors in the received bit strings is to use forward error correction (FEC)
schemes. An FEC scheme modifies the bit string at the source node before it enters the modula-
tor by adding redundancy to it. This redundancy is used at the receiver to eliminate errors in the
bit string obtained as the output of the demodulator at the destination node. An FEC scheme is
also called an error correcting code (ECC) or channel code, where the latter name is due to the
fact that the scheme is responsible for correcting errors introduced by the channel distortion.
The subsystem of the communication system which adds the redundancy to the input bit string
is called the FEC encoder or channel encoder. The subsystem of the communication system
which eliminates errors in the bit string at the output of the demodulator is called the FEC
decoder or channel decoder. Figure 1.3 shows the location of the channel encoder and decoder
in the block diagram of the communication process. In this case, the transmitter consists of
the channel encoder and the modulator while the receiver consists of the demodulator and the
channel decoder.

The number of errors which can be corrected by an ECC is directly proportional to the amount
of redundancy which is added to the input bit string. The more the redundancy added, the
more the number of errors which can be corrected. But this error correction capability comes at
the cost of requiring the tranmission of a bit string which is much longer than the original bit
string representing the information to be communicated. The amount of redundancy introduced
by an ECC is measured in terms of its rate which is defined as the ratio of the lengths of the
information bit string and the bit string obtained after the addition of redundancy to information
bit string. For example, if the information bit string is k bits long and the bit string obtained
k
after addition of redundancy is k + n bits long, the rate of this ECC will be k+n . The rate
of an ECC is an example of a more general concept called throughput which is the defined as
the average number of information bits that are communicated through the channel in a unit of

You might also like