Ostvarivanje Booleovih funkcija konfigurabilnim logičkim blokovima uporabom evolucijskog računanja

undergraduate thesis

• Title (english): Evolutionary Computation for Implementation of Boolean Functions Using Configurable Logic Blocks
• Author: Domagoj Latečki
• Mentor: Marko Čupić (mentor)
• Committee member: Marko Čupić (član povjerenstva)
• Committee member: Davor Kukolja (član povjerenstva)
• Committee member: Alan Jović (član povjerenstva)
• Granter: University of Zagreb; Faculty of Electrical Engineering and Computing; Zagreb
• Defense date and country: 2017-07-06, Croatia
• Scientific / art field, discipline and subdiscipline: TECHNICAL SCIENCES; Computing

Abstract

Programirljivo logičko polje danas ima mnoge primjene. Međutim, nije lako pronaći algoritam koji brzo mapira logičke funkcije u fizički FPGA sklop, jer je taj problem po svojoj prirodi NP-potpun. Zbog toga valja razmotriti drugu strategiju umjesto pronalaska egzaktnog algoritma. Jedan moguć pristup je uporaba genetskog algoritma. Ovaj rad bavi se pronalaskom sadržaja konfigurabilnih logičkih blokova i njihove međusobne povezanosti, kako bi se ostvario neki zadani skup logičkih funkcija. Za pronalazak rješenja korišten je Kartezijev genetski algoritam, jer je za njega pokazano da dobro rješava navedeni problem. Dan je opis mogućih načina korištenja algoritma, te su provedeni testovi kako bi se ustanovili optimalni parametri za korištenje algoritma. Opisan je način pozivanja programa i zadavanja parametara, način unosa logičkih funkcija, te ispis programa.

Abstract (english)

Programmable logic array has widespread usage today. However it is not easy to find an algorithm which can quickly map logic functions into physical FPGA circuit because of the NP-completeness of the problem. For that reason, it is worthwhile to consider strategies other than an exact algorithm. A possible approach can be usage of genetic algorithm. This thesis is about finding the correct contents and connections between configurable logic blocks for given set of functions. Cartesian genetic algorithm is used to find the solution because it was shown that it can solve the given problem quite successfully. The description of possible usage of the algorithm is given and tests have been carried out to determine optimal parameters for the algorithm. Description is provided for program usage, its parameters, input format of logic functions and program output.

• Keywords: Kartezijev genetski algoritam; raspored blokova FPGA sklopa
• Keywords (english): Cartesian genetic algorithm; FPGA routing
• Language: croatian
• URN:NBN: urn:nbn:hr:168:681149
• Study programme: Title: Computing; Study programme type: university; Study level: undergraduate; Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
• Type of resource: Text
• File origin: Born digital
• Access conditions: Closed access
• Created on: 2019-03-13 22:15:23