Generalised short-time Hartley transforms for speech processing

摘要

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