Have a personal or library account? Click to login
Decomposition-based logic synthesis for PAL-based CPLDs Cover
By: Adam Opara and  Dariusz Kania  
Open Access
|Jul 2010

Abstract

The paper presents one concept of decomposition methods dedicated to PAL-based CPLDs. The proposed approach is an alternative to the classical one, which is based on two-level minimization of separate single-output functions. The key idea of the algorithm is to search for free blocks that could be implemented in PAL-based logic blocks containing a limited number of product terms. In order to better exploit the number of product terms, two-stage decomposition and BDD-based decomposition are to be used. In BDD-based decomposition methods, functions are represented by Reduced Ordered Binary Decision Diagrams (ROBDDs). The results of experiments prove that the proposed solution is more effective, in terms of the usage of programmable device resources, compared with the classical ones.

DOI: https://doi.org/10.2478/v10006-010-0027-1 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 367 - 384
Published on: Jul 2, 2010
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2010 Adam Opara, Dariusz Kania, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 20 (2010): Issue 2 (June 2010)