Unlimited Sampling Theorem Based on Fractional Fourier Transform
The recovery of bandlimited signals with high dynamic range is a hot issue in sampling research. The unlimited sampling theory expands the recordable range of traditional analog-to-digital converters (ADCs) arbitrarily, and the signal is folded back into a low dynamic range measurement, avoiding the saturation problem. We study the unlimited sampling problem of high dynamic non-bandlimited signals in the Fourier domain (FD) based on the fractional Fourier transform (FRFT). First, a mathematical signal model for unlimited sampling is proposed. Then, based on this mathematical model, the annihilation filtering method is used to estimate the arbitrary folding time. Finally, a novel unlimited sampling theorem in the FRFD is obtained. The results show that the non-bandlimited signal can be reconstructed in the FD based on the FRFT, and it is not affected by the ADC threshold.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Reduced Order Fractional Fourier Transform A New Variant to Fractional Signal Processing Definition and Properties
In this paper, a new variant to fractional signal processing is proposed known as the Reduced Order Fractional Fourier Transform. Various properties satisfied by its transformation kernel is derived. The properties assoc…
Circular Convolution and Product Theorem for Affine Discrete Fractional Fourier Transform
The Fractional Fourier Transform is a ubiquitous signal processing tool in basic and applied sciences. The Fractional Fourier Transform generalizes every property and application of the Fourier Transform. Despite the pra…
Convolution, Product and Correlation Theorems for Simplified Fractional Fourier Transform: A Mathematical Investigation
The notion of fractional Fourier transform (FrFT) has been used and investigated for many years by various research communities, which finds widespread applications in many diverse fields of research study. The potential…
Fourier Neural Operators for Non-Markovian Processes:Approximation Theorems and Experiments
This paper introduces an operator-based neural network, the mirror-padded Fourier neural operator (MFNO), designed to learn the dynamics of stochastic systems. MFNO extends the standard Fourier neural operator (FNO) by i…
Frames and vertex-frequency representations in graph fractional Fourier domain
Vertex-frequency analysis, particularly the windowed graph Fourier transform (WGFT), is a significant challenge in graph signal processing. Tight frame theories is known for its low computational complexity in signal rec…
Anomaly DetectionComputational Efficiency