Technology mapping for FPGA's using boolean matching and spectral techniques
| dc.contributor.author | Wang, Xiaojun | en_US |
| dc.date.accessioned | 2024-08-15T20:13:25Z | |
| dc.date.available | 2024-08-15T20:13:25Z | |
| dc.date.copyright | 1996 | en_US |
| dc.date.issued | 1996 | |
| dc.degree.department | Department of Computer Science | |
| dc.degree.level | Master of Science M.Sc. | en |
| dc.description.abstract | Field programmable gate arrays (FPGA's) are widely used in modern logic design because of their high flexibility, fast turn-around time and increasing capacities. The complexity of FPGA architectures requires highly efficient synthesis tools in order to conduct a successful design. Technology mapping is a critical step in FPGA synthesis. The quality of the final circuit depends heavily on this step. Many approaches to technology mapping require a quick method to determine that two Boolean functions are logically equivalent. In this thesis, we present an algorithm for technology mapping that is based on a new canonical spectrum for Boolean functions. Two functions are NPN matchable if, and only if, they can be transformed to the same canonical spectrum. Experimental results are presented to show that the algorithm is very effective in terms of the area of the final circuit and the time taken to perform the technology mapping. The thesis concludes with a number of future research directions arising from this work. | |
| dc.format.extent | 96 pages | |
| dc.identifier.uri | https://hdl.handle.net/1828/20047 | |
| dc.rights | Available to the World Wide Web | en_US |
| dc.title | Technology mapping for FPGA's using boolean matching and spectral techniques | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- WANG_Xiaojun_MSC_1996_695101.pdf
- Size:
- 25.46 MB
- Format:
- Adobe Portable Document Format