By Topic

Optimal overcomplete kernel design for sparse representations via discrete fractional Fourier transforms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Zhijing Yang ; Faulty of Comput., Guangdong Univ. of Technol., Guangzhou, China ; Chunmei Qing ; Ling, B.W.-K. ; Wai Lok Woo
more authors

This paper proposes to use a set of discrete fractional Fourier transform (DFrFT) matrices with different rotational angles to construct an overcomplete kernel for sparse representations of signals. The design of the rotational angles is formulated as an optimization problem. To solve the problem, it is shown that this design problem is equivalent to an optimal sampling problem. Furthermore, the optimal sampling frequencies are the roots of a set of harmonic functions. As the frequency responses of the filters are required to be computed only at frequencies in a discrete set, the globally optimal rotational angles can be found very efficiently and effectively.

Published in:

Communication Systems, Networks & Digital Signal Processing (CSNDSP), 2012 8th International Symposium on

Date of Conference:

18-20 July 2012