Measuring time-frequency information and complexity using the Renyi entropies

Richard G. Baraniuk, Patrick Flandrin, Olivier Michel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In search of a nonparametric indicator of deterministic signal complexity, we link the Renyi entropies to time-frequency representations. The resulting measures show promise in several situations where concepts like the time-bandwidth product fail.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Place of PublicationPiscataway, NJ, United States
PublisherInstitute of Electrical and Electronics Engineers Inc.
StatePublished - Jan 1 1995
EventProceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can
Duration: Sep 17 1995Sep 22 1995

Other

OtherProceedings of the 1995 IEEE International Symposium on Information Theory
CityWhistler, BC, Can
Period9/17/959/22/95

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Applied Mathematics
  • Modeling and Simulation
  • Theoretical Computer Science
  • Information Systems

Fingerprint Dive into the research topics of 'Measuring time-frequency information and complexity using the Renyi entropies'. Together they form a unique fingerprint.

Cite this