Publication

On Synthesis for Unbounded Bit-vector Arithmetic

Related publications (35)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Power-Performance Scalable Integrated Circuit Design Using Subthreshold MOS

Seyed Armin Tajalli

The potentials of subthreshold metal-oxide-semiconductor (MOS) solid-state devices for implementing widely adjustable performance integrated circuits with very low power consumption have been investigated. The main concentration of this work is developing ...

EPFL2010

Performance Analysis of 3-D Monolithic Integrated Circuits

Giovanni De Micheli, Vasileios Pavlidis, Shashi Kanth Bobba

3-D monolithic integration (3DMI), also termed as sequential integration, is a potential technology for future gigascale circuits. Since the device layers are processed in sequential order, the size of the vertical contacts is similar to traditional contac ...

2010

Expressiveness And Closure Properties For Quantitative Languages

Laurent Doyen

Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the ma ...

2010

Probabilistic Weighted Automata

Laurent Doyen

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages

L

that assign to each word

w

a real number

L(w)

. The value of an infinite word

w

is computed as the maximal value of al ...

2009

Improving the power-delay performance in subthreshold source-coupled logic circuits

Seyed Armin Tajalli, Yusuf Leblebici

Subthreshold source-coupled logic (STSCL) circuits can be used in design of low-voltage and ultra-low power digital systems. This article introduces and analyzes new techniques for implementing complex digital systems using STSCL gates with an improved pow ...

Springer2009

Improving the Power-Delay Performance in Subthreshold Source-Coupled Logic Circuits

Seyed Armin Tajalli, Yusuf Leblebici

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Pico-Watt Source-Coupled Logic Circuits

Seyed Armin Tajalli, Yusuf Leblebici

This article explores the main tradeoffs in design of subthreshold source-couple logic (STSCL) circuits. It is shown analytically that the bias current of each STSCL gate can be reduced to few pico-amperes with a reliable logic operation. Measurements on d ...

2008

Energy Efficiency Comparison of Asynchronous and Synchronous Circuits Operating in the Sub-Threshold Regime

Yusuf Leblebici, Omer Can Akgun

Digital circuits operating in the sub-threshold regime are able to perform minimum energy operation at a given delay. In the sub-threshold regime circuit delay, hence the leakage energy consumption depends on the supply voltage exponentially. By reducing t ...

2008

Automatic synthesis of compressor trees: Reevaluating large counters

Paolo Ienne, Ajay Kumar Verma

Despite the progress of the last decades in electronic design automation, arithmetic circuits have always received way less attention than other classes of digital circuits. Logic synthesisers, which play a fundamental role in design today, play a minor ro ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Motion Detection Circuits for a Time-To-Travel Algorithm

The paper describes a new motion detection circuit that extracts motion information based on a time-to-travel algorithm. The front-end photoreceptor adapts over 7 decades of background intensity and motion information can be extracted down to a contrast va ...

IEEE2007

Probabilistic Weighted Automata

Laurent Doyen

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages

L

that assign to each word

w

a real number

L(w)

. The value of an infinite word

w

is computed as the maximal value of al ...

2009