نتایج جستجو برای: circuit analysis computing

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

2015
Arun Jana Nabarun Bhattacharyya Rajib Bandyopadhyay Bipan Tudu Subhankar Mukherjee Devdulal Ghosh Jayanta Kumar Roy

This article describes about an instrument and method for aroma based quality detection of Basmati and other aromatic rice varieties. It comprises few modules such as odour delivery module, sniffing module, water bath module and computing module. Odour handling module helps to deliver odour to the sensor array; a sniffing unit comprising a sensor array module that includes a eight number of met...

Design and construction of a stable current supply with protection circuits are described. The reported circuit provides a high-stable and high-level current variable from 0.5-1.2 A with the protect ion circuits to prevent over load current, voltage and off-range temperature operation. A detailed analysis of the circuit parameters is given and the time behaviors of the load voltage/current and ...

2014
Shefali Mamataj Biswajit Das Dibya Saha Min-Lun Chuang Chun-Yao Wang Masashi Ueda

In recent years, reversible logic has emerged as a promising computing paradigm showing its applications in various fields like low power computing, quantum computing, nanotechnology, optical computing and DNA computing. This paper proposes different sequential circuit elements of reversible gates and its application in the designing of different weighted counters. These synchronous reversible ...

Recently, fog computing has been introducedto solve the challenges of cloud computing regarding Internet objects. One of the challenges in the field of fog computing is the scheduling of tasks requested by Internet objects. In this study, a review of articles related to task scheduling in fog computing has been done. At first, the research questions and goals will be introduced, an...

Adders, as one of the major components of digital computing systems, have a strong influence on their performance. There are various types of adders, each of which uses a different algorithm to do addition with a certain delay. In addition to low computational delay, minimizing power consumption is also a main priority in adder circuit design. In this paper, the proposed adder is divided into s...

Journal: :IEE Proceedings A Physical Science, Measurement and Instrumentation, Management and Education, Reviews 1983

Journal: :Nanotechnology 2013
Giacomo Indiveri Bernabé Linares-Barranco Robert A. Legenstein George Deligeorgis Themistoklis Prodromakis

Conventional neuro-computing architectures and artificial neural networks have often been developed with no or loose connections to neuroscience. As a consequence, they have largely ignored key features of biological neural processing systems, such as their extremely low-power consumption features or their ability to carry out robust and efficient computation using massively parallel arrays of ...

2014
Santanu Santra Utpal Roy

The most important mathematical operation for any computing system is addition. An efficient adder can be of greater assistance in designing of any arithmetic circuits. Quantum-dot Cellular Automata (QCA) is a promising nanotechnology to create electronic circuits for computing devices and suitable candidate for next generation of computing systems. The article presents a modest approach to imp...

2015
D D Prasad

Reversible Logic Plays a very important role in research fields like quantum computing, optical computing, nanotechnology, low power computing and DNA computing. Reversibility has become the most promising technology in digital circuit design to reduce energy loss. This problem of energy loss can be solving by using reversible circuits where conventional logic has failed. Reversible circuits co...

2013
Sébastien Tavenas

Koiran [8] showed that if an n-variate polynomial fn of degree d (with d = n) is computed by a circuit of size s, then it is also computed by a homogeneous circuit of depth four and of size 2 √ d log(n) . Using this result, Gupta, Kamath, Kayal and Saptharishi [7] found an upper bound for the size of a depth three circuit computing fn. We improve here Koiran’s bound. Indeed, we show that it is ...

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

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