Results 251 to 260 of about 246,074 (294)
Some of the next articles are maybe not open access.
IEEE Transactions on Circuits and Systems I: Regular Papers, 2015
Real transforms require less complexity for computations and less memory for storages than complex transforms. However, discrete fractional Fourier and Hartley transforms are complex transforms. In this paper, we propose reality-preserving fractional versions of the discrete Fourier, Hartley, generalized Fourier, and generalized Hartley transforms. All
Wen-Liang Hsue, Wei-Ching Chang
openaire +1 more source
Real transforms require less complexity for computations and less memory for storages than complex transforms. However, discrete fractional Fourier and Hartley transforms are complex transforms. In this paper, we propose reality-preserving fractional versions of the discrete Fourier, Hartley, generalized Fourier, and generalized Hartley transforms. All
Wen-Liang Hsue, Wei-Ching Chang
openaire +1 more source
Signal Processing, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Britanak, Vladimir, Rao, K. R.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Britanak, Vladimir, Rao, K. R.
openaire +1 more source
Generalized Fourier-grid R-matrix theory; a discrete Fourier-Riccati-Bessel transform approach
Journal of Physics B: Atomic, Molecular and Optical Physics, 1993The authors present the latest developments in the Fourier-grid R-matrix theory of scattering. These developments are based on the generalized Fourier-grid formalism and use a new type of extended discrete Fourier transform: the discrete Fourier-Riccati-Bessel transform.
E G Layton, E Stade
openaire +1 more source
An algorithm for Morlet wavelet transform based on generalized discrete Fourier transform
International Journal of Wavelets, Multiresolution and Information Processing, 2019Continuous wavelet transform (CWT) is a linear convolution of signal and wavelet function for a fixed scale. This paper studies the algorithm of CWT with Morlet wavelet as mother wavelet by using nonzero-padded linear convolution. The time domain filter, which is a non-causal filter, is the sample of wavelet function.
Yi, Hua +3 more
openaire +1 more source
Symbolic network function generation via discrete Fourier transform
IEEE Transactions on Circuits and Systems, 1984Summary: A new method of symbolic network function generation is presented. The method is based upon the theory of the discrete Fourier transform and not restricted in its application to any particular type of network analysis or network configuration. It is particularly attractive when the number of symbolic variables to be handled is not large.
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
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
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
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 ...
D.J. Young, N.C. Beaulieu
openaire +1 more source
Generalized Discrete Fourier Transform Based Minimization of PAPR in OFDM Systems
2014 International Conference on Computer and Communication Engineering, 2014Orthogonal frequency division multiplexing OFDM is a preferred technique in digital communication systems due to its benefits of achieving high bit rates and its ability to resist multipath effect over fading channels. However, high peak to average power PAPR ratio of the OFDM transmitted signal is a main drawback in OFDM systems.
Ahmed Mohamed Elshirkasi +2 more
openaire +1 more source