Results 31 to 40 of about 527,013 (335)

Two-Dimensional Discrete Coupled Fractional Fourier Transform (DCFrFT)

open access: yesFractal and Fractional
The fractional Fourier transform is critical in signal processing and supports many applications. Signal processing is one notable application. Implementing the fractional Fourier transform requires discrete versions.
Asma Elshamy   +2 more
doaj   +1 more source

Generalized Orthogonal Discrete W Transform and Its Fast Algorithm

open access: yesDiscrete Dynamics in Nature and Society, 2021
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

Simplification of DFT and IDFT in PRACH

open access: yesElectronics Letters, 2023
The respective simplifications of prime‐point discrete Fourier transform (DFT) and ultra‐long‐point inverse discrete Fourier transform (IDFT) in physical random access channel (PRACH) are proposed. The former is an equivalent substitution of DFT function
Yufeng Jiang, Shouxin Kang
doaj   +1 more source

Tunable fractional Fourier transform implementation of electronic wave functions in atomically thin materials

open access: yesBeilstein Journal of Nanotechnology, 2018
A tunable fractional Fourier transform of the quantum wave function of electrons satisfying either the Schrödinger or the Dirac equation can be implemented in an atomically thin material by a parabolic potential distribution applied on a direction ...
Daniela Dragoman
doaj   +1 more source

Non-Iterative DOA Estimation Using Discrete Fourier Transform Interpolation

open access: yesIEEE Access, 2019
A fast and accurate non-iterative direction-of-arrival (DOA) estimation algorithm for multiple targets in additive white Gaussian noise is devised in this paper.
Yuan Chen   +4 more
doaj   +1 more source

Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity [PDF]

open access: yes2013 IEEE International Symposium on Information Theory, 2013
Given an n-length input signal x, it is well known that its Discrete Fourier Transform (DFT), X, can be computed in O(nlogn) complexity using a Fast Fourier Transform. If the spectrum X is exactly k-sparse (where k
S. Pawar, K. Ramchandran
semanticscholar   +1 more source

Unique Performance Considerations for Printable Organic Semiconductor and Perovskite Radiation Detectors: Toward Consensus on Best Practice Evaluation

open access: yesAdvanced Functional Materials, EarlyView.
A lack of standard approaches for testing and reporting the performance of metal halide perovskites and organic semiconductor radiation detectors has resulted in inconsistent interpretation of performance parameters, impeding progress in the field. This Perspective recommends key metrics and experimental details, which are suggested for reporting in ...
Jessie A. Posar   +8 more
wiley   +1 more source

Enhancing CoFe Catalysts with V2CTX MXene‐Derived Materials for Anion Exchange Membrane Electrolyzers

open access: yesAdvanced Functional Materials, EarlyView.
MXene dervied CoFe composites show increased initial Oxygen Evolution Reaction (OER) activity compared to the pure CoFe and MXene in an Anion Exchange Membrane device. Vanadium vacancies in the MXene plays a role in increased OER activity and hinders Fe leaching in the AEM device over using the pure V2C MXene as a support material for the CoFe ...
Can Kaplan   +16 more
wiley   +1 more source

Kinetic Insights into Precursor‐Assisted Soft Sphere Close Packing Revealed by In Situ GISAXS with Implications for Gas Sensing

open access: yesAdvanced Functional Materials, EarlyView.
The versatile precursor‐assisted soft sphere close packing during slot‐die coating is investigated with in situ X‐ray scattering. The soft crystallization pathways towards a close packing involve multistep structural transitions such as surface nucleation, in‐plane, and out‐of‐plane crystallization.
Guangjiu Pan   +14 more
wiley   +1 more source

Discrete Fourier Transforms

open access: yes, 2018
This chapter deals with the discrete Fourier transform (DFT). In Sect. 3.1, we show that numerical realizations of Fourier methods, such as the computation of Fourier coefficients, Fourier transforms or trigonometric interpolation, lead to the DFT. We also present barycentric formulas for interpolating trigonometric polynomials. In Sect.
Plonka, Gerlind   +7 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy