Scribd
Upload
5 views4 pages

2 Lab

2 laboratoriya

Uploaded by

oqilbekjoraboyev
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views4 pages

2 Lab

2 laboratoriya

Uploaded by

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

Laboratory work No.

SIMULATION OF COMMUNICATION CHANNELS BASED ON


MATLAB-COMMUNICATIONS

1. PURPOSE OF WORK

This laboratory work is designed to study:


- Acquaintance with existing communication channels in information
transmission systems and networks;
- Comparison and analysis of noise immunity of existing coding methods.

2. BRIEF THEORETICAL INFORMATION

A code is a system of conventional signs (symbols) or signals designed to


express information of any kind in a convenient form for remote transmission. This
set of characters or signals is called a code alphabet. The number of elements or
characters in a code is always limited. Coded combinations are made from these
elements.
Shannon's fundamental theorem about coding in a noisy channel:
- The productivity of any message source is less than the capacity of the
channel, so there is a coding method that allows the generated message source to
transmit all information with a sufficiently small error probability.
- If the throughput of the message source is greater than the capacity of the
channel, then there is no coding method that allows the transmission of
information with a sufficiently small error probability.
The length of the information piece is determined by the k code base and the
size of the message alphabet. The length r of the probe part is determined by the
required correction capability.
Code length n=k+r.
A noise-tolerant code is a code that detects and corrects erroneously received
discharges.
Such codes are created based on the following principle: let the number of
code combinations with n discharge be N.
But for information transmission, only Nr of them participate and they are
called allowed combinations.
N - Nr are called forbidden code combinations.
If the code combinations have the same number of discharges in the
combination, such codes are called evenly distributed codes.
If the number of discharges in code combinations is different, such codes are
called unequally distributed codes.
Equally distributed codes are divided into two types: block and continuous.
The information sequence transmitted by block codes is divided into
separate code combinations, and they are coded and decoded independently of
each other.
A block consisting of n elements or a block consisting of different elements
corresponds to the transmitted message.
Continuous codes consist of a continuous sequence of information
discharges and cannot be divided into pieces. In such codes, redundant discharges
are placed between informative discharges in a certain order.

3. ASSIGNMENT

In this practical exercise, it is necessary to assemble the circuits presented in


Figures 2.1 and 2.2 with the appropriate options, the circuits presented with noisy
code and without noisy code.

Figure 2.1. A model of an information transmission system without Hamming code

Figure 2.2. A model of the information transmission system built with the
Hamming code

When building the model, it is required to change the error probability


values (Error Probability) from 0.01 to 0.20 with a step of 0.01 in the binary
symmetric channel in the scheme presented in Figures 2.1 and 2.2.
Express the results of modeling with and without Hamming code in the
channel, in one graph, connecting the error coefficient to the values of the
probability of occurrence of errors.

Elements that must be included in the report:


- number and name of laboratory work;
- a task completed with a suitable option;
- view of the model created in the MatLAB program;
- the results of modeling according to the scheme with and without
Hamming or Reed Solomon code;
- Conclusions on the results obtained for different error probabilities in the
communication channel.

1. INSTRUCTIONS FOR PERFORMING THE TASK

To do this, it is necessary to use the following blocks:


- random number generator - "Random Integer Generator" block from the
Comm Sources → Random Data Sources block group in the Communication
Blockset block library;
- number to bit converter - "Integer To Bit Converter" block from the Utility
Blocks block group in the Communication Blockset block library;
- bit to number converter - "Bit To Integer Converter" block from the Utility
Blocks block group in the Communication Blockset block library;
- Hamming encoder - "Hamming Encoder" block from the Error Detection
and Correction → Block group in the Communication Blockset block library;
- Hamming decoder - "Hamming Decoder" block from the Error Detection
and Correction → Block group in the Communication Blockset block library;
- binary symmetric channel - "Binary Symmetric Channel" block from the
Channels group in the Communication Blockset block library;
- error calculator - "Error Rate Calculation" block from the Comm Sinks
group in the Communication Blockset block library;
- display – "Display" block from the Sinks group in the Simulink block
library.

Random number generator [0; 15] should generate integers in the interval,
for this it is necessary to set the "M-ary number" parameter to 16 in the "Random
Integer Generator" block.
To encode [0; 15] numbers in the interval should be expressed by 4 bits, for
this it is necessary to set the "Number of bits per integer" parameter to 4 in the
"Integer To Bit Converter" and "Bit To Integer Converter" blocks.
To find out the number of errors, it is required to set Port to "Output data"
parameter in the "Error Rate Calculation" block.
Codeword length" and "Message length" parameters in the "Hamming
Encoder" and "Hamming Decoder" blocks are set accordingly.

2. CONTROL QUESTIONS

1. Ways to increase reliability?


2. Requirements for methods of increasing reliability?
3. Shannon's fundamental theorem?
4. What is the noise-immunity code and its function?
5. Classification of noise-immunity codes?
6. Parameters of noise-immunity codes?
7. Requirements for noise-immunity codes?
8. How to encode and decode information using noise-immunity cyclic
codes?
9. Error detection in code combination?

You might also like