Logic synthesis based on decomposition for CPLDs

Saved in:
Bibliographic Details
Title: Logic synthesis based on decomposition for CPLDs
Authors: Kania, Dariusz Dariusz.Kania@polsl.pl, Milik, Adam1 Adam.Milik@polsl.pl
Source: Microprocessors & Microsystems. Feb2010, Vol. 34 Issue 1, p25-38. 14p.
Subjects: Programmable logic devices, Decomposition method, PAL (Computer program language), Mathematical programming, Graph coloring, Computer logic, Logic circuits, Scientific experimentation
Abstract: Abstract: The paper presents a decomposition method dedicated for PAL based CPLDs. Non-standard usage of decomposition, which leads to the minimization of area in an implemented circuit and the reduction of used logic blocks in a programmable structure, is the aim of the proposed method. Each decomposition step (bound set selection, graph colouring, column pattern coding, etc.) is oriented for implementation in a PAL-based structure that is characterized by a PAL-based logic block. The proposed decomposition method is an extension of the classical approach, commonly thought to be adequately efficient. Experiments carried out on typical benchmarks show significant area reduction. [Copyright &y& Elsevier]
Copyright of Microprocessors & Microsystems is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Abstract: The paper presents a decomposition method dedicated for PAL based CPLDs. Non-standard usage of decomposition, which leads to the minimization of area in an implemented circuit and the reduction of used logic blocks in a programmable structure, is the aim of the proposed method. Each decomposition step (bound set selection, graph colouring, column pattern coding, etc.) is oriented for implementation in a PAL-based structure that is characterized by a PAL-based logic block. The proposed decomposition method is an extension of the classical approach, commonly thought to be adequately efficient. Experiments carried out on typical benchmarks show significant area reduction. [Copyright &y& Elsevier]
ISSN:01419331
DOI:10.1016/j.micpro.2009.11.002