Results 251 to 260 of about 11,957,855 (289)
Some of the next articles are maybe not open access.
On the generation of correlated Rayleigh random variates by inverse discrete Fourier transform
Proceedings of ICUPC - 5th International Conference on Universal Personal Communications, 2000Digital computer simulation is widely used to design and develop wireless transmission systems and the components of wireless transmission systems. System performance such as coverage and outage are also frequently assessed by computer simulation. The fading caused by multipath propagation in wireless systems is accurately modeled in some practical ...
David J. Young, Norman C. Beaulieu
openaire +1 more source
Generalized discrete Fourier transform: Theory and design methods
2009 IEEE Sarnoff Symposium, 2009Constant amplitude transforms like discrete Fourier transform (DFT), Walsh transform, nonlinear phase Walsh-like transforms and Gold codes have been successfully used in many wire-line and wireless communications technologies including code division multiple access (CDMA), discrete multi-tone (DMT), and orthogonal frequency division multiplexing (OFDM)
Ali N. Akansu, Handan Agirman-Tosun
openaire +1 more source
Complex symmetric functions and generalized discrete Fourier transform
Rendiconti del Circolo Matematico di Palermo, 1996Let \(\Omega^{[k]}\) be the class of holomorphic functions \(f(z)\) of the complex variable \(z\) which satisfy, with respect to the \(s\)th root of unity \(\varepsilon_k\), \(k=0,1,\dots,n-1\), the symmetry property \(f(\varepsilon_1z)=\varepsilon_kf(z)\).
Rinaldi, Lucia, Ricci, Paolo Emilio
openaire +2 more sources
The generalized discrete Fourier transform in rings of algebraic integers
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1980The 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 ...
Dubois, Eric +1 more
openaire +2 more sources
Discrete Fourier transform in arbitrary dimensions by a generalized Beevers–Lipson algorithm
Acta Crystallographica Section A Foundations of Crystallography, 2000The Beevers-Lipson procedure was developed as an economical evaluation of Fourier maps in two- and three-dimensional space. Straightforward generalization of this procedure towards a transformation in n-dimensional space would lead to n nested loops over the n coordinates, respectively, and different computer code is required for each dimension.
, Schneider, , van Smaalen S
openaire +2 more sources
Mathematical background for generalized, partial, and incomplete discrete Fourier transforms
ICASSP '80. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005We develop the theory of generalized discrete Fourier transforms (GDFTs) from the point of view of the Chinese Remainder Theorem (CRT). We give a new definition of GDFT, and apply it to the construction of multidimensional convolution algorithms which require significantly fewer multiplications and data transfer operations than the usual methods.
openaire +2 more sources
Fast Discrete Fourier Transform on Generalized Sparse Grids
2014In this paper, we present an algorithm for trigonometric interpolation of multivariate functions on generalized sparse grids and study its application for the approximation of functions in periodic Sobolev spaces of dominating mixed smoothness. In particular, we derive estimates for the error and the cost. We construct interpolants with a computational
Michael Griebel, Jan Hamaekers
openaire +1 more source
Evaluation of two-dimensional discrete Fourier transforms via generalized FFT algorithms
ICASSP '81. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005In this paper two-dimensional fast Fourier transforms (FFT's) are expressed as special cases of a generalization of the one-dimensional Cooley-Tukey algorithm. This generalized algorithm allows the efficient evaluation of discrete Fourier transforms (DFT's) of rectangularly sampled sequences, hexagonally sampled sequences and arbitrary periodically ...
Theresa C. Speake, Russell M. Mersereau
openaire +2 more sources
A power-aware IP core generator for the one-dimensional discrete Fourier transform
2004 IEEE International Symposium on Circuits and Systems (ISCAS), 2004This paper presents a power-aware IP core generator for the 1D DFT design. We optimize the proposed DFT IP design both in algorithm and architecture levels for achieving low hardware complexity. In algorithm level, we first use radix-2/sup c/ algorithm to split a length-N DFT into multiple length-N/2/sup c/ DFTs for facilitating computation sharing ...
Chih-Da Chien +3 more
openaire +2 more sources
On an application of a generalization of the discrete Fourier transform to short time series
Canadian Journal of Physics, 2001A generalization of the discrete Fourier transform (DFT) is discussed. This generalization or GDFT provides a smooth interpolation between the points of the DFT. The GDFT of a sinusoidal function in a finite time window is (a) described in detail and (b) shown to coincide (aside from a simple scaling constant) with the corresponding Fourier transform,
openaire +1 more source