๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Trinary signed-digit arithmetic using an efficient encoding scheme

โœ Scribed by W.Y Salim; M.S Alam; R.S Fyath; S.A Ali

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
121 KB
Volume
32
Category
Article
ISSN
0030-3992

No coin nor oath required. For personal study only.

โœฆ Synopsis

The trinary signed-digit (TSD) number system is of interest for ultrafast optoelectronic computing systems since it permits parallel carry-free addition and borrow-free subtraction of two arbitrary length numbers in constant time. In this paper, a simple coding scheme is proposed to encode the decimal number directly into the TSD form. The coding scheme enables one to perform parallel one-step TSD arithmetic operation. The proposed coding scheme uses only a 5-combination coding table instead of the 625-combination table reported recently for recoded TSD arithmetic technique.

๐Ÿ“œ SIMILAR VOLUMES

One-step optical trinary signed-digit ar
One-step optical trinary signed-digit arithmetic using redundant bit representations
โœ A.K. Cherri; N.I. Khachab; E.H. Ismail ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 918 KB

A simple one-step fully parallel trinary signed-digit arithmetic is proposed for parallel optical computing. This technique performs multidigit carry-free addition and borrow-free subtraction in constant time. The trinary signed-digit arithmetic operations are based on redundant bit representation o

Optical implementation of an efficient m
Optical implementation of an efficient modified signed-digit trinary addition
โœ M.M. Hossain; J.U. Ahmed; A.A.S. Awwal; H.E. Michel ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 231 KB

Ecient parallel schemes for carry-propagation-free addition of modiยฎed signed-digit trinary numbers are presented. The necessary minterms for implementation using an optical programmable logic array area are derived. The proposed schemes require only a truth table of 25 entries compared with an earl