Results 61 to 70 of about 257,484 (138)
A novel description and mathematical analysis of the Fractional Discrete Fourier Transform [PDF]
arXiv, 2019 I discuss the nature of a Fractional Discrete Fourier Transform (FrDFT) described algorithmically by a combination of chirp transforms and ordinary DFTs. The transform is shown to be consistent with a continuous two-dimensional rotation between the time and frequency domains.
arxiv
A RADIX-4/8/SPLIT RADIX FFT WITH REDUCED ARITHMETIC COMPLEXITY ALGORITHM [PDF]
ICTACT Journal on Communication Technology, 2012 In this paper we present alternate form of Radix-4/8 and split radix FFT’s based on DIF (decimation in frequency) version and discuss their implementation issues that further reduces the arithmetic complexity of power-of-two discrete Fourier Transform ...
Shaik Qadeer +2 more
doaj
The Modular DFT of the Symmetric Group [PDF]
We describe the discrete Fourier transform (DFT) for a cyclic group when $p|N$ by factoring $x^N-1$ over finite fields and constructing the Fourier transform and its inverse using B\'{e}zout's identity for polynomials. For the symmetric group, in the modular case when $p|n!$ we construct the Peirce decomposition using central primitive orthogonal ...
arxiv +1 more source
On companding techniques for PAPR reduction in DCT SC-FDMA system in the presence of CFOs
Alexandria Engineering Journal, 2023 In the single carrier frequency division multiple access (SC-FDMA) system, the use of discrete cosine transform (DCT) instead of discrete Fourier transform (DFT) has shown improved bit error rate (BER) performance.
Naim Ben Ali +5 more
doaj
Efficient and Secure Outsourcing of DFT, IDFT, and Circular Convolution
IEEE Access, 2019 Discrete Fourier transform (DFT), inverse DFT (IDFT), and circular convolution are important tools for analyzing and designing discrete signals and systems, and are widely used in various industries.
Xiangli Xiao +3 more
doaj +1 more source
An Orthogonal Discrete Auditory Transform [PDF]
arXiv, 2005 An orthogonal discrete auditory transform (ODAT) from sound signal to spectrum is constructed by combining the auditory spreading matrix of Schroeder et al and the time one map of a discrete nonlocal Schr\"odinger equation. Thanks to the dispersive smoothing property of the Schr\"odinger evolution, ODAT spectrum is smoother than that of the discrete ...
arxiv
Spectrum analysis of digital UPWM signals generated from random modulating signals
Scientific ReportsThis work studies the spectrum of discrete-time Uniform-sampling pulse width modulation (UPWM) signals originating from stochastic input signals. It demonstrates that for ergodic input sequences of independent and identically distributed random variables,
Konstantinos Kaleris +2 more
doaj +1 more source
An Invertible Discrete Auditory Transform [PDF]
arXiv, 2004 A discrete auditory transform (DAT) from sound signal to spectrum is presented and shown to be invertible in closed form. The transform preserves energy, and its spectrum is smoother than that of the discrete Fourier transform (DFT) consistent with human audition. DAT and DFT are compared in signal denoising tests with spectral thresholding method. The
arxiv
Low complexity precoding codebook design based on DFRST for limited feedback precoded OSTBC systems
EURASIP Journal on Wireless Communications and Networking, 2017 Precoding techniques can be used in multiple input multiple output (MIMO) system to assign resources such as power and information optimally. This paper is concerned with limited feedback in precoded orthogonal space time block code (OSTBC) systems ...
Han Hai +3 more
doaj +1 more source
A Heuristic Description of Fast Fourier Transform [PDF]
arXiv, 2011 Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of FFT and propose a new presentation.
arxiv