Tilings of the Time-Frequency Plane

Construction of Arbitrary Orthogonal Bases and Fast Tiling Algorithms

Cormac Herley, Jelena Kovacevic

Research output: Contribution to journalArticle

Abstract

We consider expansions which give arbitrary orthonormal tilings of the time-frequency plane. These differ from the short-time Fourier transform, wavelet transform, and wavelet packets tilings in that they change over time. We show how this can be achieved using time-varying orthogonal tree structures, which preserve orthogonality, even across transitions. The method is based on the construction of boundary and transition filters; these allow us to construct essentially arbitrary tilings. Time-varying modulated lapped transforms are a special case, where both boundary and overlapping solutions are possible with filters obtained by modulation. We present a double-tree algorithm which for a given signal decides on the best binary segmentation in both time and frequency. That is, it is a joint optimization of time and frequency splitting. The algorithm is optimal for additive cost functions (e.g., rate-dis-tortion), and results in time-varying best bases, the main application of which is for compression of nonstationary signals. Experiments on test signals are presented.

Original languageEnglish (US)
Pages (from-to)3341-3359
Number of pages19
JournalIEEE Transactions on Signal Processing
Volume41
Issue number12
DOIs
StatePublished - Jan 1 1993

Fingerprint

Cost functions
Wavelet transforms
Fourier transforms
Modulation
Experiments

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Tilings of the Time-Frequency Plane : Construction of Arbitrary Orthogonal Bases and Fast Tiling Algorithms. / Herley, Cormac; Kovacevic, Jelena.

In: IEEE Transactions on Signal Processing, Vol. 41, No. 12, 01.01.1993, p. 3341-3359.

Research output: Contribution to journalArticle

@article{7786afa659f943048ff105173dd54e73,
title = "Tilings of the Time-Frequency Plane: Construction of Arbitrary Orthogonal Bases and Fast Tiling Algorithms",
abstract = "We consider expansions which give arbitrary orthonormal tilings of the time-frequency plane. These differ from the short-time Fourier transform, wavelet transform, and wavelet packets tilings in that they change over time. We show how this can be achieved using time-varying orthogonal tree structures, which preserve orthogonality, even across transitions. The method is based on the construction of boundary and transition filters; these allow us to construct essentially arbitrary tilings. Time-varying modulated lapped transforms are a special case, where both boundary and overlapping solutions are possible with filters obtained by modulation. We present a double-tree algorithm which for a given signal decides on the best binary segmentation in both time and frequency. That is, it is a joint optimization of time and frequency splitting. The algorithm is optimal for additive cost functions (e.g., rate-dis-tortion), and results in time-varying best bases, the main application of which is for compression of nonstationary signals. Experiments on test signals are presented.",
author = "Cormac Herley and Jelena Kovacevic",
year = "1993",
month = "1",
day = "1",
doi = "10.1109/78.258078",
language = "English (US)",
volume = "41",
pages = "3341--3359",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

TY - JOUR

T1 - Tilings of the Time-Frequency Plane

T2 - Construction of Arbitrary Orthogonal Bases and Fast Tiling Algorithms

AU - Herley, Cormac

AU - Kovacevic, Jelena

PY - 1993/1/1

Y1 - 1993/1/1

N2 - We consider expansions which give arbitrary orthonormal tilings of the time-frequency plane. These differ from the short-time Fourier transform, wavelet transform, and wavelet packets tilings in that they change over time. We show how this can be achieved using time-varying orthogonal tree structures, which preserve orthogonality, even across transitions. The method is based on the construction of boundary and transition filters; these allow us to construct essentially arbitrary tilings. Time-varying modulated lapped transforms are a special case, where both boundary and overlapping solutions are possible with filters obtained by modulation. We present a double-tree algorithm which for a given signal decides on the best binary segmentation in both time and frequency. That is, it is a joint optimization of time and frequency splitting. The algorithm is optimal for additive cost functions (e.g., rate-dis-tortion), and results in time-varying best bases, the main application of which is for compression of nonstationary signals. Experiments on test signals are presented.

AB - We consider expansions which give arbitrary orthonormal tilings of the time-frequency plane. These differ from the short-time Fourier transform, wavelet transform, and wavelet packets tilings in that they change over time. We show how this can be achieved using time-varying orthogonal tree structures, which preserve orthogonality, even across transitions. The method is based on the construction of boundary and transition filters; these allow us to construct essentially arbitrary tilings. Time-varying modulated lapped transforms are a special case, where both boundary and overlapping solutions are possible with filters obtained by modulation. We present a double-tree algorithm which for a given signal decides on the best binary segmentation in both time and frequency. That is, it is a joint optimization of time and frequency splitting. The algorithm is optimal for additive cost functions (e.g., rate-dis-tortion), and results in time-varying best bases, the main application of which is for compression of nonstationary signals. Experiments on test signals are presented.

UR - http://www.scopus.com/inward/record.url?scp=0027806249&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027806249&partnerID=8YFLogxK

U2 - 10.1109/78.258078

DO - 10.1109/78.258078

M3 - Article

VL - 41

SP - 3341

EP - 3359

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 12

ER -