Share Email Print

Optical Engineering

High Speed Matrix Preprocessing On Analog Optical Associative Processors
Author(s): Anjan Ghosh; Palacharla Paparao
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

The accuracy of matrix computations performed on analog optical associative processors is limited by noise and spatial wavefront errors. Earlier studies show that the rate of convergence and accuracy of analog optical matrix data processing can be improved by lowering the condition number of the data matrix. In this paper, we describe a new preprocessing technique, the split-step polynomial preconditioning algorithm, that can reduce the condition number of a matrix efficiently. With a few additional steps, this algorithm can be used to calculate the inverse or to estimate the condition number of a matrix. A realization of this preprocessing algorithm on optical associative processors is considered, and its performance and complexity are analyzed. The results of numerical experiments on case studies with ill-conditioned matrices show that this new preprocessing algorithm is a practicable tool for improving the perfor-mance of analog optical processors. Preliminary analyses of the new preconditioning algorithm demonstrate its robustness with regard to the spatial errors and random noise present in most analog optical computing systems.

Paper Details

Date Published: 1 April 1989
PDF: 10 pages
Opt. Eng. 28(4) 284354 doi: 10.1117/12.7976962
Published in: Optical Engineering Volume 28, Issue 4
Show Author Affiliations
Anjan Ghosh, University of Iowa (United States)
Palacharla Paparao, University of Iowa (United States)

© SPIE. Terms of Use
Back to Top