Generalised short-time Hartley transforms for speech processing

Author

Agbinga, J.P. ; Mclean, Donald J.

Author_Institution

Div. of Radiophys., CSIRO, Epping, NSW, Australia

Volume

3

fYear

1994

fDate

14-18 Nov 1994

Firstpage

893

Abstract

This paper addresses the problem of reducing the complexity involved in computing large discrete Hartley transforms with N-1 degrees of freedom, by first computing short-time transforms with M samples (M>N) and then using this to compute the full transform of length N samples. We present a solution to the problem as it relates to discrete Hartley transforms (DHTs). Short-time Hartley transforms are derived and simplified in terms of type-I DHTs for which efficient fast algorithms exist. We also give further simplifications of type-IV in terms of type-II, and type-III in terms of type-I DHTs

Keywords

Hartley transforms; signal representation; speech processing; time-frequency analysis; discrete Hartley transforms; fast algorithms; generalised short-time Hartley transforms; speech processing; speech signal analysis; time-frequency signal representation; type-I DHT; type-II DHT; type-III DHT; type-IV DHT; Australia; Discrete Fourier transforms; Discrete transforms; Equations; Fourier transforms; Linear predictive coding; Nonlinear filters; Signal analysis; Speech processing; Time frequency analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Singapore ICCS '94. Conference Proceedings.

Print_ISBN

0-7803-2046-8

Type

conf

DOI

10.1109/ICCS.1994.474276

Filename

474276