FRFT

AcronymDefinition
FRFTFractional Fourier Transform
FRFTFixed Right First Time
References in periodicals archive ?
Besides, the eigendecomposition-type DFRFT can preserve all important properties of continues FRFT and approximates FRFT well, despite the lack of analytical expression.
Suppose we do M times FRFT separately upon the signal x, and the square of magnitudes of transform is accordingly [mathematical expression not reproducible], .
The matrix completion algorithm for recovering the signal from multiple FRFT magnitudes is as follows:
FRFT square magnitudes [mathematical expression not reproducible].
We add several Gaussian noises under different intensities to the signal and reconstruct it from different numbers of magnitudes of FRFT.
The GS algorithm for recovering the signal from multiple FRFT magnitudes is as follows:
Input: [epsilon], max iter, FRFT magnitudes [mathematical expression not reproducible] and initial guess [[?
In this paper we consider solving the FRFT phase retrieval problem with the matrix completion method which utilizes magnitudes of multiple FRFTs.
Phase retrieval from magnitudes of multiple FRFTs using the GS algorithm has been proposed and comprehensively studied by [17].
The orders of discrete FRFTs are [mathematical expression not reproducible].