• No results found

Boolean function

Design of High Speed Vedic Multiplier Using K-Map Boolean Function Techniques

Design of High Speed Vedic Multiplier Using K-Map Boolean Function Techniques

... quantum Boolean circuit ...quantum Boolean circuit that has an arbitrary number of input ...reducing Boolean function to a minimum form For the purpose of minimizing hardware ...quantum ...

8

EDGE DOMINATION IN BOOLEAN FUNCTION GRAPH B(G, L(G), NINC) OF A GRAPH

EDGE DOMINATION IN BOOLEAN FUNCTION GRAPH B(G, L(G), NINC) OF A GRAPH

... A subset F  E is called an edge dominating set of G if every edge not in F is adjacent to some edge in F. The edge domination number (G) of G is the minimum cardinality taken over all edge dominating sets of G. The ...

5

Assessment of Reliability Factors in Chocolate Manufacturing Plant using Boolean Function Technique and Neural Networking

Assessment of Reliability Factors in Chocolate Manufacturing Plant using Boolean Function Technique and Neural Networking

... In this paper to calculate reliability, we discussed two different approaches neural network approach and Boolean approach for chocolate manufacturing plant. Critical observations of the tables and respected ...

6

Download
			
			
				Download PDF

Download Download PDF

... a Boolean function with a minimum number of multiplexers for partitions where n > q + ...the function as it requires the minimum number of additional gates to implement the residue ...

14

Hybrid LUT/MUX FPGA Logic Architecture for Size Reduction and Performance Improvement

Hybrid LUT/MUX FPGA Logic Architecture for Size Reduction and Performance Improvement

... of Boolean functions that are able to map to the MUX4 ...input Boolean function can be facilely implemented in the MUX4: the two function inputs can be tied to the cull lines and the truth ...

9

Near-linear  time,  Leakage-resilient  Key  Evolution  Schemes  from  Expander  Graphs

Near-linear time, Leakage-resilient Key Evolution Schemes from Expander Graphs

... hash function H, they design a boolean function whose computational complexity subject to a space constraint (in the RO model) is given by number of moves needed to pebble G subject to a contraint on ...

19

The  group  of  automorphisms  of  the  set  of  self-dual  bent  functions

The group of automorphisms of the set of self-dual bent functions

... bent function is a Boolean function in even number of variables which is on the maximal Hamming distance from the set of affine Boolean ...all Boolean functions in n variables to itself ...

17

Improving logic-level representation of taylor expansion diagram using attributed edges

Improving logic-level representation of taylor expansion diagram using attributed edges

... Most formal verification tools need a design to be converted to a canonical data structure in order for the formal verification algorithms to be used. Several data structures have been proposed to address this need, ...

14

Vol 7, No 2 (2016)

Vol 7, No 2 (2016)

... In this paper, bounds of complementary tree domination number of Boolean function graph B 4 (G) are obtained and this.. number is found for Boolean function graphs of particular graphs.[r] ...

6

The  Multiplicative  Complexity  of  Boolean  Functions  on  Four   and  Five  Variables

The Multiplicative Complexity of Boolean Functions on Four and Five Variables

... Multiplicative complexity of a randomly selected n-variable Boolean function is at least 2 n/2 − O(n) [13]. Exhaustive study of the distribution of multiplicative complexity can only be done for very small ...

13

Minimization of Boolean Functions Using Genetic Algorithm

Minimization of Boolean Functions Using Genetic Algorithm

... Each adjacency may include some of statements and refuse the others. For calculation of total minimized form using supposed adjacency, we must consider whole Boolean function except the statements that are ...

5

A Review on Biological Inspired Computation in Cryptology

A Review on Biological Inspired Computation in Cryptology

... using random generation, it is difficult to find functions with truly excellent properties due to the vast size of the search space while direct constructions may only meet certain design criteria. Millan enhanced his ...

11

PLACEMENT AND SIZING OF DISTRIBUTED GENERATORS IN DISTRIBUTED NETWORK BASED ON 
LRIC AND LOAD GROWTH CONTROL

PLACEMENT AND SIZING OF DISTRIBUTED GENERATORS IN DISTRIBUTED NETWORK BASED ON LRIC AND LOAD GROWTH CONTROL

... H- Boolean function and revealing the internal structure of Boolean function together with Boolean derivative, thus more effectively analyzing the property of Boolean ...on ...

5

On Relevance of Derivative, E derivative, and Correlation Immunity of Sum and Product for Boolean Functions

On Relevance of Derivative, E derivative, and Correlation Immunity of Sum and Product for Boolean Functions

... elastic Boolean functions represented by the derivative and e-derivative are elastic Boolean ...immune Boolean functions represented by the derivative are correlation ...of Boolean ...

8

Higher Order-Nonlinearities on Two Classes of
          Boolean Functions

Higher Order-Nonlinearities on Two Classes of Boolean Functions

... two Boolean functions is the number of places where functional value of functions does not ...match. Boolean function of algebraic degree one or less is said to be ...

6

Efficient  Collision  Attack  Frameworks  for  RIPEMD-160

Efficient Collision Attack Frameworks for RIPEMD-160

... compression function of MD5 ...hash function rather than the compression function, the initial value must be consistent with its definition of the primitive, which is costly under the start-from-the- ...

32

A Global Search Algorithm Combined With SIFT Algorithm For Optimization Of MUX BDD Switching Circuits

A Global Search Algorithm Combined With SIFT Algorithm For Optimization Of MUX BDD Switching Circuits

... constant function „0‟. The root node represents the function „F‟ and each of the internal node represents a sub-function of the original function of ...a Boolean function as ...

7

BooleanAlgebraPPT.ppt

BooleanAlgebraPPT.ppt

... • Digital computers contain circuits that implement Boolean functions.. • The simpler that we can make a Boolean function, the smaller the circuit that will result.[r] ...

75

PapadimitriouTCSplus.ppt

PapadimitriouTCSplus.ppt

... Main Theorem: Any Boolean function of genes which confers a small. evolutionary advantage will be[r] ...

47

De  Bruijn  Sequences  from  Symmetric  Shift  Registers

De Bruijn Sequences from Symmetric Shift Registers

... Boolean function h. The cycle structure of symmetric FSRs has been studied in [9, 16–19]. We recall some of the results in [16]. For simplicity, we use [a, b], where a and b are two integers such that a ≤ ...

13

Show all 10000 documents...

Related subjects