Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/input-variable-partitioning-method-for-decomposition-based-logic-OJw6ZnOBRo
References (22)
-
T. Łuba, H. Selvaraj, M. Nowicka, A. Krasniewski (1995)
Balanced multilevel decomposition and its applications in FPGA-based synthesis -
M. Rawski (2007)
Decomposition of Boolean function setsElectronics and Telecommunications Quarterly
-
M. Rawski, P. Tomaszewicz, H. Selvaraj, T. Luba (2005)
Efficient Implementation of digital filters with use of advanced synthesis methods targeted FPGA architectures8th Euromicro Conference on Digital System Design (DSD'05)
-
J. Cong, K. Yan (2000)
Synthesis for FPGAs with embedded memory blocks -
M. Rawski, L. Józwiak, T. Luba (1999)
The influence of the number of values in sub-functions on the effectiveness and efficiency of the functional decompositionProceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium, 1
-
M. Rawski (2011)
Evolutionary Algorithms in Decomposition-Based Logic Synthesis -
Christoph Scholl (2001)
Functional decomposition with applications to FPGA synthesis -
(1994)
A survey of literature on function decomposition. final report for summer faculty research program -
M. Rawski, T. Łuba, Z. Jachna, P. Tomaszewicz (2005)
The Influence of Functional Decomposition on Modern Digital Design Process -
P. Morawiecki, M. Rawski (2008)
Method of input variable partitioning in functional decomposition based on evolutionary algorithm and binary decision diagrams2008 Conference on Human System Interactions
-
M. Rawski, L. Józwiak, T. Luba (1999)
Efficient input support selection for sub-functions in functional decomposition based on information relationship measuresProceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium, 1
-
Hiroshi Sawada, Takayuki Suyama, A. Nagoya (1995)
Logic synthesis for look-up table based FPGAs using functional decomposition and support minimizationProceedings of IEEE International Conference on Computer Aided Design (ICCAD)
-
J. Brzozowski, T. Luba (2003)
Decomposition of Boolean Functions Specified by CubesJ. Multiple Valued Log. Soft Comput., 9
-
M. Rawski, L. Józwiak, T. Luba (2001)
Functional decomposition with an efficient input support selection for sub-functions based on information relationship measuresJ. Syst. Archit., 47
-
W. Wan, M. Perkowski (1992)
A new approach to the decomposition of incompletely specified multi-output functions based on graph coloring and local transformations and its application to FPGA mappingProceedings EURO-DAC '92: European Design Automation Conference
-
R. Murgai, Narendra Shenoy, R. Brayton, A. Sangiovanni-Vincentelli (1991)
Improved logic synthesis algorithms for table look up architectures1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers
-
Tsutomu Sasao (1997)
Logic Synthesis and Optimization -
M. Rawski (2007)
Efficient variable partitioning method for functional decompositionElectronics and Telecommunications Quarterly
-
Srini Krishnamoorthy, R. Tessier (2003)
Technology mapping algorithms for hybrid FPGAs containing lookup tables and PLAsIEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 22
-
Y. Lai, Massoud Pedram, S. Vrudhula (1993)
BDD Based Decomposition of Logic Functions with Application to FPGA Synthesis30th ACM/IEEE Design Automation Conference
-
Tsutomu Sasao, Y. Iguchi, Takahiro Suzuki (2005)
On LUT cascade realizations of FIR filters8th Euromicro Conference on Digital System Design (DSD'05)
-
S. Yang (1991)
Logic Synthesis and Optimization Benchmarks User Guide Version 3.0
- Publisher
- de Gruyter
- Copyright
- Copyright © 2012 by the
- ISSN
- 0867-6747
- DOI
- 10.2478/v10177-012-0002-x
- Publisher site
- See Article on Publisher Site
Abstract
Input Variable Partitioning Method for Decomposition-Based Logic Synthesis targeted Heterogeneous FPGAs The functional decomposition has found an application in many fields of modern engineering and science, such as combinational and sequential logic synthesis for VLSI systems, pattern analysis, knowledge discovery, machine learning, decision systems, data bases, data mining etc. It is perceived as one of the best logic synthesis methods for FPGAs. However, its practical usefulness for very complex systems depends on efficiency of method used in decomposition calculation. One of the most important steps in functional decomposition construction is selection of the appropriate input variable partitioning. In case of modern heterogeneous programmable structures efficiency of methods used to solve this problem becomes especially important. Since the input variable partitioning problem is an NP-hard, heuristic methods have to be used to efficiently and effectively search for optimal or near-optimal solutions. The paper presents a method for bound set selection in functional decomposition targeted FPGAs with heterogeneous structure. This heuristic algorithm delivers optimal or near optimal results and is much faster than other methods.
Journal
International Journal of Electronics and Telecommunications – de Gruyter
Published: Mar 1, 2012