• DocumentCode
    2040749
  • Title

    Hirschman uncertainty with the discrete fractional fourier transform

  • Author

    Ghuman, Kirandeep ; DeBrunner, Victor

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Florida State Univ., Tallahassee, FL, USA
  • fYear
    2013
  • fDate
    3-6 Nov. 2013
  • Firstpage
    1306
  • Lastpage
    1310
  • Abstract
    The Hirschman Uncertainty [1] is defined by the average of the Shannon entropies of a discrete-time signal and its Fourier transform. The optimal basis for the Hirschman Uncertainty has been shown to be the picket fence function, as given in a previous paper of ours [2]. We have seen that a basis can be constructed from signals with minimum Hirschman Uncertainty in that paper, leading to a transform we called the Hirschman Optimal Transform. Recently, we showed that the minimizers, and thus the uncertainty, are invariant to the Rényi entropy order [3]. This characteristic strongly suggests that Hirschman Uncertainty is a fundamental characteristic of digital signals. In this paper, we study the effect of incorporating the discrete fractional fourier transfom (discrete FRT) instead of the DFT and develop a new uncertainty measure denoted by Ua1/2(x).
  • Keywords
    discrete Fourier transforms; entropy; signal processing; DFT; Hirschman optimal transform; Rényi entropy order; Shannon entropy; digital signals; discrete FRT; discrete fractional Fourier transform; discrete-time signal; minimum Hirschman uncertainty; picket fence function; Discrete Fourier transforms; Entropy; Frequency measurement; Measurement uncertainty; Uncertainty; Discrete Fractional Fourier Transform (FRT); Hirschman Uncertainty; Picket Fence Signals;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2013 Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA
  • Print_ISBN
    978-1-4799-2388-5
  • Type

    conf

  • DOI
    10.1109/ACSSC.2013.6810505
  • Filename
    6810505