Share Email Print

Proceedings Paper

Recursive Transforms In Hybrid Processing
Author(s): H. S. Hou; Demetri Psaltis
Format Member Price Non-Member Price
PDF $14.40 $18.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

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.

Paper Details

Date Published: 15 October 1986
PDF: 9 pages
Proc. SPIE 0638, Hybrid Image Processing, (15 October 1986); doi: 10.1117/12.964278
Show Author Affiliations
H. S. Hou, The Aerospace Corporation (United States)
Demetri Psaltis, California Institute of Technology (United States)

Published in SPIE Proceedings Vol. 0638:
Hybrid Image Processing
David P. Casasent; Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top