17,556 Hits in 7.3 sec

SAT sweeping with local observability don't-cares

Qi Zhu, N. Kitchen, A. Kuehlmann, A. Sangiovanni-Vincentelli
2006 Proceedings - Design Automation Conference  
Due to its robustness and efficiency, SAT sweeping provides a solid algorithm for Boolean reasoning in functional verification and logic synthesis.  ...  with a moderate increase in computational effort.  ...  However, as shown later in Algorithm 2, we only use the vectors as an initial filter for finding candidates for merging.  ... 
doi:10.1109/dac.2006.229206 fatcat:qtvgulb4ifhjdbcn36j7l4j25e

SAT Sweeping with Local Observability Don't-Cares [chapter]

Qi Zhu, Nathan B. Kitchen, Andreas Kuehlmann, Alberto Sangiovanni-Vincentelli
2010 Advanced Techniques in Logic Synthesis, Optimizations and Applications  
In this paper we present a significant extension of the SATsweeping algorithm that uses observability don't-cares (ODCs) for greater graph simplification.  ...  with a moderate increase in computational effort. .  ...  However, as shown later in Algorithm 2, we only use the vectors as an initial filter for finding candidates for merging.  ... 
doi:10.1007/978-1-4419-7518-8_8 fatcat:hjwyvuhflbglvmcldtj2tjbcga

SAT sweeping with local observability don't-cares

Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto Sangiovanni-Vincentelli
2006 Proceedings of the 43rd annual conference on Design automation - DAC '06  
Due to its robustness and efficiency, SAT sweeping provides a solid algorithm for Boolean reasoning in functional verification and logic synthesis.  ...  with a moderate increase in computational effort.  ...  However, as shown later in Algorithm 2, we only use the vectors as an initial filter for finding candidates for merging.  ... 
doi:10.1145/1146909.1146970 dblp:conf/dac/ZhuKKS06 fatcat:2gtnltl7rngppk3jfcionzrweq

The use of observability and external don't cares for the simplification of multi-level networks

Hamid Savoj, Robert K. Brayton
1990 Conference proceedings on 27th ACM/IEEE design automation conference - DAC '90  
We give an algorithm for computing subsets of observability don't cares at the nodes of a multi-level Boolean netwodc.  ...  The extensions presented are in four directions; an arbitrary logic function is allowed at any node, the don't cares are expressed in terms of both primary inputs and intermediate variables, a new ordering  ...  ~f is a valid compatible observability don't care subset for the edge f k i .  ... 
doi:10.1145/123186.123280 dblp:conf/dac/SavojB90 fatcat:6lfuziahundx3hpjb6bb2z4ge4

Extending Boolean Methods for Scalable Logic Synthesis

Eleonora Testa, Luca Amaru, Mathias Soeken, Alan Mishchenko, Patrick Vuillod, Pierre-Emmanuel Gaillardon, Giovanni De Micheli
2020 IEEE Access  
We discuss novel Boolean filtering techniques, together with a new efficient way for computing permissible functions and don't cares.  ...  In this scenario, AIGs are used as underlying data structure for k-resubstitution (with k up to 3) and truth tables are used to compute don't cares [33] .  ...  He is a Scientist with the ÃL'cole Polytechnique FÃl'dÃl'derale de Lausanne (EPFL), Lausanne, Switzerland.  ... 
doi:10.1109/access.2020.3045014 fatcat:ha4iwivhlrbz7e6skcq7pncjj4

Optimization Of FRM Filters Using The WLS–Chebyshev Approach

Luiz C. R. de Barcellos, Sergio L. Netto, Paulo S. R. Diniz
2003 Circuits, systems, and signal processing  
Computational savings are in the order of 10%-15% of the original number of coefficients of the standard FRM design (using the concept of "don't care" bands for the masking filters).  ...  Then, by exploiting the concept of critical bands, introduced in this paper, we present a method for designing modified FRM filters with a further reduction in the computational complexity.  ...  The standard minimax FIR filter requires an order N = 381, whereas the standard FRM filter (using the concept of "don't care" bands for the masking filters) satisfies the specifications with the characteristics  ... 
doi:10.1007/s00034-004-7022-y fatcat:wggdgapy4zba3mllf7pkkwwe5u

Utilizing don't care states in SAT-based bounded sequential problems

Sean Safarpour, Görschwin Fey, Andreas Veneris, Rolf Drechsler
2005 Proceedings of the 15th ACM Great Lakes symposium on VLSI - GLSVSLI '05  
In this work, we introduce a technique that improves the performance of the underlying SAT solver for bounded sequential problems by taking advantage of a design's don't care states.  ...  We develop cost effective methods of filtering, replicating and applying the don't care states to the original problem thus reducing the search space.  ...  Next, starting with the smallest-size cubes, each cube is converted to a CNF clause, replicated for each time frame, and added to Algorithm 1 Filter and apply don't care states for BSEC sort cubes in ascending  ... 
doi:10.1145/1057661.1057725 dblp:conf/glvlsi/SafarpourFVD05 fatcat:tpualjeubvhw3ixxpchzsx7jta

Design Of Equiripple Minimum Phase Fir-Filters

