| 書目名稱 | Functional Decomposition with Applications to FPGA Synthesis | | 編輯 | Christoph Scholl | | 視頻video | http://file.papertrans.cn/350/349650/349650.mp4 | | 圖書封面 |  | | 描述 | During the last few years Field Programmable Gate Arrays(FPGAs) have become increasingly important. Thanks to recentbreakthroughs in technology, FPGAs offer millions of system gates atlow cost and considerable speed..Functional decomposition has emerged as an essential technique inautomatic logic synthesis for FPGAs. Functional decomposition as atechnique to find realizations for Boolean functions was alreadyintroduced in the late fifties and early sixties by Ashenhurst,Curtis, Roth and Karp. In recent years, however, it has attracted agreat deal of renewed attention, for several reasons. First, it isespecially well suited for the synthesis of lookup-table based FPGAs.Also, the increased capacities of today‘s computers as well as thedevelopment of new methods have made the method applicable tolarger-scale problems. Modern techniques for functional decompositionprofit from the success of Reduced Ordered Binary Decision Diagrams(ROBDDs), data structures that provide compact representations formany Boolean functions occurring in practical applications. We havenow seen the development of algorithms for functional decompositionwhich work directly based on ROBDDs, so that the decompositi | | 出版日期 | Book 2001 | | 關(guān)鍵詞 | Boolean function; FPGA; FPGA design; Field Programmable Gate Array; VLSI; algorithms; automation; computer; | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4757-3393-8 | | isbn_softcover | 978-1-4419-4929-5 | | isbn_ebook | 978-1-4757-3393-8 | | copyright | Springer Science+Business Media Dordrecht 2001 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-11 02:02
發(fā)表于 2025-3-21 18:54:49
