Discrete Steepest Descent Algorithms And Their Realization On Optical Analog Processors

Eugene Pochapsky; David Casasent

doi:10.1117/12.948555

16 December 1989 Discrete Steepest Descent Algorithms And Their Realization On Optical Analog Processors

Eugene Pochapsky, David Casasent

Proceedings Volume 0977, Real-Time Signal Processing XI; (1989) https://doi.org/10.1117/12.948555
Event: 32nd Annual International Technical Symposium on Optical and Optoelectronic Applied Science and Engineering, 1988, San Diego, CA, United States

Abstract

We consider an analog (linear) heterodyned linear algebraic optical processor for adaptive phased array radar (APAR). Its use in solving the discrete steepest descent (DSD) algorithm is considered. New stability and performance measure expressions are used (that relate the scenario and the processor's accuracy) and their verification is obtained by scenario tests. Extensions to more complex problems by terminating the number of iterations and by matrix preconditioning are discussed and demonstrated.

Citation Download Citation

Eugene Pochapsky and David Casasent "Discrete Steepest Descent Algorithms And Their Realization On Optical Analog Processors", Proc. SPIE 0977, Real-Time Signal Processing XI, (16 December 1989); https://doi.org/10.1117/12.948555

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available