Nonsystematic convolutional codes correcting capability research

Objective: To study the basic principles of error-correcting coding and decoding convolutional code (7, 5) by Viterbi algorithm. To determinate the quality parameters of the system in a channel with AWGN.

Laboratory emulator:

After opening the file “VIT_7_5” you will propose to enter initial data from the table 3.7, where p₀ – error probability, L – amount of bits.

Table 3.7 – Data for laboratory experiment

In the result of the experiment, you get next parameters:

- k_d1 – errors coefficient in the output of decoder; k_d1 =m/L.

- m – amount of uncorrected errors at the output of decoder;

- W – coding gain, W=p₀/k_d1.

After filling the table 3.7, you need to build the characteristics k_d1 = f₀(p₀) and k_d2 = f₃( h) using fig. 3.7.

Laboratory task:

1. To run the program “VIT_7_5”.

2. To fill the table 3.7.

3. To build the diagrams k_d1 = f₀(p₀) and k_d2 = f₃( h). Estimated errors probabilities in the DSC can be selected from the table 3.8.

Table 3.8 – Error probabilities for laboratory experiment

Home task:

1. To learn items 1.3.1, 1.3.3 of this teaching manual.

2. To write down the answers to the general questions.

3. To prepare the table 3.7 in the protocol.

4. To prepare blank using Application B.

General questions:

1. Which classes do convolutional codes with Viterbi algorithm belong to?

2. Determine the main parameters of CvC (7, 5).

3. What is the state diagram of the nonsystematic CvC? How does it build?

4. What is the trellis diagram of the nonsystematic CvC? How does it build?

5. What is paths metrics, branches metrics and state metrics according to Viterbi algorithm?

6. What is surviving path according to Viterbi algorithm?

7. Describe the process of decoding using Viterbi algorithm.

Protocol content:

1. Subject and objective.

2. Executed home task.

3. Graph and table according to laboratory task.

4. Conclusion. Compare two characteristics of k_d2 = f₃( h) from the laboratory works 5 and 4.

Laboratory work 6

Date: 2016-01-14; view: 827