dc.contributor.author |
Kamal, Tahseen |
|
dc.date.accessioned |
2024-09-25T04:06:54Z |
|
dc.date.available |
2024-09-25T04:06:54Z |
|
dc.date.issued |
2006-04-30 |
|
dc.identifier.uri |
http://dspace.ewubd.edu:8080/handle/123456789/4431 |
|
dc.description |
This thesis submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering of East West University, Dhaka, Bangladesh. |
en_US |
dc.description.abstract |
There are many ways a Boolean function can be The most popular one is a truth table representation. size the truth table increases exponentially with the increase n Another commonly used approach AND-OR represent also known as the Sum-of-Products than
During last two decade researchers focused their eyes logic functions using EXOR-based circuits which is more compact than AND-OR representation. example, for representing a function an AND-OR AND-EXOR representation takes n product In this chapter, classification of AND-OR AND-EXOR logic is presented along with details description. |
en_US |
dc.language.iso |
en_US |
en_US |
dc.publisher |
East West University |
en_US |
dc.relation.ispartofseries |
;CSE00004 |
|
dc.subject |
Circuit for Optimization of Fixed Polarity Reed-Muller Expressions |
en_US |
dc.title |
An Application Specific Integrated Circuit for Optimization of Fixed Polarity Reed-Muller Expressions |
en_US |
dc.type |
Thesis |
en_US |