Arithmetic with binary-encoded balanced ternary numbers

@article{Parhami2013ArithmeticWB,
  title={Arithmetic with binary-encoded balanced ternary numbers},
  author={Behrooz Parhami and Michael McKeown},
  journal={2013 Asilomar Conference on Signals, Systems and Computers},
  year={2013},
  pages={1130-1133}
}
  • B. ParhamiMichael McKeown
  • Published 1 November 2013
  • Computer Science
  • 2013 Asilomar Conference on Signals, Systems and Computers
Ternary number representation and arithmetic, based on the radix-3 digit set {-1, 0, ;1}, has been studied at various times in the history of digital computing. Some such studies concluded that we should abandon ternary in favor of binary computation. Others, demonstrated promise and potential advantages, but, for various reasons, including inertia, did not lead to widespread use. By proposing an efficient binary encoding for balanced ternary numbers, along with the corresponding arithmetic… 

Figures from this paper

Title Truncated ternary multipliers Permalink

An additional advantage is shown: that of lower-error truncated multiplication with the same relative cost reduction as in truncated binary multipliers.

Truncated ternary multipliers

  • B. Parhami
  • Computer Science
    IET Comput. Digit. Tech.
  • 2015
An additional advantage is shown: that of lower-error truncated multiplication with the same relative cost reduction as in truncated binary multipliers.

Applicability of Partial Ternary Full Adder in Ternary Arithmetic Units

Investigations show that none of the mentioned arithmetic units require a complete ternary full adder, and instead, they can be designed by use of partial ternARY fullAdder, whose input carry never becomes '2'.

A programmable ternary CPU using hybrid CMOS/memristor circuits

An implementation of a general purpose CPU using signed-digit arithmetic by exploiting memristors in order to implement multi-value registers is proposed and it is shown that a break-even point exists at which signed- digit algorithms outperform conventional binary arithmetic operations.

On-line Digit Set Conversion for Rational Digit Number

This paper proposes a rational digit number system which is composed of rational signed-digits in the digit set and shows that this new system preserves a roundto-nearest property and is suitable for an on-line arithmetic computation.

Fast and energy-efficient FPGA realization of RNS reverse converter for the ternary 3-moduli set {3n–2, 3n–1, 3n}

The proposed algorithm reduces the number of adders with large bit-width and the dependencies between consecutively process blocks, and the reverse converter architecture improves the delay and area on the FPGA Virtex Ultrascale + family platform in 14 nm/16 nm FinFET technology as compared to the related works.

Partial Ternary Full Adder versus Complete Ternary Full Adder

Investigations show that none of these arithmetic units require a complete ternary full adder, and they can be designed by means of partial ternaries full adders, whose input carry never becomes ‘2’.

N-digits Ternary Carry Lookahead Adder Design

Two design approaches for N-digits ternary logic CLA based on K-map and threshold logic methods are proposed in addtion to their realization using CNTFETs only and memristor with CNTFets.

Balanced Number System

The article explores the application of binary and ternary number systems to three classical mathematical puzzles–weight problem of Bachet de Méziriac, binary numbers magic trick, and the detection

References

SHOWING 1-10 OF 21 REFERENCES

Ternary arithmetic unit

A ternary arithmetic unit is proposed which is based on the ternary symmetric number representation using digit +1, 0, −1. The advantages of this number representation are given in detail.

Optical binary coded ternary arithmetic and logic.

Using the two-port Sagnac interferometric switches, optical implementations of various BCT arithmetic and logic operations are described, and BCT full addition algorithms are given.

Efficient realisation of arithmetic algorithms with weighted collection of posibits and negabits

WBS and IEN are promoted as new design concepts for designers of computer arithmetic circuits and a modulo-2 n + 1 multiplier is presented, where partial products are represented in WBS with IEN and it is shown that by using standard reduction cells, partial products can be reduced to two.

Brousentsov's Ternary Principle, Bergman's Number System and Ternary Mirror-symmetrical Arithmetic

The main engineering result is a development of an original matrix and pipeline ternary mirror-symmetrical adder which can be used for fast ‘pipeline’ addition and multiplication in digital signal processors.

Area-time efficient sign detection technique for binary signed-digit number system

An area-time efficient method for sign detection in a BSD number system based on optimized reverse tree structure is proposed, which is superior to both area and time costs in VLSI.

A survey of hardware designs for decimal arithmetic

An overview of DFP arithmetic in IEEE 754-2008 is given, processors that provide hardware and instruction set support for decimal arithmetic are described, and a survey of hardware designs for decimal addition, subtraction, multiplication, and division is provided.

A Balanced Ternary Multiplication Circuit Using Recharged Semi-Floating Gate Devices

This paper presents a multiplier circuit using balanced ternary (BT) notation, which can multiply both negative and positive numbers, and takes advantage of carry free multiplication, which is exploited in designing a fast multiplier circuit.

A Novel Balanced Ternary Adder Using Recharged Semi-Floating Gate Devices

  • H. GundersenY. Berg
  • Engineering, Computer Science
    36th International Symposium on Multiple-Valued Logic (ISMVL'06)
  • 2006
This paper presents a novel voltage mode Balanced Ternary Adder (BTA), implemented with Recharged Semi- Floating Gate Devices. By using balanced ternary notation, it possible to take advantage of

The ternary calculating machine of Thomas Fowler

  • M. Glusker
  • Materials Science
    IEEE Annals of the History of Computing
  • 2005
A research project begun in 1997, uncovered sufficient information to enable the recreation of a physical concept model of Fowler's machine, and the next step is to create a historically accurate replica.