A. Groth, H.G. Gockler
1998 Zenodo  
Filter with high stopband attentuation Example 1 is based on the prescription of a constant desired value in most part of the don't care region of the passband prototype lter P (z).  ...  Instead of P (z) a model passband lter P (z 0 ) is designed for the K-fold stretched frequency axis.Widening the passband width by K and, thus, reducing the don't care region, a slightly higher order as  ... 
doi:10.5281/zenodo.36700 fatcat:237rredhyvac3hvz2ks4yq2ddy

Eliminating false loops caused by sharing in control path

Alan Su, Yu-Chin Hsu, Ta-Yung Liu, Mike Tien-Chien Lee
1998 ACM Transactions on Design Automation of Electronic Systems  
However, for a complete circuit with both data path and control path, false loops can be created due to control logic sharing, even though the loops caused by data path sharing have all been removed.  ...  A removal algorithm is then applied to eliminate the detected false loops, followed by logic minimization to further optimize the circuit.  ...  Since each x k is considered don't care to s 0 , the boolean difference of s 0 = f s (x 1 ; ; x n s ) with respect to x k should be 0.  ... 
doi:10.1145/293625.293635 fatcat:o6tjg5vtnzexfcrwpqubor4f7a

NETp1-03: Partition Filter Set for Power-Efficient Packet Classification

Haibin Lu, Mian Pan
2006 IEEE Global Communications Conference, Exhibition, & Industry Forum (GLOBECOM)  
However, it is quite challenging to design efficient algorithms to partition a set of multi-dimensional filters into many subsets (a subset is placed in one TCAM block).  ...  Ternary Content-Addressable Memory (TCAM) has been widely used for high-performance multi-dimensional packet classification. High power consumption limits the use of TCAM for large filter sets.  ...  A set of six filters. The rule part consists of possible values for source IP address, destination IP address, protocol, source port number, and destination port number. "x" is "don't care" bit.  ... 
doi:10.1109/glocom.2006.229 dblp:conf/globecom/LuP06 fatcat:6s6vz6iukbe2pimrlu7nvfyws4

Knowledge Extraction and Problem Structure Identification in XCS [chapter]

Martin V. Butz, Pier Luca Lanzi, Xavier Llorà, David E. Goldberg
2004 Lecture Notes in Computer Science  
Recent theoretical advancements show that the system can scale-up polynomially in the problem complexity and problem size given the problem is a k-DNF with certain properties.  ...  XCS has been shown to solve hard problems in a machine-learning competitive way.  ...  The US Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon.  ... 
doi:10.1007/978-3-540-30217-9_106 fatcat:pp277lt5dfgu5dtcaipvbkvhzu

Generating example data for dataflow programs

Christopher Olston, Shubham Chopra, Utkarsh Srivastava
2009 Proceedings of the 35th SIGMOD international conference on Management of data - SIGMOD '09  
We introduce and study the problem of generating example intermediate data for dataflow programs, in a manner that illustrates the semantics of the operators while keeping the example data small.  ...  We identify two major obstacles that impede naive approaches, namely (1) highly selective operators and (2) noninvertible operators, and offer techniques for dealing with these obstacles.  ...  For example, if the transformation is a projection, add extra fields with "don't care" markers for the projected attributes.  ... 
doi:10.1145/1559845.1559873 dblp:conf/sigmod/OlstonCS09 fatcat:jpepa7dpgnfapb33zp3ar6qt4m

Realization of rank order filters based on majority gate

A. Gasteratos, I. Andreadis, Ph. Tsalides
1997 Pattern Recognition  
A pipelined systolic array, suitable for performing rank order filtering, is also presented.  ...  A new technique for the implementation of a single hardware structure capable of computing any rank order filter is presented in this paper.  ...  Table 1 illustrates the proposed technique for the computation of the second-order statistic of nine 4-bit numbers (a "don't care" state is denoted by X).  ... 
doi:10.1016/s0031-3203(96)00170-7 fatcat:esog3y232nb2teuvrlwwdwvvqi

A modified algorithm for constrained least square design of multiband FIR filters without specified transition bands

I.W. Selesnick, M. Lang, C.S. Burrus
1998 IEEE Transactions on Signal Processing  
In a previous paper, we described a constrained least square approach to FIR filter design that does not use "don't care" regions.  ...  In that paper, we described a simple algorithm for the design of lowpass filters according to that approach.  ...  INTRODUCTION In a previous paper [4], we described a constrained least square approach to FIR filter design that does not use "don't care" regions and described a simple multiple-exchange algorithm for  ... 
doi:10.1109/78.655433 fatcat:lurv2mamsfhcxpltgyw5gq42ke

Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks [chapter]

Michael Mitzenmacher
2005 Lecture Notes in Computer Science  
• Data is like water from a fountain -Put out your cup, stop when the cup is full. -You don't care which drops of water you get. -You don't care what order the drops get to your cup.  ...  Bloom Filters Start with an m bit array, filled with 0s. • As k increases, more chances to find a 0, but more 1's in the array. • Find optimal at k = (ln 2)m/n by calculus.  ...  . • losses increase monotonically along a path. • Does this matter in practice?  ... 
doi:10.1007/11561927_1 fatcat:t3fsg76d55b75nkdihdvxll6he
« Previous Showing results 1 — 15 out of 17,556 results