By Topic

Information bounds for random signals in time-frequency plane

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
$33 $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

2 Author(s)
S. Aviyente ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; W. J. Williams

Renyi entropy has been proposed as one of the methods for measuring signal information content and complexity on the time-frequency plane. It provides a quantitative measure for the uncertainty of the signal. All of the previous work concerning Renyi entropy in the time-frequency plane has focused on determining the number of signal components in a given deterministic signal. We discuss the behaviour of Renyi entropy when the signal is random, more specifically white complex Gaussian noise. We present the bounds on the expected value of Renyi entropy and discuss ways to minimize the uncertainty by deriving conditions on the time-frequency kernel. The performance of minimum entropy kernels in determining the number of signal elements is demonstrated. Finally, some possible applications of Renyi entropy for signal detection are discussed

Published in:

Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP '01). 2001 IEEE International Conference on  (Volume:6 )

Date of Conference: