Publication detail

Computation complexity of time-frequency representation of signals.

Jiří Mišurec Ivan Koula

Original Title

Computation complexity of time-frequency representation of signals.

Type

conference paper

Language

English

Original Abstract

Multidimensional time-frequency representations of signals are images of changes in time of signal spectrum and thus play an important role when they are analysed and processed. There is a number of possible ways of time-frequency representation of signals. Their properties depend on the transformation algorithm used, and they differ not only in the resolution of changes in the time and the frequency domain but also in the computation complexity during the realization. Today, rapid processing of great amounts of data in a very short period of time is often required. It is, above all, in systems processing signals in real time that minimum delay in processing the signal is of much concern and therefore it is important to tackle the problem of the computation complexity of the algorithms used.

Keywords

Digital signal processors, wavelet transform, Fourier transform, FFT, DWT, digital signal processing, spectrogram, scalegram.

Authors

Jiří Mišurec Ivan Koula

RIV year

2005

Released

13. 3. 2005

Publisher

WSEAS

Location

Prague

ISBN

960-8457-13-0

Book

Applications of Electrical Engineering (AEE '05)

Pages from

167

Pages to

170

Pages count

3

BibTex

@inproceedings{BUT17648,
  author="Jiří {Mišurec} and Ivan {Koula}",
  title="Computation complexity of time-frequency representation of signals.",
  booktitle="Applications of Electrical Engineering (AEE '05)",
  year="2005",
  pages="167--170",
  publisher="WSEAS",
  address="Prague",
  isbn="960-8457-13-0"
}