Learn More
We have developed an efficient algorithm for transposing large matrices in place. The algorithm is efficient because data are accessed either sequentially in blocks or randomly within blocks small enough to fit in cache, and because the same indexing calculations are shared among identical procedures operating on independent subsets of the data. This(More)
An attempt is made to transpose an arbitrary matrix when the total number of matrix elements is too large to store them all in random-access memory. This problem is often a computational bottleneck in large computed-imaging problems. A simple algorithm for obtaining the transposed matrix using only two read/write passes over the data is derived. This(More)
In this report, a two-dimensional Hilbert transform is derived. This Hilbert transform can be used to construct the imaginary part of the Fourier transform from the real part of the Fourier transform for arrays of a particular form. An approximation to this Hilbert transform, termed a discrete Hilbert transform (DHT), is then derived. This DHT can be(More)
69 Fourier transforms based on Gaussian analysis windows , ' ' in R cc.Time-frequency resolu-lion experiment in speech analysis and synthesis," .1. Acoust. [24] R. J. Wang, "Optimum window length for the measurement of time-varying power spectra," J. 25 ] G. Gambardella, "A contribution to the theory of short-time spectral analysis with nonuniform bandwidth(More)
  • 1