State assignment techniques in multiple-valued logic

Adams, K.J.; Campbell, Jonathan G.; Maguire, Lisa; Webb, Jon A.

doi:10.1109/ismvl.1999.779720

Cited by 6 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consequently, there are a total of 24 possible encoding schemes. It is impossible to find an encoding scheme that is optimal for all GLIFT circuits because the problem is hard in nature [19] and optimal encodings are usually specific to given circuits. However, it is possible to perform area and delay analysis on GLIFT logic for a set of basic Boolean operators under different encoding schemes and choose a relatively better one.…”

Section: B Glift Logic For Boolean Gates Under the New Encodingmentioning

confidence: 99%

Simultaneous information flow security and circuit redundancy in Boolean gates

Oberg

et al. 2012

Proceedings of the International Conference on Computer-Aided Design

View full text Add to dashboard Cite

Abstract-High assurance systems require strict guarantees on information flow security and fault tolerance or else face catastrophic consequences. Recently, Gate Level Information Flow Tracking (GLIFT) has been proposed to monitor information flows at the level of Boolean logic. At this level, all flows are explicit which makes it possible to detect security violations, even those that occur due to difficult to detect timing channels. In this paper, we show that the encoding technique used in previous GLIFT generation methods includes redundant encoding states, which leads to large overheads in area, delay and verification time. We present a new encoding technique with fewer encoding states by leveraging an inherent property of GLIFT. By denoting don't-care input conditions to logic synthesis tools, smaller GLIFT logic for dynamic information flow tracking is obtained and shorter simulation time for static information flow security verification is achieved. Experimental results using the IWLS benchmarks show average reductions of 39.8%, 31.1% and 57.5% in area, delay and simulation time respectively. Furthermore, the new encoding technique enables the GLIFT tracking logic to function both as information flow tracking and redundant logic. As a result, information flow security and fault tolerance can be simultaneously enforced with the same logic.

show abstract

Section: B Glift Logic For Boolean Gates Under the New Encodingmentioning

confidence: 99%

Simultaneous information flow security and circuit redundancy in Boolean gates

Oberg

et al. 2012

Proceedings of the International Conference on Computer-Aided Design

View full text Add to dashboard Cite

show abstract

“…where f 2 ðx 2 ; x 3 ; x 4 Þ ¼ f 0 ðx 2 ; x 3 ; x 4 Þ%f 1 ðx 2 ; x 3 ; x 4 Þ and f 0 ðx 2 ; x 3 ; x 4 Þ; f 1 ðx 2 ; x 3 ; x 4 Þ are, respectively, the negative and positive cofactors of f with respect to input variable x 1 The second level has LI(2)- [15,3,10,7] expansion for the set of LI functions on variables {x 2 ,x 4 } and the third level has Shannon expansions for variable x 3 .…”

Section: Definitionmentioning

confidence: 99%

“…The concepts of LI logic have been also used for image processing [16] and encoding [1]. Similarly to the ReedMuller (RM) logic [36 -45] that is a special case of the LI logic, the circuits realized using LI logic are obtained by repetitive expansions of a logic function.…”

Section: Introductionmentioning

confidence: 99%

Efficient Algorithms for Creation of Linearly‐independent Decision Diagrams and their Mapping to Regular Layouts

et al. 2000

View full text Add to dashboard Cite

A new kind of a decision diagrams are presented: its nodes correspond to all types of nonsingular expansions for groups of input variables, in particular pairs. The diagrams are called the Linearly Independent (LI) Decision Diagrams (LI DDs). There are 840 nonsigular expansions for a pair of variables, thus 840 different types of nodes in the tree. Therefore, the number of nodes in such (exact) diagrams is usually much smaller than the number of nodes in the well-known Kronecker diagrams (which have only single-variable Shannon, Positive Davio, and Negative Davio expansions in nodes). It is usually much smaller than 1/3 of the number of nodes in Kronecker diagrams. Similarly to Kronecker diagrams, the LI Diagrams are a starting point to a synthesis of multilevel AND/OR/EXOR circuits with regular structures. Other advantages of LI diagrams include: they generalize the well-known Pseudo-Kronecker Functional Decision Diagrams, and can be used to optimize the new type of PLAs called LI PLAs. Importantly, while the known decision diagrams used AND/EXOR or AND/OR bases, the new diagrams are AND/OR/EXOR-based. Thus, because of a larger design space, multi-level structures of higher regularity can be created with them. This paper presents both new concepts and new efficient synthesis algorithms.

show abstract

“…These are the Reed-MullerFourier of [Stankovic et al 1998], the algebra of [Dubrova et al 1996], Level Detector algebra described in [Adams et al 2002], and an extension of the algebra proposed by [Calingairt 1961], described in [Adams et al 1999]. These all use MOD 4 arithmetic.…”

Section: Introductionmentioning

confidence: 99%