Home Random Page


CATEGORIES:

BiologyChemistryConstructionCultureEcologyEconomyElectronicsFinanceGeographyHistoryInformaticsLawMathematicsMechanicsMedicineOtherPedagogyPhilosophyPhysicsPolicyPsychologySociologySportTourism






Turbo-codes with iterative soft-decision Viterbi decoding algorithm corrective capability research

 

Objective: To study the rules of construction turbo codes coders and decoders based on the component recursive systematic convolutional codes (RSC). To research the characteristics of turbo codescorrective capability.

 

Laboratory emulator:

After running the program Turbo.exe you can see interface like fig. 3.9.

 

 

Figure 3.9 Interface of laboratory work

 

Text cells G1(D)/G0(D), Eb/No, are filled according to the number of brigade from the table 3.11. It is need to transform polynomials G1(D)/G0(D) from octal to binary form and enter in order from right to left. Relative information transfer rate is chosen from the list. Another data it is need to left without changes.

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

- Eb/No signal noise ratio;

- amount of bits, transferred through the channel

- . . amount of errors at the output of the DSC;

- . . amount of errors at the output of the decoder;

- [.] errors coefficient at the output of the DSC;

- [i] errors coefficient at the output of the decoder after i iterations;

- B[i] amount of blocks with errors after i iterations.

 

Laboratory task:

1. To run the program Turbo.exe.

2. To enter the initial data from the table 3.11.

 

Table 3.11 Initial data for laboratory work

Number of brigade RSC R2 Eb/No
1, 5/7 1/3 -4-2 D=0,25
1, 17/15 1/3 -4-2 D=0,25
1, 35/23 1/3 -4-2 D=0,25
1, 5/7 1/2 -20 D=0,25
1, 17/15 1/2 -20 D=0,25
1, 35/23 1/2 -20 D=0,25
1, 5/7 2/3 02 D=0,25
1, 17/15 2/3 02 D=0,25

 

3. To fill the table 3.12.

 

Table 3.12 Results of the laboratory experiment

Eb/No [] [.] [1] [2] [3] [5]
           
           
           
           
           
           
           
           
           

 

4. Using table 3.12, to build the diagrams [.] = f (Eb/No) and
[i] = f (Eb/No), using Application C.



 

Home task:

1. To learn items 1.3.3, 1.4.3 1.4.4 of this teaching manual.

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

3. To prepare the table 3.12 in the protocol.

4. To prepare blank using Application C.

 

General questions:

1. Which classes do turbo codes belong to?

2. What are recursive systematic convolutional codes?

3. Describe the principle of the parallel concatenated coding.

4. Why dont unrecursive codes in turbo codes use?

5. Describe the decoding algorithms of turbo codes.

6. Describe the soft output Viterbi algorithm.

7. Describe the principle of iterative decoding.

 

Protocol content:

1. Subject and objective.

2. Executed home task.

3. Graph and table according to laboratory task.

4. Conclusion. Compare two characteristics [1] = f (Eb/No) and
[5] = f (Eb/No).

 


Date: 2016-01-14; view: 242


<== previous page | next page ==>
Digital communication system with a concatenated coding research | Exercise 4. Fill the gaps with suitable words.
doclecture.net - lectures - 2014-2017 year. Copyright infringement or personal data (0.007 sec.)