|
|
Perfect Hashing in FPGA
Matušová, Lucie ; Košař, Vlastimil (referee) ; Kaštil, Jan (advisor)
This thesis deals with a design and implementation of a perfect hashing in FPGA by using an FCH method. The method requires 2.6 bits per key to be stored. For the purposes of reference implementation the CMPH library has been used. The functionality of the implemented unit was verified in simulations by the program ModelSim and by experiments on ML605 board bedded with Virtex-6 chip. An experimental part of this work applies to an analysis of enhancement possibilities of the frequency unit. Maximum achieved frequency is 191 MHz. Possible directions of this work are discussed in the conclusion.
|
|
|
Reliability Measurement of the Pattern Matching
Dvořák, Milan ; Košař, Vlastimil (referee) ; Kaštil, Jan (advisor)
This thesis deals with the pattern matching methods based on finite automata and describes their optimizations. It presents a methodology for the measurement of reliability of pattern matching methods, by comparing their results to the results of the PCRE library. Experiments were conducted for a finite automaton with perfect hashing and faulty transition table. Finally, the resulting reliability evaluation of the algorithm is shown and possible solutions of the identified problems are proposed.
|
|
|
Perfect Hashing in FPGA
Matušová, Lucie ; Košař, Vlastimil (referee) ; Kaštil, Jan (advisor)
This thesis deals with a design and implementation of a perfect hashing in FPGA by using an FCH method. The method requires 2.6 bits per key to be stored. For the purposes of reference implementation the CMPH library has been used. The functionality of the implemented unit was verified in simulations by the program ModelSim and by experiments on ML605 board bedded with Virtex-6 chip. An experimental part of this work applies to an analysis of enhancement possibilities of the frequency unit. Maximum achieved frequency is 191 MHz. Possible directions of this work are discussed in the conclusion.
|
|
|
Reliability Measurement of the Pattern Matching
Dvořák, Milan ; Košař, Vlastimil (referee) ; Kaštil, Jan (advisor)
This thesis deals with the pattern matching methods based on finite automata and describes their optimizations. It presents a methodology for the measurement of reliability of pattern matching methods, by comparing their results to the results of the PCRE library. Experiments were conducted for a finite automaton with perfect hashing and faulty transition table. Finally, the resulting reliability evaluation of the algorithm is shown and possible solutions of the identified problems are proposed.
|
guest ::
