A Design Method for Irredundant Cascades
نویسندگان
چکیده
A realization of multiple-output logic functions using an irredundant cascade is presented. First, a multiple-output function is represented by an encoded characteristic function for non-zeros (ECFN). Then, it is represented by a cascade of look-up tables (LUTs). Multiple-output functions for benchmark functions are realized by cascades of LUTs, and the number of LUTs and levels of cascades are shown.
منابع مشابه
Design Methods for Multi-Rail Cascades
This paper surveys methods to represent logic functions by cascades. First, a design method for multi-rail cascades with redundant inputs is shown. It uses logic minimization of SOPs (sumof-products expressions) or ESOPs (EXOR sum-of-products expressions) of multiple-valued inputs. Then, a design method for multi-rail cascades with irredundant inputs is shown. It uses functional decompositions ...
متن کاملThe Irredundant Class Method for Remote Homology Detection of Protein Sequences
The automatic classification of protein sequences into families is of great help for the functional prediction and annotation of new proteins. In this article, we present a method called Irredundant Class that address the remote homology detection problem. The best performing methods that solve this problem are string kernels, that compute a similarity function between pairs of proteins based o...
متن کاملRemote Homology Detection of Protein Sequences
The automatic classification of protein sequences into families is of great help for the functional prediction and annotation of new proteins. In the paper we present a method called Irredundant Class that address the remote homology detection problem. The best performing methods that solve this problem are string kernels, that compute a similarity function between pairs of proteins based on th...
متن کاملTotal perfect codes, OO-irredundant and total subdivision in graphs
Let $G=(V(G),E(G))$ be a graph, $gamma_t(G)$. Let $ooir(G)$ be the total domination and OO-irredundance number of $G$, respectively. A total dominating set $S$ of $G$ is called a $textit{total perfect code}$ if every vertex in $V(G)$ is adjacent to exactly one vertex of $S$. In this paper, we show that if $G$ has a total perfect code, then $gamma_t(G)=ooir(G)$. As a consequence, ...
متن کاملRedundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the performances measured on a large number of random instances. The size of these instances is, in general, small to get these experiments done in reasonable time. This assumes that the small size formulas have the same ...
متن کامل