Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 105 for “"Boolean function"”.

  1. The synthesis of any Boolean function using majority logic

    The synthesis of Boolean functions using various physical devices is a real life problem for the electrical engineer. In this work Boolean functions are introduced using several geometrical representations, and some interesting properties are noted. A suboptimal, direct method of synthesis of any …

    rice Repository record for The synthesis of any Boolean function using majority logic (opens in a new tab)

  2. An Investigation of the Range of a Boolean Function

    The purpose of this section is to define a boolean algebra and to determine some of the important properties of it. A boolean algebra is a set B with two binary operations, join and meet, denoted by + and juxtaposition respectively, and a unary operation, complementation, denoted by ', which …

    utahstate Repository record for An Investigation of the Range of a Boolean Function (opens in a new tab)

  3. Efficient implementation of an exact multiple-output boolean function minimization algorithm

    … algorithm for exact multiple-output boolean function minimization is studied and compared with a heuristic minimization method. For this purpose, the algorithm has been implemented in optimized ANSI C code. This implementation introduces a new set of procedures to reduce the cost of …

    vt Repository record for Efficient implementation of an exact multiple-output boolean function minimization algorithm (opens in a new tab)

  4. Data structures, minimization and complexity of boolean functions

    Boolean function manipulation is an important component of computer science. This thesis presents results related to Boolean function representation and minimization. The Boolean function minimization problem is re-defined. A new Boolean function classification theory based on permutation and …

    sask Repository record for Data structures, minimization and complexity of boolean functions (opens in a new tab)

  5. The shortest disjunctive normal forms of Boolean functions by reducing the number of arguments

    … of a shortest disjunctive normal form of a Boolean function / by l(f), this thesis provides a way to express l(f) in terms of l(g) for some Boolean function g with no more arguments than f and with the same number of zeros as f . This method is useful for finding the shortest disjunctive …

    ubc Repository record for The shortest disjunctive normal forms of Boolean functions by reducing the number of arguments (opens in a new tab) Download PDF for The shortest disjunctive normal forms of Boolean functions by reducing the number of arguments (opens in a new tab)

  6. Correlation immunity, avalanche features, and other cryptographic properties of generalized Boolean functions

    … bent cryptographic properties for generalized Boolean functions defined on Vn with values in Zԛ. We extend the concept of correlation immunity from the Boolean case to the generalized setting, and provide multiple construction methods for order 1 and higher correlation immune generalized …

    nps Repository record for Correlation immunity, avalanche features, and other cryptographic properties of generalized Boolean functions (opens in a new tab)

  7. Level-p-complexity for Boolean Functions

    … specifically level-p-complexity, for various Boolean functions. Boolean functions are functions f from n bits to one bit, and they can describe circuits built from logic gates, voting systems as well as graph properties. An example of a Boolean function is majority, which returns the value …

    chalmers Repository record for Level-p-complexity for Boolean Functions (opens in a new tab)

  8. Independent sets in graph products via harmonic analysis

    … some techniques from Fourier analysis of Boolean functions on Znr . In fact we show that when most of the 2-norm weight of the Fourier expansion of a Boolean function on Znr is concentrated on the first two levels, then the function can be approximated by a Boolean function that depends …

    concordia Download PDF for Independent sets in graph products via harmonic analysis (opens in a new tab)

  9. Logic synthesis for networks of four-terminal switches.

    We develop a synthesis method to implement Boolean functions with lattices of four-terminal switches. Each switch is controlled by a Boolean literal. We address the synthesis problem of how best to assign literals to switches in a lattice in order to implement a given target Boolean function, with …

    umn Repository record for Logic synthesis for networks of four-terminal switches. (opens in a new tab)

  10. Applications of probabilistic combiners on linear feedback shift register sequences

    … secure by combining them with a nonlinear Boolean function called a combiner. In this thesis, we investigate a modification to the classical combiner method by introducing a (nonsecure) probabilistic randomization to the order in which the LFSRs are input into the combiner function at each …

    nps Repository record for Applications of probabilistic combiners on linear feedback shift register sequences (opens in a new tab)

  11. Efficient quantum communication protocols and asynchronism in the toric code

    … often by the introduction of more general Boolean functions. The first studied problem is the one of approximating the Hamming distance in the simultaneous message passing model in communication complexity --- a natural generalisation of the Equality problem. An efficient quantum …

    bristol Repository record for Efficient quantum communication protocols and asynchronism in the toric code (opens in a new tab) Download PDF for Efficient quantum communication protocols and asynchronism in the toric code (opens in a new tab)

  12. Minimização ótima de classes especiais de funções booleanas

    The problem of factoring and decomposing Boolean functions is Σ-complete𝑃2 for general functions. Efficient and exact algorithms can be created for an existing class of functions known as read-once, disjoint-support decomposable and read-polarity-once functions. A factored form is called read-once …

    brazil-ufrgs Repository record for Minimização ótima de classes especiais de funções booleanas (opens in a new tab)

  13. Discovery of bent functions using the Fast Walsh Transform

    … can be defended against by using combiner functions composed of highly nonlinear Boolean functions. Bent functions, which have the highest possible nonlinearity, are uncommon. As the number of variables in a Boolean function increases, bent functions become extremely rare. A method of …

    nps Repository record for Discovery of bent functions using the Fast Walsh Transform (opens in a new tab)

  14. Probabilistic testing of Boolean functions, or, How to test locally for a global property

    … (PCP). We consider specifically the testing of Boolean functions, discussing some key existing results and providing new results for several classes of functions. In particular, we give efficient tests for a Boolean function to be symmetric (invariant under permutation of its variables) and …

    ubc Repository record for Probabilistic testing of Boolean functions, or, How to test locally for a global property (opens in a new tab) Download PDF for Probabilistic testing of Boolean functions, or, How to test locally for a global property (opens in a new tab)

  15. An expert system to optimize combinational logic

    … logic for a given technology. By performing Boolean function minimization, decomposition, logic synthesis and a series of local transformations4, the system achieves area reductions and saves valuable design time.

    rit Repository record for An expert system to optimize combinational logic (opens in a new tab)

  16. Inferring Networks with Gene Knockouts and Computational Algebra

    … algebra. Specifically, given an unknown Boolean function, we can create a square-free monomial or pseudomonomial ideal whose primary decomposition encodes the possible sets of variables that the function can depend on, and whether those interactions are activations or inhibitions. We …

    clemson Repository record for Inferring Networks with Gene Knockouts and Computational Algebra (opens in a new tab)

  17. Topics in analysis of Boolean functions with applications to communication complexity

    … the relationships between various measures of Boolean functions and how understanding these relationships leads to applications in communication complexity. The primary application we consider is to the log-rank conjecture for XOR functions — a special case of the log-rank conjecture, one of …

    texas Repository record for Topics in analysis of Boolean functions with applications to communication complexity (opens in a new tab)

Page 1 of 6