By Topic

Generalised short-time Hartley transforms for speech processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Agbinga, J.P. ; Div. of Radiophys., CSIRO, Epping, NSW, Australia ; McLean, D.J.

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

Published in:

Singapore ICCS '94. Conference Proceedings.  (Volume:3 )

Date of Conference:

14-18 Nov 1994