Further improvements in the Boolean domain /
The amount of digital systems supporting our daily life is increasing continuously. Improved technical facilities for their production have led to growing challenges for engineers and scientists working in the Boolean domain. A Boolean variable can only carry two different Boolean values: FALSE or T...
Saved in:
| Other Authors: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Newcastle upon Tyne, UK :
Cambridge Scholars Publishing,
2018.
|
| Subjects: | |
| Online Access: | CONNECT |
Table of Contents:
- Intro; Contents; List of Figures; List of Tables; Foreword; Preface; Acknowledgments; List of Abbreviations; I Extensions in Theory and Computations; 1 Models, Methods, and Techniques; 1.1. NP-Problems and Boolean Equations; 1.1.1. Classes of Hard Problems; 1.1.2. Boolean Functions and Equations; 1.1.3. Boolean Equations and Ternary Vectors; 1.1.4. NP-Complete Problems; 1.1.5. Boolean Equations
- a Unifying Instrument; 1.2. Analysis of the Number of Variables to Represent Index Generation Functions; 1.2.1. Background; 1.2.2. An Index Generation Unit; 1.2.3. Notation
- 1.2.4. Expected Number of Variables in the Minimal Distinguishing Set1.2.5. Distribution of the Expected Number of Distinguishing Columns; 1.2.6. Expected Number of Balanced Columns in Random Binary Matrices; 1.2.7. Found Results; 1.3. Computational Complexity of Error Metrics in Approximate Computing; 1.3.1. Approximate Computing; 1.3.2. Preliminaries; 1.3.3. Error Metrics; 1.3.4. Complexity of Computing Error Metrics; 1.4. Spectral Techniques
- Origins and Applications; 1.4.1. Origins and Evolution of Spectral Techniques; 1.4.2. Digital System Design; 1.4.3. Signal processing
- 1.4.4. Towards FFT1.4.5. Towards Alternative Spectral Techniques; 1.4.6. Applications of Spectral Techniques; 1.5. A Relational Approach to Finite Topologies; 1.5.1. Experimentation as Motivation; 1.5.2. Relation Algebra; 1.5.3. Modeling Sets and Finite Topologies; 1.5.4. Closures, Interiors and Boundaries; 1.5.5. Topological Relations and Random Topologies; 1.5.6. Implementation and Related Work; 1.6. A Real-World Model of Partially Defined Logic; 1.6.1. Real-World Asynchronous Feedback; 1.6.2. Related Topics; 1.6.3. Use Case: Low-Active RS-Latch
- 1.6.4. Functionally Stabilized Dual-Rail Implementation1.6.5. Results; 2. Accelerated Computations; 2.1. Bent Function Enumeration by a Circular Pipeline Implemented on an FPGA; 2.1.1. Background; 2.1.2. Properties of Bent Functions; 2.1.3. Architecture for Bent Function Discovery; 2.1.4. Circular Pipeline Architecture; 2.1.5. Circuit of the Circular Pipeline; 2.1.6. Experimental Results; 2.1.7. Analytical Results; 2.1.8. Practical Aspects; 2.2. Efficient Random Generation of Bent Functions Using a GPU Platform; 2.2.1. Discovery of Bent Functions
- 2.2.2. Bent Functions in Reed-Muller and Walsh Domains2.2.3. Random Generation of Bent Functions in the Reed-Muller Domain; 2.2.4. Implementation of Random Generation of Bent Functions on a GPU Platform; 2.2.5. Comparison of Random Generation of Bent Functions on CPU and GPU Platforms; 2.3. Multi-GPU Approximation for Silent Data Corruption of AN Codes; 2.3.1. Error Detection and Correction; 2.3.2. Computing Distance Distribution of AN Codes; 2.3.3. Results; 2.3.4. Summary; 2.4. Orthogonalization of a TVL in Disjunctive or Conjunctive Form; 2.4.1. Orthogonality
