Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published October 15, 2016 | public
Journal Article

A Unified Theory of Union of Subspaces Representations for Period Estimation

Abstract

Several popular period estimation techniques use union-of-subspaces models to represent periodic signals. The main idea behind these techniques is to compare the components of the signal along a set of subspaces representing different periods. Such techniques were shown to offer important advantages over traditional methods, such as those based on DFT. So far, most of these subspace techniques have been developed independent of each other, and there has not been a unified theory analyzing them from a common perspective. In this paper, all such methods are first unified under one general framework. Further, several fundamental aspects of such subspaces are investigated, such as the conditions under which a generic set of subspaces offers unique periodic decompositions, their minimum required dimensions, etc. A number of basic questions in the context of dictionaries spanning periodic signals are also answered. For example, what is the theoretically minimum number of atoms required in any type of dictionary, in order to be able to represent periods 1 ≤ P≤ P_(max)? For each period P, what should be the minimum dimension of the subspace of atoms representing the Pth period itself? Unlike in traditional Fourier dictionaries, it is shown that nonuniform and compact grids are crucial for period estimation. Interestingly, it will be seen that the Euler totient function from number theory plays an important role in providing the answers to all such questions.

Additional Information

© 2016 IEEE. Manuscript received June 23, 2015; revised April 01, 2016 and June 07, 2016; accepted June 07, 2016. Date of publication June 20, 2016; date of current version August 18, 2016. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Jian-Kang Zhang. This work was supported in parts by the ONR grant N00014-15-1-2118, and the Information Science and Technology (IST) initiative of Caltech.

Additional details

Created:
August 20, 2023
Modified:
October 20, 2023