Paper
23 March 1986 A Multilevel Pipelined Processor For The Singular Value Decomposition
Jaime H. Moreno, Tomas Lang
Author Affiliations +
Abstract
An evaluation of alternatives for the implementation of a processor for the Singular Value Decomposition (SVD) is presented. Cost and performance of implementations with replication (which includes linear systolic arrays) and pipelining are evaluated. The algorithm used is the parallel method proposed by Brent and Luk, which was adapted for fewer processors. It is shown that the most efficient implementation depends on the throughput required. For low throughput, the optimal architecture is replication (i.e. linear array) of a processor with one pipelined arithmetic unit (AU). However, a single pipelined processor is more efficient for higher throughput than what is achievable with such an array. The architecture devised is a multilevel pipelined system, which uses the local parallelism existing in subcomputations of the algorithm. The realization complexity of this scheme is similar to the linear systolic array, and computes the decomposition of matrices of any size without hardware modifications. The design is based on a systematic methodology which is applicable to multi-instance algorithms implemented with only one type of operation unit, where instances are divided into groups and dependences exist between corresponding instances in those groups. This methodology gives the most efficient solutions for different hardware costs.
© (1986) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jaime H. Moreno and Tomas Lang "A Multilevel Pipelined Processor For The Singular Value Decomposition", Proc. SPIE 0698, Real-Time Signal Processing IX, (23 March 1986); https://doi.org/10.1117/12.976251
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Signal processing

Gold

Logic

Computing systems

Matrices

Parallel computing

Data processing

RELATED CONTENT

Minimum strong radius of the strong product of paths
Proceedings of SPIE (March 28 2023)
High-Performance Parallel Processors
Proceedings of SPIE (December 08 1978)
Algorithms for data processing in FSCW systems
Proceedings of SPIE (December 28 2007)
Space-time complexity in optical computing
Proceedings of SPIE (December 27 1990)

Back to Top