Ultra-Low Voltage Subthreshold Binary Adder Architectures for IoT Applications: Ripple Carry Adder or Kogge Stone Adder

Zadeh, Somayeh Hossein; Ytterdal, Trond; Aunet, Snorre

doi:10.1109/norchip.2019.8906917

Cited by 5 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The RCA is the simplest adder with the lowest power, area, and design time suitable for various ultra-low-power IoT (Internet of Things) applications such as implantable biomedical devices, RADAR system, linear convolution, Harr transformation, and fast Fourier transformation [19][20][21][22]. Moreover, it is usually used to design a hybrid adder with other faster adders such as the Carry Lookahead Adder (CLA) and Kogge Stone Adder (KSA).…”

Section: Introductionmentioning

confidence: 99%

“…A single adder cannot optimally operate to improve the speed, area, leakage current, overall power dissipation, and the design time because there is a trade-off among various adders [23,24]. Although the CLA or the KSA are used for higher speeds, the power consumption, the energy dissipation, and the area consumption for the RCA are far lower than those at the same speed [20]. Nevertheless, the RCA is slower than the CLA or the KSA because of solving the carry propagation problem.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Quantum Modular Adder over GF(2n − 1) without Saving the Final Carry

et al. 2021

View full text Add to dashboard Cite

Addition is the most basic operation of computing based on a bit system. There are various addition algorithms considering multiple number systems and hardware, and studies for a more efficient addition are still ongoing. Quantum computing based on qubits as the information unit asks for the design of a new addition because it is, physically, wholly different from the existing frequency-based computing in which the minimum information unit is a bit. In this paper, we propose an efficient quantum circuit of modular addition, which reduces the number of gates and the depth. The proposed modular addition is for the Galois Field GF(2n−1), which is important as a finite field basis in various domains, such as cryptography. Its design principle was from the ripple carry addition (RCA) algorithm, which is the most widely used in existing computers. However, unlike conventional RCA, the storage of the final carry is not needed due to modifying existing diminished-1 modulo 2n−1 adders. Our proposed adder can produce modulo sum within the range 0,2n−2 by fewer qubits and less depth. For comparison, we analyzed the proposed quantum addition circuit over GF(2n−1) and the previous quantum modular addition circuit for the performance of the number of qubits, the number of gates, and the depth, and simulated it with IBM’s simulator ProjectQ.

show abstract

Section: Introductionmentioning

confidence: 99%