Quantum Windowed Fourier Transform and its Application to Quantum Signal Processing

2021 ◽  
Author(s):  
Haiting Yin ◽  
Dayong Lu ◽  
Rui Zhang
Keyword(s):  
Signal Processing ◽  
Fourier Transform ◽  
Windowed Fourier Transform ◽  
Quantum Signal Processing

scholarly journals Compressive Sensing in Signal Processing: Algorithms and Transform Domain Formulations

2016 ◽  
Vol 2016 ◽  
pp. 1-16 ◽  
Author(s):  
Irena Orović ◽  
Vladan Papić ◽  
Cornel Ioana ◽  
Xiumei Li ◽  
Srdjan Stanković
Keyword(s):  
Signal Processing ◽  
Fourier Transform ◽  
Compressive Sensing ◽  
Signal Reconstruction ◽  
Signal Acquisition ◽  
Transform Domain ◽  
Hermite Transform ◽  
Time Frequency ◽  
Reconstruction Methods ◽  
Fourier Transform Domain

Compressive sensing has emerged as an area that opens new perspectives in signal acquisition and processing. It appears as an alternative to the traditional sampling theory, endeavoring to reduce the required number of samples for successful signal reconstruction. In practice, compressive sensing aims to provide saving in sensing resources, transmission, and storage capacities and to facilitate signal processing in the circumstances when certain data are unavailable. To that end, compressive sensing relies on the mathematical algorithms solving the problem of data reconstruction from a greatly reduced number of measurements by exploring the properties of sparsity and incoherence. Therefore, this concept includes the optimization procedures aiming to provide the sparsest solution in a suitable representation domain. This work, therefore, offers a survey of the compressive sensing idea and prerequisites, together with the commonly used reconstruction methods. Moreover, the compressive sensing problem formulation is considered in signal processing applications assuming some of the commonly used transformation domains, namely, the Fourier transform domain, the polynomial Fourier transform domain, Hermite transform domain, and combined time-frequency domain.

The whole can be very much less than the sum of its parts

2019 ◽  
Vol 103 (556) ◽  
pp. 117-127
Author(s):  
Peter Shiu
Keyword(s):  
Signal Processing ◽  
Fourier Transform ◽  
Mr Imaging ◽  
Fast Fourier Transform ◽  
Data Compression ◽  
Mobile Phones ◽  
Processing Data ◽  
Speed Up ◽  
Indispensable Tool ◽  
Computing Machines

This Article is on the discrete Fourier transform (DFT) and the fast Fourier transform (FFT). As we shall see, FFT is a slight misnomer, causing confusion to beginners. The idiosyncratic title will be clarified in §4.Computing machines are highly efficient nowadays, and much of the efficiency is based on the use of the FFT to speed up calculations in ultrahigh precision arithmetic. The algorithm is now an indispensable tool for solving problems that involve a large amount of computation, resulting in many useful and important applications: for example, in signal processing, data compression and photo-images in general, and WiFi, mobile phones, CT scanners and MR imaging in particular.

Sign in / Sign up

Export Citation Format

Share Document