Applicability of Partial Ternary Full Adder in Ternary Arithmetic Units

02/17/2019
by   Aida Ghorbani Asibelagh, et al.
0

This paper explores whether or not a complete ternary full adder, whose input variables can independently be '0', '1', or '2', is indispensable in the arithmetic blocks of adder, subtractor, and multiplier. Our investigations show that none of the mentioned arithmetic units require a complete ternary full adder. Instead, they can be designed by use of partial ternary full adder, whose input carry never becomes '2'. Furthermore, some new ternary compressors are proposed in this paper without the requirement of complete ternary full adder. The usage of partial ternary full adder can help circuit designers to simplify their designs, especially in transistor level.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/24/2020

On the Expressiveness of Büchi Arithmetic

We show that the existential fragment of Büchi arithmetic is strictly le...
research
06/02/2020

Neural Power Units

Conventional Neural Networks can approximate simple arithmetic operation...
research
06/03/2022

Comprehensive Survey of Ternary Full Adders: Statistics, Corrections, and Assessments

The history of ternary adders goes back to more than six decades ago. Si...
research
04/27/2017

An Efficient Reconfigurable FIR Digital Filter Using Modified Distribute Arithmetic Technique

This paper provides modified Distributed Arithmetic based technique to c...
research
01/23/2021

A Primer for Neural Arithmetic Logic Modules

Neural Arithmetic Logic Modules have become a growing area of interest, ...
research
11/18/2019

Semi-Automatic Task Graph Construction for ℋ-Matrix Arithmetic

A new method to construct task graphs for -matrix arithmetic is introduc...
research
03/07/2023

Word-Level Structure Identification In FPGA Designs Using Cell Proximity Information

Reverse engineering of FPGA based designs from the flattened LUT level n...

Please sign up or login with your details

Forgot password? Click here to reset