National Repository of Grey Literature 7 records found  Search took 0.02 seconds. 
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).
Non-Euclidian Geometries in Computer Games
Jůda, Štěpán ; Hůlka, Tomáš (referee) ; Dobrovský, Ladislav (advisor)
The work deals with the origin and description of non-Euclidean geometry and its division into hyperbolic and elliptic non-Euclidean geometry. It also discusses the behavior of geometric elements from Euclidean geometry in non-Euclidean geometries. Another subject of this work is the classification of computer games that use non-Euclidean geometry. The last point is the process of creating my own computer game.
Parametric Geometry Sketch Tool
Vala, Jan ; Zahrádka, Jiří (referee) ; Zemčík, Pavel (advisor)
Purpose of this Bachelor's thesis is the design and implementation of Parametric geometry sketch tool. This thesis also includes basic terms of dynamic geometry. Summary of the state of the art, description of existing tools, followed by evaluation of their features. Results and possibilites of future expansion are summarized in the last chapter.
Non-Euclidian Geometries in Computer Games
Jůda, Štěpán ; Hůlka, Tomáš (referee) ; Dobrovský, Ladislav (advisor)
The work deals with the origin and description of non-Euclidean geometry and its division into hyperbolic and elliptic non-Euclidean geometry. It also discusses the behavior of geometric elements from Euclidean geometry in non-Euclidean geometries. Another subject of this work is the classification of computer games that use non-Euclidean geometry. The last point is the process of creating my own computer game.
Parametric Geometry Sketch Tool
Vala, Jan ; Zahrádka, Jiří (referee) ; Zemčík, Pavel (advisor)
Purpose of this Bachelor's thesis is the design and implementation of Parametric geometry sketch tool. This thesis also includes basic terms of dynamic geometry. Summary of the state of the art, description of existing tools, followed by evaluation of their features. Results and possibilites of future expansion are summarized in the last chapter.
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).

Interested in being notified about new results for this query?
Subscribe to the RSS feed.