Results 1 to 10 of about 2,401,712 (281)
Generalized Discrete Fourier Transform With Nonlinear Phase [PDF]
Constant modulus transforms like discrete Fourier transform (DFT), Walsh transform, and Gold codes have been successfully used over several decades in several engineering applications, including discrete multi-tone (DMT), orthogonal frequency division multiplexing (OFDM) and code division multiple access (CDMA) communications systems. In this paper, we
Ali Akansu
exaly +3 more sources
Generalized Discrete Fourier Transform for FBMC Peak to Average Power Ratio Reduction [PDF]
Filter bank multicarrier (FBMC) is a strong candidate as a waveform based technique in advanced wireless communication systems (e.g. 5G), as an alternative to orthogonal frequency division multiplexing (OFDM). Like all multicarrier modulation techniques,
Mohamed A. Aboul-Dahab +2 more
doaj +3 more sources
Two relations for generalized discrete Fourier transform coefficients [PDF]
D. Spałek
doaj +2 more sources
Time invariant property of weighted circular convolution and its application to continuous wavelet transform [PDF]
Time invariant linear operators are the building blocks of signal processing. Weighted circular convolution and signal processing framework in a generalized Fourier domain are introduced by Jorge Martinez.
Hua Yi, Yu-Le Ru, Yin-Yun Dai
doaj +1 more source
Generalized Orthogonal Discrete W Transform and Its Fast Algorithm
Based on the generalized discrete Fourier transform, the generalized orthogonal discrete W transform and its fast algorithm are proposed and derived in this paper. The orthogonal discrete W transform proposed by Zhongde Wang has only four types. However,
Jichao Sun, Zhengping Zhang
doaj +1 more source
In this paper, we use Frame Theory to develop a generalized OCT image reconstruction method using redundant and non-uniformly spaced frequency domain samples that includes using non-redundant and uniformly spaced samples as special cases. We also correct
Karim Nagib +4 more
doaj +1 more source
Fast and direct inversion methods for the multivariate nonequispaced fast Fourier transform
The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various applications such as MRI
Melanie Kircheis, Daniel Potts
doaj +1 more source
Multi-parameter m-complementary Golay sequences and transforms [PDF]
In this paper, we develop the family of Golay–Rudin–Shapiro (GRS) m-complementary many-parameter sequences and many-parameter Golay transforms. The approach is based on a new generalized iteration generating construction, associated with n unitary many ...
Valeri Labunets +3 more
doaj +1 more source
Short vector code generation for the discrete Fourier transform [PDF]
In this paper we use a mathematical approach to automatically generate high performance short vector code for the discrete Fourier transform (DFT). We represent the well-known Cooley-Tukey fast Fourier transform in a mathematical notation and formally derive a "short vector variant".
Franz Franchetti, Markus Püschel
openaire +1 more source
On the Duality of Discrete and Periodic Functions
Although versions of Poisson’s Summation Formula (PSF) have already been studied extensively, there seems to be no theorem that relates discretization to periodization and periodization to discretization in a simple manner.
Jens V. Fischer
doaj +1 more source

