Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Modified signed digit arithmetic using an efficient symbolic substitution

Not Accessible

Your library or personal account may give you access

Abstract

We have extended the scheme of Li and Eichmann1 by introducing an additional input bit (referred to as a flag) with each pair of input bits so that the nth additional bit is a characteristic of the (n – 1)th pair of input bits. This modified scheme is found to make the implementation of modified signed digit operations even more practical. A content-addressable memory is used for the optical implementation of the modified scheme. It is shown that only up to nine reference holograms are needed for each output bit. The proposed scheme is, therefore, a significant improvement over that devised by Mirsalehi and Gaylord.2 Furthermore, only 4 bits (3 bits plus a reference bit) are needed in the template, whereas the template used by Li and Eichmann1 requires a total of 5 bits. The resulting improvement of the proposed scheme thus amounts to increasing the page density of the input.

© 1988 Optical Society of America

PDF Article
More Like This
Efficient modified signed-digit arithmetic using optical symbolic substitution

Jamal U. Ahmed, Abdul A. S. Awwal, and Abdullah K. Cherri
MZZ.4 OSA Annual Meeting (FIO) 1993

Arithmetic processing using higher-order modified signed-digit symbolic substitution

M. S. Alam, A. A. S. Awwal, and M. A. Karim
FPP5 OSA Annual Meeting (FIO) 1992

Conditional higher-order modified signed-digit symbolic substitution using trinary arithmetic

M. S. Alam, M. A. Karim, A. A. S. Awwal, and J. J. Westerkamp
FDD5 OSA Annual Meeting (FIO) 1991

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.