This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Fast Computer Method for Matrix Transposing
July 1972 (vol. 21 no. 7)
pp. 801-803
J.O. Eklundh, Research Institute of National Defence
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.
Index Terms:
Externally stored matrices, fast Fourier transform, fast Hadamard transform, matrix transposition, two-dimensional transformations.
Citation:
J.O. Eklundh, "A Fast Computer Method for Matrix Transposing," IEEE Transactions on Computers, vol. 21, no. 7, pp. 801-803, July 1972, doi:10.1109/T-C.1972.223584
Usage of this product signifies your acceptance of the Terms of Use.