scientific article
From MaRDI portal
Publication:2770065
zbMath0989.94003MaRDI QIDQ2770065
Publication date: 6 February 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmscomputational complexityBoolean functionsfield programmable gate arrayslogic synthesisfunctional decompositionsymmetries of Boolean functions
Related Items (14)
The complexity of modular decomposition of Boolean functions ⋮ Decomposition of systems of Boolean functions determined by binary decision diagrams ⋮ Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram ⋮ Technology mapping of multi-output functions leading to the reduction of dynamic power consumption in FPGAs ⋮ Structural decomposition as a tool for the optimization of an FPGA-based implementation of a Mealy FSM ⋮ A new approach to the decomposition of Boolean functions by the method of \(q\)-partitions. III: Joint decomposition of a function system ⋮ 5 Logic Synthesis Method of Digital Circuits Designed for Implementation with Embedded Memory Blocks of FPGAs ⋮ Decomposition-based logic synthesis for PAL-based CPLDs ⋮ Improving characteristics of LUT-based Mealy FSMs ⋮ Unnamed Item ⋮ Hardware reduction for LUT-based Mealy FSMs ⋮ Optimization of CMCU with code sharing ⋮ A new approach to the decomposition of Boolean functions. IV. Non-disjoint decomposition: the method of \(p,q\)-partitions ⋮ Improving the LUT count for mealy FSMS with transformation of output collections
This page was built for publication:
