Recursive Transforms In Hybrid Processing

H. S. Hou; Demetri Psaltis

doi:10.1117/12.964278

15 October 1986 Recursive Transforms In Hybrid Processing

H. S. Hou, Demetri Psaltis

Proceedings Volume 0638, Hybrid Image Processing; (1986) https://doi.org/10.1117/12.964278
Event: 1986 Technical Symposium Southeast, 1986, Orlando, United States

Abstract

This paper presents a unified analysis of a class of unitary transforms including the discrete Fourier, the Walsh Hadamard, the discrete Hartley, and the discrete cosine transforms. These transforms possess a common recursive property that allows us to obtain the next higher-order transform from two identical, preceding lower-order transforms. This recursive property eventually leads us to formulate a fast, efficient recursive algorithm for the discrete Hartley transform, from which the fast processing algorithm for the discrete cosine transform can also be obtained. Hybrid implementations using state-of-the-art integrated optics in digital format have also been proposed for such fast, efficient processing algorithms.

Citation Download Citation

H. S. Hou and Demetri Psaltis "Recursive Transforms In Hybrid Processing", Proc. SPIE 0638, Hybrid Image Processing, (15 October 1986); https://doi.org/10.1117/12.964278

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