Skip to main navigation Skip to search Skip to main content

An utilisation of boolean differential calculus in variables partition calculation for decomposition of logic functions

  • Stefan Kolłodziński
  • , Edward Hrynkiewicz
  • United Technologies Corporation

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Citations (Scopus)

Abstract

The paper deals with the problems of input variables assigning to the free and bounded sets during logic function decomposition. The Ashenhurst decomposition is considered with respect to implementation of logic functions in LUT based FPGA. The method of finding profitable input variables partitioning is based on utilisation of Logic Differential Calculus. The elaborated method is very convenient especially if decomposition is carried out in Reed- Muller spectral domain because the Boolean differentials are easy calculated from Reed-Muller form of logic function which is simply calculated as reverse Reed-Muller transform. The obtained results are very promising.

Original languageEnglish
Title of host publicationProceedings of the 2009 IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2009
Pages34-37
Number of pages4
DOIs
Publication statusPublished - 2009
Event2009 IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2009 - Liberec, Czech Republic
Duration: 15 Apr 2009 → 17 Apr 2009

Publication series

NameProceedings of the 2009 IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2009

Conference

Conference2009 IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2009
Country/TerritoryCzech Republic
CityLiberec
Period15/04/09 → 17/04/09

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'An utilisation of boolean differential calculus in variables partition calculation for decomposition of logic functions'. Together they form a unique fingerprint.

Cite this