Compact Fractional Fourier Domains

In this letter, a method for finding the compact fractional Fourier domains is presented. As a measure of compactness, we take the ℓ 1 -norm. It is proposed that there exists at least one fractional Fourier domain in which ℓ 1 -norm of the transformed signal is minimum. A coarse-to-fine grid search...

Full description

Saved in:
Bibliographic Details
Published in:IEEE signal processing letters 2017-04, Vol.24 (4), p.427-431
Main Author: Serbes, Ahmet
Format: Article
Language:English
Subjects:
Chirp
Coarse-to-fine search
compact fractional Fourier domains
Computational efficiency
Estimation
Fourier transforms
fractional Fourier transform
minimum l1 norm
Signal processing algorithms
Time-frequency analysis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this letter, a method for finding the compact fractional Fourier domains is presented. As a measure of compactness, we take the ℓ 1 -norm. It is proposed that there exists at least one fractional Fourier domain in which ℓ 1 -norm of the transformed signal is minimum. A coarse-to-fine grid search strategy is adopted to find the optimum fractional Fourier transform angle that makes ℓ 1 -norm minimum with low computational cost. Extensive simulsation results validate the proposed method.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2017.2672860