Results 241 to 250 of about 11,957,855 (289)

A generalization of the discrete fourier transform

Integral Transforms and Special Functions, 1995
In [2] we have considered a class of integral transforms which generalizs the classical Fourier tranform. We are able now to define a class of discrete tranformations which can be considered as a generalization of the discrete Fourier transform. Furthermore, when our result is considered in connnection with the particular kernel associated with th ...
Carlo Belingeri, Paolo Emilio Ricci
openaire   +1 more source

Generalized Discrete Fourier Transform with optimum correlations

2010 IEEE International Conference on Acoustics, Speech and Signal Processing, 2010
In this paper, we present design methods to optimize nonlinear phase functions of Generalized DFT (GDFT) for minimized auto and cross correlations. It is shown that GDFT offers sizable correlation improvements over DFT, Walsh, and Gold codes. We conclude the paper with a multiuser communications scenario where correlation optimized GDFT outperforms DFT
Ali N. Akansu, Handan Agirman-Tosun
openaire   +1 more source

The generalized discrete fractional fourier transforms

IEEE International Conference on Acoustics Speech and Signal Processing, 2002
In this paper, we develop the generalized discrete fractional Fourier transform (GDFRFT) by factorizing the generalized discrete Fourier transform (GDFT) matrix. Specifically, the eigenvalues and eigenvectors are presented and then used to define the GDFRFT.
openaire   +3 more sources

Generating matrix of discrete Fourier transform eigenvectors

2009 IEEE International Conference on Acoustics, Speech and Signal Processing, 2009
This paper provides a novel method to obtain the eigenvectors of discrete Fourier transform (DFT), which are accurate approximations to the continuous Hermite-Gaussian functions (HGFs). The proposed method uses a generating matrix and an initial eigenvector.
Soo-Chang Pei, Kuo-Wei Chang
openaire   +1 more source

Automatic generation of customized discrete fourier transform IPs

Proceedings of the 42nd annual conference on Design automation - DAC '05, 2005
This paper presents a parameterized soft core generator for the discrete Fourier transform (DFT). Reusable IPs of digital signal processing (DSP) kernels are important time-saving resources in DSP hardware development. Unfortunately, reusable IPs, however optimized, could introduce inefficiencies because they cannot fit the exact requirements of every ...
Grace Nordin, Peter A. Milder, James C. Hoe, Markus Püschel   +3 more
openaire   +1 more source

The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation

Signal Processing, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vladimir Britanak, Kamisetty Ramamohan Rao   +1 more
openaire   +2 more sources

An algorithm for Morlet wavelet transform based on generalized discrete Fourier transform

International Journal of Wavelets, Multiresolution and Information Processing, 2019
Continuous 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.
Hua Yi, Peichang Ouyang, Tao Yu 0003, Tao Zhang   +3 more
openaire   +1 more source

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

IEEE 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, Michael G. Strintzis
openaire   +1 more source

Real Discrete Fractional Fourier, Hartley, Generalized Fourier and Generalized Hartley Transforms With Many Parameters

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   +2 more sources

One-dimensional and two-dimensional generalised discrete fourier transforms

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
One-dimensional and two-dimensional generalized discrete Fourier transforms (GFT) are introduced. If a one.dimensional vector A is fractured into a two-dimensional matrix B, a one-dimensional GFT on A and a two-dimensional GFT on B give the same result and require the same number of operations to be computed. The result holds also for the DFT, as it is
BONGIOVANNI, Giancarlo, CORSINI P, FROSINI G.   +2 more
openaire   +2 more sources