نتایج جستجو برای: sub threshold circuits

تعداد نتایج: 384663  

In this paper, a Dual-Bit Parallel Adder (DBPA) based on minority function using Carbon-Nanotube Field-Effect Transistor (CNFET) is proposed. The possibility of having several threshold voltage (Vt) levels by CNFETs leading to wide use of them in designing of digital circuits. The main goal of designing proposed DBPA is to reduce critical path delay in adder circuits. The proposed design positi...

2006
Praveen Elakkumanan

Most microprocessors use large on-chip SRAM caches to bridge the performance gap between the processor and the main memory. Due to their growing embedded applications coupled with the technology scaling challenges, considerable attention is given to the design of low-power and high-performance SRAMs. However, there are many challenges in the design of both embedded and stand-alone SRAMs, such a...

Journal: :Chemical Communications 2021

The formation of ?-aromatic circuits along a grossly warped nanographene, C80H30, containing five- and seven-membered rings inserted into six-membered mesh, reveals global ?-circuits at the edge backbone.

2015
Hong Bo Hu Jianping Li Dongmei Han Chenghao

Domino logic circuits have faster operating speed than commonly used static logic ones, because they have lower input capacitances and no contention during transition. However, Domino logic circuits have more power dissipation than static logic ones, since their clock tress with high switch activity dissipates large energy. A low-power superthreshold computing scheme is proposed to reduce power...

Journal: :Inf. Process. Lett. 1991
Prabhakar Ragde Avi Wigderson

We present a simple explicit construction giving unbounded fan-in circuits with $o(n)$ gates and depth $O(r)$ for the threshold function of $n$ variables when the threshold is at most $(log n)^r$, for any integer $r>0$. This improves a result of Atjai and Ben-Or, who showed the existence of circuits of size $n^{O(1)}$. This is the highest threshold for which polynomial-size, constant-depth circ...

1991
Mikael Goldmann

We investigate the power of threshold circuits of small depth. In particular, we give functions that require exponential size unweighted threshold circuits of depth 3 when we restrict the bottom fanin. We also prove that there are monotone functions f k that can be computed in depth k and linear size ^; _-circuits but require exponential size to compute by a depth k ? 1 monotone weighted thresh...

2014
Tsung-Te Liu Jan M. Rabaey

Towards an Ultra-Low Energy Computation with Asynchronous Circuits by Tsung-Te Liu Doctor of Philosophy in Engineering Electrical Engineering and Computer Sciences University of California, Berkeley Professor Jan M. Rabaey, Chair Emerging biomedical applications would benefit from the availability of digital processors with substantially improved energy-efficiency. One approach to realize ultra...

2017
Alexander Golovnev Daniel Reichman Igor Shinkar

Detecting patterns in strings and images is a fundamental and widely studied problem. Motivated by the proliferation of specialized circuits in pattern recognition tasks, we study the circuit complexity of pattern matching under two popular choices of gates: De Morgan and threshold gates. For strings of length n and patterns of length log n k ≤ n− o(n), we prove super polynomial lower bounds fo...

2017
K.Lakshmi Narayana

The approach is based on a design of threshold logic gates (TLGs) and their seamless integration with conventional standard-cell design flow. We first describe a new robust, standard-cell library of configurable circuits for implementing threshold functions. Abstractly, the threshold gate behaves as a multi-input, single output, edge-triggered flip-flop, which computes a threshold function of t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید