A Signal-Dependent Time-Frequency Representation: Fast Algorithm for Optimal Kernel Design

Richard G. Baraniuk, Douglas L. Jones

Research output: Contribution to journalArticle

51 Scopus citations

Abstract

A time-frequency representation based on an optimal, signal-dependent kernel has been proposed recently in an attempt to overcome one of the primary limitations of bilinear time-frequency distributions: that the best kernel and distribution depend on the signal to be analyzed. The optimization formulation for the signal-dependent kernel results in a linear program with a unique feature: a tree structure that summarizes a set of constraints on the kernel. In this paper, we present a fast algorithm based on sorting to solve a special class of linear programs that includes the problem of interest. For a kernel with Q variables, the running time of the algorithm is O(Q log Q), which is several orders of magnitude less than any other known method for solving this class of linear programs. This efficiency enables the computation of the signal-dependent, optimal-kernel time-frequency representation at a cost that is on the same order as a fixed-kernel distribution. An important property of the optimal kernel is that it takes on essentially only the values of 1 and 0.

Original languageEnglish (US)
Pages (from-to)134-146
Number of pages13
JournalIEEE Transactions on Signal Processing
Volume42
Issue number1
DOIs
StatePublished - Jan 1994

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A Signal-Dependent Time-Frequency Representation: Fast Algorithm for Optimal Kernel Design'. Together they form a unique fingerprint.

Cite this