The Full Adder circuit is an important component in application such as Digital Signal Processing (DSP) architecture, microprocessor, and microcontroller and data processing units. This paper discusses the evolution of full adder circuits in terms of lesser power consumption, higher speed. Starting with the most conventional 28 transistor full adder and then gradually studied full adders consis...

In this paper we introduce the concept of weakly prime ternary subsemimodules of a ternary semimodule over a ternary semiring and obtain some characterizations of weakly prime ternary subsemimodules. We prove that if $N$ is a weakly prime subtractive ternary subsemimodule of a ternary $R$-semimodule $M$, then either $N$ is a prime ternary subsemimodule or $(N : M)(N : M)N = 0$. If $N$ is a $Q$-...

The ability of heparin to dramatically enhance the inactivation of thrombin (IIa) by antithrombin III (ATIII) in buffer is negated through formation of a IIa-fibrin-heparin ternary complex (Hogg and Jackson, Proc Natl Acad Sci USA 86:3619, 1989; Hogg and Jackson, J Biol Chem 265:241, 1990). IIa, in this ternary complex, is protected from inactivation by ATIII. Our aim was to determine whether f...

Conservative and reversible logic gates are widely known to be compatible with revolutionary computing paradigms such as optical and quantum computing. A fundamental conservative reversible logic gate is the Fredkin gate. This paper presents efficient adder circuits based on the Fredkin gate. Novel full adder circuits using Fredkin gates are proposed which have lower hardware complexity than th...

In this paper, five new multiplexer-based architectures for 1 -bit full adder circuit designs are proposed. Following these architectures, various full adder circuits can be built through different circuit implementations of multiplexers. For instance, in this paper, we demonstrate that by substituting each multiplexer with two transmission gates, a set of new full adder circuits are ready to b...

Parallel-prefix adders (also known as carrytree adders) are known to have the best performance in VLSI designs compared to that of conventional Ripple Carry Adder (RCA). However, each type of parallel prefix adder has its own pros and cons and are chosen according to the design requirement of the application. This paper investigates mainly two types of carry-tree adders, the brent kungg adder a...

Quantum addition circuits are considered being of two types: (1) Toffoli-adder which use only classical reversible gates (controlled-not and Toffoli), (2) QFT-adder based on the quantum Fourier transformation. We present a systematic translation QFT circuit into Toffoli-based adder. This result shows that has fundamentally same fault-tolerance cost (e.g., T count) as most cost-efficient Toffoli...

   Quantum-dot Cellular Automata (QCA) technology is a solution for implementation of the nanometer sized circuits and it can be a suitable replacement for CMOS. Similar to CMOS technology, designing the basic computational element such as adder with the QCA technology is regarded as one of the most important issues that extensive researches have been done about it. In this paper, a new eff...

We construct logical gates via topology optimisation (aimed to solve a station problem of heat conduction) of a conductive material layout. Values of logical variables are represented high and low values of a temperature at given sites. Logical functions are implemented via the formation of an optimum layout of conductive material between the sites with loading conditions. We implement and and ...

Reversible logic has extensive applications in quantum computing, it is a unconventional form of computing where the computational process is reversible, i.e., time-invertible. The main motivation behind the study of this technology is aimed at implementing reversible computing where they offer what is predicted to be the only potential way to improve the energy efficiency of computers beyond v...