Fast Hartley transform pruning

The discrete Hartley transform (DHT) is discussed as a tool for the processing of real signals. Fast Hartley transform (FHT) algorithms which compute the DHT in a time proportional to N log/sub 2/ N exist. In many applications, such as interpolation and convolution of signals, a significant number o...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on signal processing 1991-01, Vol.39 (1), p.230-233
Hauptverfasser:	Narayanan, S.B., Prabhu, K.M.M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Convolution Discrete Fourier transforms Discrete transforms Flowcharts Interpolation Signal processing
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!