Share Email Print

Proceedings Paper

Hypercube Architecture For Singular Value Decomposition And Other Fast Transforms
Author(s): H. S. Hou
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The hypercube architecture is a form of concurrent processing that uses many tightly coupled processors connected in an N-dimensional cube. It can be a multiple-instruction or a single-instruction and multiple-data machine. Using a three-dimensional cube as an example for visual convenience, this paper describes the algorithms for performing the singular value decomposition (SVD), the fast Fourier transform (FFT), the fast Hartley transform (FHT), and the cosine transform on this 3-D cube architecture. Because these algorithms when implemented on a hypercube require only the nearest neighborhood communications, not only is the communication overhead greatly reduced, but the architecture becomes modular. An additional advantage is the programming flexibility. This paper demonstrates that the same hypercube configuration can be used to process such algorithms as SVD, FFT, FHT, and cosine transforms.

Paper Details

Date Published: 19 February 1988
PDF: 7 pages
Proc. SPIE 0848, Intelligent Robots and Computer Vision VI, (19 February 1988); doi: 10.1117/12.942804
Show Author Affiliations
H. S. Hou, The Aerospace Corporation (United States)

Published in SPIE Proceedings Vol. 0848:
Intelligent Robots and Computer Vision VI
David P. Casasent; Ernest L. Hall, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?