|
|
Turbo-convolution and turbo-block codes
Šedý, Jakub ; Krajsa, Ondřej (referee) ; Šilhavý, Pavel (advisor)
The aim is to explain the Turbo convolutional and block turbo codes and decoding the secure message. The practical part focuses on the design of a demonstration program in Matlab. The work is divided into four parts. The first two deal with theoretical analysis of coding and decoding. The third section contains a description created a demonstration program that allows you to navigate the process of encoding and decoding. The fourth is devoted to simulation and performance of turbo codes.
|
|
|
Measurements of the DVB-T Digital Television Receiver
Kobza, Jaromír ; Džubera, Jakub (referee) ; Kratochvíl, Tomáš (advisor)
This thesis is focused on a receiver for digital television broadcasting set-top box, mainly on its features, parameters and measurement. The important point of this work is the possibility to analyze and visualize the parallel transport stream in the same time and the solution of this problem. The principle of tuner and its measuring is deeply discussed. The text is supported with oscilloscope screenshots in particular parts of decoding stream. The set-top box is modified for laboratory measurement purpose and the transport stream output is added. An example laboratory exercise was created as a part of this work.
|
|
|
Processing of MP3 files for DSP
Římský, Adam ; Sysel, Petr (referee) ; Herman, Ivo (advisor)
This thesys is concerned with create of compressed .MP3 files and their conversion back into PCM format. I describe individual parts of these operations for their maximal understanding by reader. Next part is generally about properties of DSP, their architecture, computation possibilities and about properties of used product by Analog Devices. In last part is showed implantation of decoder in DSP architecture.
|
|
|
Tree Code Decoding Methods
Zamazal, Zdeněk ; Lambertová, Petra (referee) ; Němec, Karel (advisor)
This thesis deals with applying knowledge of data channel coding and concerns about possibilities of tree codes decoding. It describes several decoding methods and inquires their ins and outs. Basic knowledge of theory of information is necessary, it is presumed that reader is familiar with convolutional codes and coder definitions. Criterions for choosing decoding method are introduced and lightely described. A decoder is designed using method choosed by denoted criterions. Implementation of the decoder, using Matlab Simulink enviroment, has taken part in the thesis. Function of the decoder is verified in simulation.
|
|
|
Turbo codes and their applications
Ploštica, Stanislav ; Krajsa, Ondřej (referee) ; Šilhavý, Pavel (advisor)
This Diploma thesis aims to explain the data coding using turbo codes. These codes belong to the group of error correction codes. We can reach the high efficiency using these codes. The first part describes process of encoding and decoding. There are describes parts of encoder and decoder. Principle of encoding and decoding demonstrate a simple example. The end of this part contains description of two most frequently used decoding algorithms (SOVA and MAP). The second part contains description of computer program that was made for using as teaching aid. This program was created in Matlab GUI. This program enables to browse error correction process step by step. This program contains graphic interface with many options and display results. In the third part is described program created in Matlab Simulink that was implemented into the TMS320C6713 kit and there is description of measuring procedure. For verification of efficiency of turbo codes was measured any parameters. Some of these parameters are: number of decoding iterations, generating polynoms and using of puncturing. The last part contains measured value and result evaluation.
|
|
|
Error protection of data transmission using BCH Codes
Kašpar, Jaroslav ; Křivánek, Vítězslav (referee) ; Němec, Karel (advisor)
The thesis Data transmission error-protection with BCH codes deals with a large class of random-error correcting cyclic codes which are able to protect binary data and can be used for example in data storages, high speed modems. Bose, Chaudhuri and Hocquenghem (BCH) codes operate over algebraic structures called Galois fields. The BCH encoding is the same as cyclic encoding and can be done with linear feedback shift register but decoding is more complex and can be done with different algorithms - in this thesis there are two algorithms for decoding Peterson and Berlekam-Massey mentioned. The aim of this thesis is to find BCH code which is able to correct t = 6 independent errors in up to data sequence n = 150 bits, then peruse possible realizations of the codecs and set criteria for the best realization, then design and test this realization. This thesis is split into three main parts. In the first part there are encoding and decoding methods of the BCH code generally described. The second part deals with selecting of the right code and realization. There was chosen BCH (63,30) code and realization with FPGA chip. In the last part is described design of BCH encoder and decoder and compilation in the Altera design software.
|
|
|
Realization of OFDM coder for DVB-T system
Zelinka, Petr ; Maršálek, Roman (referee) ; Frýza, Tomáš (advisor)
The contents of this thesis is a delineation of the European Standard ETSI EN 300 744 for terrestrial digital video broadcasting (DVB-T) and a description of created OFDM coder and decoder for baseband signal transmission in 2K mode without error correction capabilities. The proper function of both devices is verified by means of Matlab simulations and practically implemented into Texas Instruments’ digital signal processor TMS320C6711 using Starter Kits.
|
|
| |
|
|
Protection of data transmission against long error bursts
Malach, Roman ; Lambertová, Petra (referee) ; Němec, Karel (advisor)
This Master´s thesis discuses the protection of data transmission against long error bursts. The data is transmited throught the channel with defined error rate. Parameters of the channel are error-free interval 2000 bits and length of burst error 250 bits. One of the aims of this work is to make a set of possible methods for the realization of a system for data correction. The basic selection is made from most known codes. These codes are divided into several categories and then the best one is chosen for higher selection. Of course interleaving is used too. Only one code from each category can pass on to the higher level of the best code selection. At the end the codes are compared and the best three are simulated using the Matlab program to check correct function. From these three options, one is chosen as optimal regarding practical realization. Two options exist, hardware or software realization. The second one would seem more useful. The real codec is created in validator language C. Nowadays, considering language C and from a computer architecture point of view the 8 bits size of element unit is convenient. That´s why the code RS(255, 191), which works with 8 bits symbols, is optimal. In the next step the codec of this code is created containing the coder and decoder of the code above. The simulation of error channel is ensured by last program. Finally the results are presented using several examples.
|
|
|
Analýza modelu řízení železnice
Krénar, David
The text describes the management system model railroad. The work contains information on the technical management solutions, elements which are components of both the management and the model railroad. The work also contains information about the communication between these elements. The aim is to evaluate the current state management model railroad and propose any new technical or communication elements that could improve the model and create a simulation model railroad management in program Control Web 6.1.
|
guest ::
