Journal ArticleDOI
Fast Hartley transform implementation on DSP chips
TLDR
Efficient implementation of the FHT on different DSP processors is considered, instead of counting the required arithmetic operations, the necessary number of instruction cycles for an implementation of FHT is used as a measure.About:
This article is published in Microprocessors and Microsystems.The article was published on 1996-06-01. It has received 3 citations till now. The article focuses on the topics: Discrete Hartley transform & Hartley transform.read more
Citations
More filters
Patent
Method and device for adaptively modifying the characteristics of one-dimensional signals
Uwe Rass,Gerhard Steeger +1 more
TL;DR: In this paper, a method and device for modifying the characteristics of one-dimensional signals, said signals being converted into a digital representation, while using the adaptive "Overlap-Add" Algorithm is described.
Journal ArticleDOI
Compact FPGA architectures for the two-band fast discrete Hartley transform
TL;DR: Two compact and versatile hardware architectures for the computation of the 8-point, 16-point and 32-point Two-Band Fast Discrete Hartley Transform are proposed and studied.
Patent
Verfahren und gerät zur adaptiven merkmalsänderung bei eindimensionalen signalen
Uwe Rass,Gerhard Steeger +1 more
TL;DR: In this paper, the authors present a verwendung des Adaptive Overlap-Add-Algorithms, in which the Merkmalsanderung nach einer geeigneten diskreten Spektraltransformation durch Multiplikation im Frequenzbereich durchfuhrt and anschliessend das Ausgangssignal durch entsprechende inverse diskrete SPT transformation sowie durch uberlappende and verschobene Addition mehrerer, von
References
More filters
Book
Discrete-Time Signal Processing
TL;DR: In this paper, the authors provide a thorough treatment of the fundamental theorems and properties of discrete-time linear systems, filtering, sampling, and discrete time Fourier analysis.
Journal ArticleDOI
Real-valued fast Fourier transform algorithms
TL;DR: A new implementation of the real-valued split-radix FFT is presented, an algorithm that uses fewer operations than any otherreal-valued power-of-2-length FFT.
Journal ArticleDOI
The fast Hartley transform
TL;DR: The Fast Hartley Transform (FHT) is as fast as or faster than the Fast Fourier Transform (FFT) and serves for all the uses such as spectral analysis, digital processing, and convolution to which the FFT is at present applied.
Journal ArticleDOI
On computing the discrete Hartley transform
TL;DR: A complete set of fast algorithms for computing the discrete Hartley transform is developed, including decimation-in-frequency, radix-4, split radix, prime factor, and Winograd transform algorithms.
Proceedings ArticleDOI
FFT implementation on DSP-chips-theory and practice
R. Meyer,K. Schwarz +1 more
TL;DR: The problem of comparing different algorithms for the execution of the fast Fourier transform (FFT) is considered by using the necessary number of instruction cycles for an FFT implementation on different digital signal processors (DSPs) as a measure.