O'Reilly logo

Digital Signal Processing and Applications with the TMS320C6713 and TMS320C6416 DSK, 2nd Edition by Donald Reay, Rulph Chassaing

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

E

Fast Hartley Transform

Whereas complex additions and multiplications are required for an FFT, the Hartley transform [1–8] requires only real multiplications and additions. The FFT maps a real function of time into a complex function of frequency, whereas the fast Hartley transform (FHT) maps the same real-time function into a real function of frequency. The FHT can be particularly useful in cases where the phase is not a concern.

The discrete Hartley transform (DHT) of a time sequence x(n) is defined as

(E.1)

img

where

(E.2)

img

In a similar development to the FFT, (E.1) can be decomposed as

(E.3)

img

Let n = n + N/2 in the second summation of (E.3)

(E.4)

img

Using (E.2) and the identities

(E.5)

img

for odd k

(E.6)

img

and, for even k

(E.7)

img

Using (E.6) and (E.7), (E.4) becomes

(E.8)

and

(E.9)

Let k = 2

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required