Time-frequency complexity and information

Patrick Flandrin, Richard G. Baraniuk, Olivier Michel

Abstract

Many functions have been proposed for estimating signal information content and complexity on the time-frequency plane, including moment-based measures such as the time-bandwidth product and the Shannon and Renyi(see 4th Berkeley Symp. Math., Stat., Prob., vol.1) entropies. When applied to a time-frequency representation from Cohen's (1989) class, the Renyi entropy conforms closely to the visually based notion of complexity that we use when inspecting time-frequency images. A detailed discussion reveals many of the desirable properties of the Renyi information measure for both deterministic and random signals.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>
BibTeX
@inproceedings{flandrin1994time,
  author = {Patrick Flandrin and Richard G. Baraniuk and Olivier Michel},
  title = {{Time-frequency complexity and information}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {1994},
  doi = {10.1109/icassp.1994.390031},
}

Loading related content...

Figure