A Fast Computer Method for Matrix Transposing

A method is given for transposition of 2n×2n data matrices, larger than available high-speed storage. The data should be stored on an external storage device, allowing direct access. The performance of the algorithm depends on the size of the main storage, which at least should hold 2n+1 points. In...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 1972-07, Vol.C-21 (7), p.801-803
Main Author: Eklundh, J.O.
Format: Article
Language:English
Subjects:
Externally stored matrices
fast Fourier transform
fast Hadamard transform
matrix transposition
two-dimensional transformations
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A method is given for transposition of 2n×2n data matrices, larger than available high-speed storage. The data should be stored on an external storage device, allowing direct access. The performance of the algorithm depends on the size of the main storage, which at least should hold 2n+1 points. In that case the matrix has to be read in and written out n times.
ISSN:0018-9340
1557-9956
DOI:10.1109/T-C.1972.223584