An Extension of Eklundh's Matrix Transposition Algorithm and Its Application in Digital Image Processing
Twogood, Ekstrom · IEEE Transactions on Computers · 1976
Eklundh's fast matrix transposition algorithm for transposing a 2nX 2nmatrix is extended here to the general case where 2i( j ≥ 1) of its rows will fit into primary storage. The perpormance characteristics of the extension are described and subsuquently compared with those of Eklundh, and its use in a two-dimensional image filtering routine is described.