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 54 for “"Arithmetic circuits"”.

  1. High-Performance, Energy-Efficient CMOS Arithmetic Circuits

    In a modern microprocessor, datapath/arithmetic circuits have always been an important building block in delivering high-performance, energy-efficient computing, because arithmetic operations such as addition and binary number comparison are two of the most commonly used computing instructions. …

    waterloo Repository record for High-Performance, Energy-Efficient CMOS Arithmetic Circuits (opens in a new tab)

  2. Design of Energy-Efficient Approximate Arithmetic Circuits

    … design challenges in integrated circuit design. Arithmetic computing circuits, in particular array-based arithmetic computing circuits such as adders, multipliers, squarers, have been widely used. In many cases, array-based arithmetic computing circuits consume a significant amount of energy in a …

    tamu Repository record for Design of Energy-Efficient Approximate Arithmetic Circuits (opens in a new tab)

  3. Compiling Passive SMC to Malicious: Beyond Arithmetic Circuits

    … with abort. Prior work concentrated on arithmetic circuits composed of addition and multiplication gates, while many practical protocols rely on additional types of elementary operations or gates to achieve good performance. In this work we revisit the notion of security up to additive …

    buffalo Repository record for Compiling Passive SMC to Malicious: Beyond Arithmetic Circuits (opens in a new tab)

  4. Integrated arithmetic circuits in the presence of variability

    … parameters, subjected to variations. Addition circuits are of particular importance due to their widespread usage, serving, among others, hardware implementations for neural networks, digital signal processing, and communication algorithms. Furthermore, they constitute building blocks for the …

    greece Repository record for Integrated arithmetic circuits in the presence of variability (opens in a new tab)

  5. A Study on Efficient Designs of Approximate Arithmetic Circuits

    … generation and partial product accumulation circuits. In this work, three multipliers (ABM-M1, ABM-M2, and ABM-M3) are proposed in which the modified Booth algorithm is approximated. In all three designs, approximate Booth partial product generators are designed with different variations of …

    sask Repository record for A Study on Efficient Designs of Approximate Arithmetic Circuits (opens in a new tab)

  6. Formal verification of arithmetic circuits using symbolic computer algebra

    Eine Welt ohne digitale Schaltungen ist heutzutage unvorstellbar, da sie tief in den verschiedenen Bereichen unseres Alltags integriert sind. Eine zentrale Komponente dieser Systeme bilden dabei arithmetische Schaltungen. Je nach Anwendungsbereich können Entwickler unterschiedliche Designziele …

    freiburg-diss Repository record for Formal verification of arithmetic circuits using symbolic computer algebra (opens in a new tab)

  7. Threshold logic based implementation of high performance VLSI arithmetic circuits

    … networks for the implementation of high speed arithmetic circuits. In this Thesis, the basics and previous work in threshold logic are reviewed, including theoretical results for TL based networks used in arithmetic and TL gate circuit design techniques. Novel floating gate based TL circuit …

    adelaide Repository record for Threshold logic based implementation of high performance VLSI arithmetic circuits (opens in a new tab)

  8. Improving the Hardware Performance of Arithmetic Circuits using Approximate Computing

    … is especially well-suited for application in arithmetic computing hardware. In this thesis, novel approximate arithmetic architectures are proposed for three different operations, namely multiplication, division, and the multiply accumulate (MAC) operation. For all designs, accuracy is …

    sask Repository record for Improving the Hardware Performance of Arithmetic Circuits using Approximate Computing (opens in a new tab)

  9. A design theory for totally self-checking and concurrent error detecting arithmetic circuits

    … of an investigation into the applicability of Arithmetic Decomposition Theory (a theory for the design and analysis of arithmetic structures) to the design of concurrent error detecting arithmetic structures. Arithmetic Decomposition Theory shows how large, complex arithmetic circuits can be …

    uiuc Repository record for A design theory for totally self-checking and concurrent error detecting arithmetic circuits (opens in a new tab)

  10. On The Design Of Low-Complexity High-Speed Arithmetic Circuits In Quantum-Dot Cellular Automata Nanotechnology

    … The obtained results for 15 MCNC benchmark circuits show that when the number of majority gates is the rst optimization priority, there is an average reduction of 45.3% in the number of gates and 15.1% in the number of levels. They also show that when the rst priority is the number of …

    wayne-thes Repository record for On The Design Of Low-Complexity High-Speed Arithmetic Circuits In Quantum-Dot Cellular Automata Nanotechnology (opens in a new tab)

  11. Distributed and Approximate Quantum Circuits for Noise Resilience and Security

    … computers struggle to solve efficiently. Quantum arithmetic circuits serve as essential building blocks among the quantum circuits necessary to implement quantum algorithms like quantum approximate optimization, Harrow–Hassidim–Lloyd (HHL), and quantum cryptanalysis. However, the Noisy …

    utk-theses Repository record for Distributed and Approximate Quantum Circuits for Noise Resilience and Security (opens in a new tab)

  12. New Techniques for Private Function Evaluation

    … first alternative general approach to universal circuits. In this framework, the task of hiding the circuit topology and securely evaluating its gates are addressed independently through two functionalities we call CTH (Circuit Topology Hiding) and PGE (Private Gate Evaluation). We instantiate …

    calgary Repository record for New Techniques for Private Function Evaluation (opens in a new tab)

  13. Establishing upward pass semantics and exploiting barren variables in arithmetic circuit inference

    Arithmetic Circuits (ACs) are deep learning probabilistic models that are compiled by eliminating every variable in a given Bayesian Network (BN). ACs have been empirically shown to be the state-of-the-art method for exact inference in discrete BNs. We introduce a special case of AC, called a p-AC, …

    regina Repository record for Establishing upward pass semantics and exploiting barren variables in arithmetic circuit inference (opens in a new tab)

  14. Multiple bit error correcting architectures over finite fields

    … techniques to mitigate multiple bit errors in GF arithmetic circuits. As GF arithmetic circuits such as multipliers constitute the complex and important functional unit of a crypto-processor, making them fault tolerant will improve the reliability of circuits that are employed in safety …

    oxford-brookes Repository record for Multiple bit error correcting architectures over finite fields (opens in a new tab) Download PDF for Multiple bit error correcting architectures over finite fields (opens in a new tab)

  15. Zero-Knowledge Proof-Enabled SAT Co-processor for Blockchain Systems

    … contexts. I implemented DPLL and Chaff as arithmetic circuits within Circom and analyze them based on constraint count, proving delay, and zk-SNARK verification layers. With this evaluation, the aim is to determine the feasibility of solvers integration into off-chain computation systems …

    waterloo Repository record for Zero-Knowledge Proof-Enabled SAT Co-processor for Blockchain Systems (opens in a new tab)

  16. Gigahertz-Range Multiplier Architectures Using MOS Current Mode Logic (MCML)

    … components of many computational intensive circuits such as real time signal processing and arithmetic systems. The increasing demand in speed for floating-point co-processors, graphic processing units, CDMA systems and DSP chips has shaped the need for high-speed multipliers. The focus of …

    vt Repository record for Gigahertz-Range Multiplier Architectures Using MOS Current Mode Logic (MCML) (opens in a new tab)

  17. Efficient Multiparty Computation from Lossy Threshold Encryption

    … protocol for the evaluation of boolean circuits that is secure against erasure-free one-sided active adaptive adversaries. As a building block of this protocol, a new cut-and-choose oblivious transfer protocol is designed. The fourth contribution is a new multiparty computation protocol …

    calgary Repository record for Efficient Multiparty Computation from Lossy Threshold Encryption (opens in a new tab)

  18. Timing behavior modeling and analysis for Hybrid Logic full adders in bulk CMOS and FinFET

    The full adders form a very important part of arithmetic circuits. The full adders are built either in C-CMOS logic style or Hybrid CMOS logic style. C-CMOS logic style is a conventional way to build circuits with a strict methodology of having a pull up and a pull down network. There is also the …

    ttu Repository record for Timing behavior modeling and analysis for Hybrid Logic full adders in bulk CMOS and FinFET (opens in a new tab)

Page 1 of 3