Thesis Details

Hledání regulárních výrazů s využitím technologie FPGA

Master's Thesis Student: Kaštil Jan Academic Year: 2007/2008 Supervisor: Kořenek Jan, doc. Ing., Ph.D.
English title
Fast Regular Expression Matching Using FPGA
Language
Czech
Abstract

The thesis explains several algorithms for pattern matching. Algorithms work in both software and hardware. A part of the thesis is dedicated to extensions of finite automatons. The second part explains hashing and introduces concept of perfect hashing and CRC. The thesis also includes a suggestion of possible structure of a pattern matching unit based on deterministic finite automatons in FPGA. Experiments for determining the structure and size of resulting automatons were done in this thesis.

Keywords

IDS, finite automaton,CRC, perfect hashing, pattern matching, programmable hardware,FPGA

Department
Degree Programme
Information Technology, Field of Study Intelligent Systems
Files
Status
defended, grade C
Date
16 June 2008
Reviewer
Committee
Češka Milan, prof. RNDr., CSc. (DITS FIT BUT), předseda
Hanáček Petr, doc. Dr. Ing. (DITS FIT BUT), člen
Herout Adam, prof. Ing., Ph.D. (DCGM FIT BUT), člen
Orság Filip, Ing., Ph.D. (DITS FIT BUT), člen
Peringer Petr, Dr. Ing. (DITS FIT BUT), člen
Racek Stanislav, doc. Ing., CSc. (WBU in Pilsen), člen
Citation
KAŠTIL, Jan. Hledání regulárních výrazů s využitím technologie FPGA. Brno, 2008. Master's Thesis. Brno University of Technology, Faculty of Information Technology. 2008-06-16. Supervised by Kořenek Jan. Available from: https://www.fit.vut.cz/study/thesis/6671/
BibTeX
@mastersthesis{FITMT6671,
    author = "Jan Ka\v{s}til",
    type = "Master's thesis",
    title = "Hled\'{a}n\'{i} regul\'{a}rn\'{i}ch v\'{y}raz\r{u} s vyu\v{z}it\'{i}m technologie FPGA",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2008,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/6671/"
}
Back to top