This Article 
 Bibliographic References 
 Add to: 
On Transposing Large 2nx 2nMatrices
January 1979 (vol. 28 no. 1)
pp. 72-75
M.B. Ari, Division of Computer Sciences, Department of Mathematical Sciences, Tel Aviv University
This correspondence presents two variations on the algorithm of Eklundh for transposing large 2n x 2n matrices. The first variation shows how the number of accesses to secondary storage may be reduced at the expense of an increased amount of data transferred. Formulas for I/O time are derived from which we deduce the disk characteristics under which there is an improvement. The second variation shows that a small amount of additional secondary storage can be used to greatly improve the performance of the algorithm.
Index Terms:
two-dimensional FFT, Digital image processing, externally stored matrices, large matrices, transportation algorithm
M.B. Ari, "On Transposing Large 2nx 2nMatrices," IEEE Transactions on Computers, vol. 28, no. 1, pp. 72-75, Jan. 1979, doi:10.1109/TC.1979.1675228
Usage of this product signifies your acceptance of the Terms of Use.