The optimal transform for the discrete Hirschman uncertainty principle

We determine all signals giving equality for the discrete Hirschman uncertainty principle. We single out the case where the entropies of the time signal and its Fourier transform are equal. These signals (up to scalar multiples) form an orthonormal basis giving an orthogonal transform that optimally packs a finite-duration discrete-time signal. The transform may be computed via a fast algorithm due to its relationship to the discrete Fourier transform.

[1]  Murad Özaydin,et al.  Platonic Orthonormal Wavelets , 1997 .

[2]  Victor E. DeBrunner,et al.  Resolution in time-frequency , 1999, IEEE Trans. Signal Process..

[3]  Victor E. DeBrunner,et al.  The optimal solutions to the continuous and discrete-time versions of the Hirschman uncertainty principle , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[4]  D. Donoho,et al.  Uncertainty principles and signal recovery , 1989 .

[5]  Victor E. DeBrunner,et al.  Using a new uncertainty measure to determine optimal bases for signal representations , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).

[6]  Amir Dembo,et al.  Information theoretic inequalities , 1991, IEEE Trans. Inf. Theory.

[7]  H. J. LANDAU.  UNCERTAINTY PRINCIPLES AND SIGNAL RECOVERY 931 , .

[8]  Victor E. DeBrunner,et al.  Analysis in a finite time-frequency plane , 2000, IEEE Trans. Signal Process..

[9]  I. Hirschman,et al.  A Note on Entropy , 1957 .

[10]  L. Hörmander.  Notions of Convexity , 1994 .