An O(n) Time-Complexity Matrix Transpose on Torus Array Processor

Matrix transpose is an essential operation in many applications like signal processing (ex. linear transforms) etc. and an efficient matrix transpose algorithm can speed up many applications. In this paper, we propose a new algorithm for n x n matrix transposition on array processors connected in to...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2011 Second International Conference on Networking and Computing s. 242 - 247
Hlavní autori: Ravankar, A. A., Sedukhin, S. G.
Médium: Konferenčný príspevok..
Jazyk:English
Japanese
Vydavateľské údaje: IEEE 01.11.2011
Predmet:
Arrays
Image sensors
Layout
matrix multiplication
Matrix transpose
permutation matrices
Registers
Routing
Sensors
Signal processing algorithms
torus array processors
ISBN:1457717964, 9781457717963
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Matrix transpose is an essential operation in many applications like signal processing (ex. linear transforms) etc. and an efficient matrix transpose algorithm can speed up many applications. In this paper, we propose a new algorithm for n x n matrix transposition on array processors connected in torus network. The algorithm has O(n) time complexity. The algorithm uses matrix-matrix multiply-add (MMA) operation for transposing the matrix. We show how to align data and give algorithm for generating permutation matrices. The entire n x n matrix transposition is carried out in 5n time-steps. This approach does not require any dedicated connections for matrix transposition. Both input and output matrices are in canonical (natural and not skewed) layout. We also discuss blocked matrix transposition.
ISBN:1457717964
9781457717963
DOI:10.1109/ICNC.2011.43