|
|
Burst error correction in digital transmissions using Berlekamp -Preparata codes
Pfudl, Tomáš ; Pfeifer, Václav (referee) ; Němec, Karel (advisor)
Bachelor's thesis discusses properties of the systematic convolution codes for error-bursts correction. Berlekamp-Preparata code is a member of this group. Thesis aims at detail description of this code and for picked code designs a codec. Properties discussed at the first part of thesis are used at the second part for picking the code and designing the codec. For designing there are used various methods (programming scripts, simulation model). Codec design is described from properties of communication channel to hardware realization. Each step is exactly interpreted. Whole theoretical design is made in Matlab and for designing the hardware there is used program Xilinx.
|
|
|
Detection of Farthest Node in Wireless Sensor Networks
Pfudl, Tomáš ; Morávek, Patrik (referee) ; Šimek, Milan (advisor)
Master’s thesis in the first part focuses on the effectiveness of communication in the selection of reference nodes during the anchor-free localization in WSN. In this part two anchor-free localization algorithms AFL and CRP are explored. Knowledge learned on the selection of reference nodes and communication complexities of these algorithms are used in the second part. The second part is aimed at eliminating weaknesses in communication and subsequently proposed a new algorithm for selection of references. The principle of the newly proposed algorithm CASRU (Centralized Algorithm for Selection of Reference Nodes) is based on the principle of CRP. CASRU algorithm builds logical tree structure and then filters the communication through it. New algorithm achieves much greater success in the selection in randomly distributed networks while reducing the amount of communication load.
|
|
|
Burst error correction in digital transmissions using Berlekamp -Preparata codes
Pfudl, Tomáš ; Pfeifer, Václav (referee) ; Němec, Karel (advisor)
Bachelor's thesis discusses properties of the systematic convolution codes for error-bursts correction. Berlekamp-Preparata code is a member of this group. Thesis aims at detail description of this code and for picked code designs a codec. Properties discussed at the first part of thesis are used at the second part for picking the code and designing the codec. For designing there are used various methods (programming scripts, simulation model). Codec design is described from properties of communication channel to hardware realization. Each step is exactly interpreted. Whole theoretical design is made in Matlab and for designing the hardware there is used program Xilinx.
|
|
|
Detection of Farthest Node in Wireless Sensor Networks
Pfudl, Tomáš ; Morávek, Patrik (referee) ; Šimek, Milan (advisor)
Master’s thesis in the first part focuses on the effectiveness of communication in the selection of reference nodes during the anchor-free localization in WSN. In this part two anchor-free localization algorithms AFL and CRP are explored. Knowledge learned on the selection of reference nodes and communication complexities of these algorithms are used in the second part. The second part is aimed at eliminating weaknesses in communication and subsequently proposed a new algorithm for selection of references. The principle of the newly proposed algorithm CASRU (Centralized Algorithm for Selection of Reference Nodes) is based on the principle of CRP. CASRU algorithm builds logical tree structure and then filters the communication through it. New algorithm achieves much greater success in the selection in randomly distributed networks while reducing the amount of communication load.
|
guest ::
