Division of Informatics
Forrest Hill & 80 South Bridge
MSc Thesis #9752 | |
|---|---|
| Title: | A Neighbourhood Search Approach to Fpga Design |
| Authors: | Ramos,S |
| Date: | Sep 1997 |
| Presented: | |
| Keywords: | |
| Abstract: | The simplification of logic functions plays an important role in the design of logic circuits. These functions may be represented in an AND-EXOR form. The synthesis of AND-EXOR logic expressions is affected by the variable ordering. Finding an optional ordering can be considered a combinatorial optimization problem. This dissertation describes and empirical investigation into the application of Neighbourhood Search Techniques to obtain a good variable ordering along with the effects of using different representations. |
| Download: | NO ONLINE COPY |
![[Search These Pages]](http://www.dai.ed.ac.uk/icons/dai_search.gif){kind=icon}
![[DAI Home Page]](http://www.dai.ed.ac.uk/icons/dai_home.gif){kind=icon}
![[Comment]](http://www.dai.ed.ac.uk/icons/dai_comment.gif){kind=icon}