Share Email Print

Proceedings Paper

Synchronous And Asynchronous Algorithms For Matrix Transposition On MCAP
Author(s): Nasser G. Azari; Adam W. Bojanczyk; Soo-Young Lee
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Matrix transposition is one of the major tasks in image and signal processing and matrix decompositions. This paper presents algorithms for transposing a matrix on a mesh-connected array processor (MCAP). These algorithms make a very efficient use of the processing elements (PE's) in parallel. We discuss both synchronous and asynchronous algorithms. In the synchronized approach algorithms use a global clock to synchronize the communications between PE's. The number of time units required by synchronous algorithms for transposing an m x n matrix (n ≥ m) on an n x n MCAP is 2(n - 1). The synchronous algorithms eliminate simultaneous requests for using channels between PE's. Clock skews and delays are inevitable problems when we have a large array size (large n). An asynchronous (self-time) approach is proposed to circumvent this problem. The feasibility of the asynchronous algorithm have been demonstrated by the simulation of the algorithm for different sizes of matrices.

Paper Details

Date Published: 23 February 1988
PDF: 12 pages
Proc. SPIE 0975, Advanced Algorithms and Architectures for Signal Processing III, (23 February 1988); doi: 10.1117/12.948511
Show Author Affiliations
Nasser G. Azari, Cornell University (United States)
Adam W. Bojanczyk, Cornell University (United States)
Soo-Young Lee, Cornell University (United States)

Published in SPIE Proceedings Vol. 0975:
Advanced Algorithms and Architectures for Signal Processing III
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top