On the computational complexity of the general discrete fourier transform
Theoretical Computer Science, 1987 The complexity of computing the General Discrete Fourier Transform over group algebras of finite groups is studied. Starting with a short introduction to known results, the complexity gains of a new algorithm derived from Clifford's theorem are discussed.
Thomas Beth
openalex +3 more sources
Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization [PDF]
Journal of Mathematical Physics, 2003 A versatile method is described for the practical computation of the discrete Fourier transforms (DFT) of a continuous function $g(t)$ given by its values $g_{j}$ at the points of a uniform grid $F_{N}$ generated by conjugacy classes of elements of ...
A. Atoyan +15 more
core +2 more sources
A general construction of Reed-Solomon codes based on generalized discrete Fourier transform [PDF]
Algebraic structures and their applications, 2019 Najme Sahami, Majid Mazrooei
openalex +2 more sources
Duality theory of $p$-adic Hopf algebras [PDF]
Categories and General Algebraic Structures with Applications, 2021 We show the monoidal functoriality of Schikhof duality, and cultivate new duality theory of $p$-adic Hopf algebras. Through the duality, we introduce two sorts of $p$-adic Pontryagin dualities.
Tomoki Mihara
doaj +1 more source
AIMS Electronics and Electrical Engineering, 2023 The role of diabetes mellitus in deteriorating the visual health of diabetic subjects has been affirmed precisely. The study of morphological features near the macular region is the most common method of investigating the impairment rate.
Manisha Bangar, Prachi Chaudhary
doaj +1 more source
Empirical Mode Decomposition-Based Feature Extraction for Environmental Sound Classification
Sensors, 2022 In environment sound classification, log Mel band energies (MBEs) are considered as the most successful and commonly used features for classification. The underlying algorithm, fast Fourier transform (FFT), is valid under certain restrictions.
Ammar Ahmed +3 more
doaj +1 more source
Improving DFT-Based Image Watermarking Using Particle Swarm Optimization Algorithm
Mathematics, 2021 Robust digital image watermarking is an information security technique that has been widely used to solve several issues related mainly with copyright protection as well as ownership authentication.
Manuel Cedillo-Hernandez +2 more
doaj +1 more source
Generalized Discrete Fourier Transform With Nonlinear Phase [PDF]
IEEE Transactions on Signal Processing, 2010 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
A N Akansu, H Agirman-Tosun
openaire +1 more source
Pyrogenic carbon content of Sphagnum peat soils estimated using diffuse reflectance FTIR spectrometry [PDF]
Mires and Peat, 2022 Quantifying historical patterns of fire regimes in peatlands can help contextualise current fire behaviour and aid in planning on ecosystem and landscape scales.
Dominic M. Uhelski +5 more
doaj +1 more source
Removal of ‘strip noise’ in radio-echo sounding data using combined wavelet and 2-D DFT filtering
Annals of Glaciology, 2020 Radio-echo sounding (RES) can be used to understand ice-sheet processes, englacial flow structures and bed properties, making it one of the most popular tools in glaciological exploration.
Bangbing Wang +9 more
doaj +1 more source