DocumentCode
3349003
Title
Algorithm and Program for Block-Recurred Function Decomposition Using q-Minterm Partitioning Method
Author
Rytsar, Bohdan ; Shvay, Adrian
Author_Institution
Inst. of Telecommun., Radio Electron. & Electron. Tech., L´´viv Polytech. Nat. Univ., Lviv
fYear
2007
fDate
19-24 Feb. 2007
Firstpage
274
Lastpage
275
Abstract
The algorithm and program BRASh for partitive block-recured decomposition of Boolean function has been given. It is based on the q-minterm partitioning. The proposed algorithm has a simpler computer realization due to using of structured sets in other words decomposition clones.
Keywords
Boolean functions; logic partitioning; BRASh program; Boolean function; block-recurred function decomposition; decomposition clones; q-minterm partitioning method; Boolean functions; Cloning; Field programmable gate arrays; Logic devices; Matrix decomposition; Partitioning algorithms; Programmable logic arrays; Programmable logic devices; Set theory; block-recurred decomposition; decomposition clones; q-minterm partitioning;
fLanguage
English
Publisher
ieee
Conference_Titel
CAD Systems in Microelectronics, 2007. CADSM '07. 9th International Conference - The Experience of Designing and Applications of
Conference_Location
Lviv-Polyana
Print_ISBN
966-533-587-0
Type
conf
DOI
10.1109/CADSM.2007.4297547
Filename
4297547
Link To Document