|
|
Data transmition security with Reed-Müller codes
Hrouza, Ondřej ; Burda, Karel (referee) ; Němec, Karel (advisor)
The aim of this work is to propose a Reed-Muller code that secure data transfer to t = 4 independent errors, the information rate R ? 0,5 and for this code to produce a detailed proposal for implementation of the codec. In order to implement this proposal, it is necessary to familiarize themselves with the basic properties Reed-Muller codes. To understand the function of codec Reed-Muller code is in this thesis analyzed the process of encoding and decoding, which is based on a method of using the majority logic. For the design of codec, which consists of encoder and decoder, are used programmable logic circuits FPGA. These circuits are programmed in VHDL language, when for the design source codes is used Xilinx ISE 10.1. In thesis is examined in detail the structure and function of the encoder and decoder chosen Reed-Muller code and there are presented parts of the proposed source codes. Verify the functional ability of the codec is achieved by simulation in program ModelSim SE 5.7f. The simulation results together with the another proposal realization are output of this work.
|
|
|
Simulation of mobile ad hoc network in NS-3 environment
Kolaja, Lukáš ; Hrouza, Ondřej (referee) ; Hošek, Jiří (advisor)
The goal of this bacherlor thesis is theoretically analyze the principles of wireless mobile ad hoc networks. The thesis describes the types of routing protocols such as AODV, DSDV or OLSR. Further describes the types of mobility models which is typically used in MANET. The thesis also deals with issues like use, safety and development of mobile ad hoc networks. The goal of the practical part is create an application which can parse an XML document that generates simulation that is already created. The application is written in PHP language and output data from this application is inserted to the databse by using SQL commands. From the database is easy to read the data from the original XML document.
|
|
|
LDPC codes
Hrouza, Ondřej ; Šedý, Jakub (referee) ; Šilhavý, Pavel (advisor)
The aim of this thesis are problematics about LDPC codes. There are described metods to create parity check matrix, where are important structured metods using finite geometry: Euclidean geometry and projectice geometry. Next area in this thesis is decoding LDPC codes. There are presented four metods: Hard-Decision algorithm, Bit-Flipping algorithm, The Sum-Product algorithm and Log Likelihood algorithm, where is mainly focused on iterative decoding methods. Practical output of this work is program LDPC codes created in environment Matlab. The program is divided to two parts -- Practise LDPC codes and Simulation LDPC codes. The result reached by program Simulation LDPC codes is used to create a comparison of creating and decoding methods LDPC codes. For comparison of decoding methods LDPC codes were used BER characteristics and time dependence each method on various parameters LDPC code (number of iteration or size of parity matrix).
|
|
|
Simulation of mobile ad hoc network in NS-3 environment
Kolaja, Lukáš ; Hrouza, Ondřej (referee) ; Hošek, Jiří (advisor)
The goal of this bacherlor thesis is theoretically analyze the principles of wireless mobile ad hoc networks. The thesis describes the types of routing protocols such as AODV, DSDV or OLSR. Further describes the types of mobility models which is typically used in MANET. The thesis also deals with issues like use, safety and development of mobile ad hoc networks. The goal of the practical part is create an application which can parse an XML document that generates simulation that is already created. The application is written in PHP language and output data from this application is inserted to the databse by using SQL commands. From the database is easy to read the data from the original XML document.
|
|
|
Data transmition security with Reed-Müller codes
Hrouza, Ondřej ; Burda, Karel (referee) ; Němec, Karel (advisor)
The aim of this work is to propose a Reed-Muller code that secure data transfer to t = 4 independent errors, the information rate R ? 0,5 and for this code to produce a detailed proposal for implementation of the codec. In order to implement this proposal, it is necessary to familiarize themselves with the basic properties Reed-Muller codes. To understand the function of codec Reed-Muller code is in this thesis analyzed the process of encoding and decoding, which is based on a method of using the majority logic. For the design of codec, which consists of encoder and decoder, are used programmable logic circuits FPGA. These circuits are programmed in VHDL language, when for the design source codes is used Xilinx ISE 10.1. In thesis is examined in detail the structure and function of the encoder and decoder chosen Reed-Muller code and there are presented parts of the proposed source codes. Verify the functional ability of the codec is achieved by simulation in program ModelSim SE 5.7f. The simulation results together with the another proposal realization are output of this work.
|
|
|
LDPC codes
Hrouza, Ondřej ; Šedý, Jakub (referee) ; Šilhavý, Pavel (advisor)
The aim of this thesis are problematics about LDPC codes. There are described metods to create parity check matrix, where are important structured metods using finite geometry: Euclidean geometry and projectice geometry. Next area in this thesis is decoding LDPC codes. There are presented four metods: Hard-Decision algorithm, Bit-Flipping algorithm, The Sum-Product algorithm and Log Likelihood algorithm, where is mainly focused on iterative decoding methods. Practical output of this work is program LDPC codes created in environment Matlab. The program is divided to two parts -- Practise LDPC codes and Simulation LDPC codes. The result reached by program Simulation LDPC codes is used to create a comparison of creating and decoding methods LDPC codes. For comparison of decoding methods LDPC codes were used BER characteristics and time dependence each method on various parameters LDPC code (number of iteration or size of parity matrix).
|
guest ::
