An improved fast algorithm for the fractional Fourier transform based on the method of the dimensional normalization
From MaRDI portal
Publication:2823957
DOI10.16357/J.CNKI.ISSN1000-5862.2016.01.13zbMATH Open1363.42009MaRDI QIDQ2823957FDOQ2823957
Authors: Rui Lin
Publication date: 6 October 2016
Published in: Journal of Jiangxi Normal University. Natural Science Edition (Search for Journal in Brave)
Recommendations
- A new formulation of the fast fractional Fourier transform
- scientific article; zbMATH DE number 1910390
- A method for the discrete fractional Fourier transform computation
- A low-complexity approach to computation of the discrete fractional Fourier transform
- scientific article; zbMATH DE number 6739980
- The discrete multiple-parameter fractional Fourier transform
- Novel Short-Time Fractional Fourier Transform: Theory, Implementation, and Applications
- An improved fast Fourier transform algorithm using mixed frequency and time decimations
- A New Fast Algorithm for Discrete Fractional Hadamard Transform
- The multiple-parameter fractional Fourier transform
discretizationfractional Fourier transformangle spectrum diffractiondimensional normalizationsample interval
Cited In (5)
- A new method for fast computation of cumulative distribution functions by fractional FFT
- Computation of the fractional Fourier transform
- Title not available (Why is that?)
- A new formulation of the fast fractional Fourier transform
- A study of searching the optimal fractional Fourier transform order based on quasi-Newton method
This page was built for publication: An improved fast algorithm for the fractional Fourier transform based on the method of the dimensional normalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2823957)