Results 241 to 250 of about 288,603 (325)

General in-place calculation of discrete Fourier transforms of multidimensional sequences

open access: closedIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
The computation of the discrete Fourier transform (DFT) of real multidimensional sequences requires an extraordinary amount of computer memory. The in-place calculation of the discrete Fourier transform reduces the required memory and is thus highly desirable.
Ioannis Pitas, M.G. Strintzis
openalex   +2 more sources

The generalized discrete Fourier transform in rings of algebraic integers

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
The discrete Fourier transform (DFT) in rings of residues of algebraic integers is investigated and some new transforms of low bit-operation complexity are introduced. For a given candidate transform with a DFT structure defined in a ring of residues of algebraic integers conditions are formulated which assure that this transform is a generalized DFT ...
E. Dubois, A. Venetsanopoulos
semanticscholar   +3 more sources

Home - About - Disclaimer - Privacy