Share Email Print

Optical Engineering

Optical scalable parallel modified signed-digit algorithms for large-scale array addition and multiplication using digit-decomposition-plane representation
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Optical scalable parallel and high-speed 2D-data array computing based on modified signed-digit arithmetic and digit- decomposition-plane representation is presented. The digit- decomposition-plane coding uses m binary planes or m blocks of a binary plane to code an m-digit data array. Therefore, we can easily access each digit individually and can implement array addition with only 13 combinatorial logic formulas. A duplication-shifting-superimposition algorithm for digital array multiplication is proposed. The algorithm generates and records all the bitwise products in mn binary planes simultaneously, and then processes them based on a modified signed-digit (MSD) adder tree. Only five basic operations of bitwise product, duplication, shifting, masking and magnification are required for digital computing. The features of the proposed algorithm are that it requires no bistable devices, no decimal point, no sign, and no carry. The algorithm and its implementing scheme are scalable because they are independent to the sizes of data arrays. Therefore it has great promise for large- scale array computing. Optical implementation with classical optical elements, such as beamsplitters, parallel plates, and mirrors, is discussed. A preliminary demonstration experiment with an optoelectronic scheme is described.

Paper Details

Date Published: 1 March 1999
PDF: 9 pages
Opt. Eng. 38(3) doi: 10.1117/1.602119
Published in: Optical Engineering Volume 38, Issue 3
Show Author Affiliations
Hongxin Huang, Univ. of Tsukuba (Japan)
Masahide Itoh, Univ. of Tsukuba (Japan)
Toyohiko Yatagai, Univ. of Tsukuba (Japan)

© SPIE. Terms of Use
Back to Top