This paper presents some results on fixed-point error analysis of the fast Hartley transform algorithms. A novel scheme for preventing overflow is considered in the analysis. It is proved that error performance, defined based on the signal-to-noise ratio, can be improved for both the decimation-in-frequency and the decimation-in-time fast Hartley transform algorithms. Zusammenfassung . Dieser A...

*Correspondence: [email protected] 2Department of Mathematics and Institute of Mathematical Research, Universiti Putra Malaysia (UPM), Serdang, Selangor 43400, Malaysia Full list of author information is available at the end of the article Abstract In this paper, we extend Hartley and Hartley-Hilbert transformations (HT and HHT, respectively) to a certain space of tempered distribution...

A sensory evaluation study was performed at UC Davis to determine if taste differences could be detected among several English walnut (Juglans regia) cultivars. Differences were tested using the duo-trio method, in which 'Hartley' was compared to seven other cultivars. No differences were found when 'Hartley' was compared to 'Vina', 'Scharsch Franquette' and 'Mayette', however 'Chandler', 'Chic...

Discrete Hartley transform (DHT) is known to outperform fast Fourier transform (FFT) on sequential machines. Here we investigate parallel algorithms and implementations of twoand three-dimensional DHT in order to determine if the advantage of Hartley transforms over Fourier transforms carries over to parallel environment as well. Our extensive empirical study of the performances of DHT and FFT ...

Discrete Hartley transform (DHT) is an important tool in digital signal processing. In this paper, a multilierless algorithm to compute discrete Hartley transforms is proposed, which can deal with arbitrary length input signals. The proposed algorithm can be implemented by integer additions of fixed points in binary system. Besides, an efficient and regular systolic array is designed to impleme...

Recently, new fast transforms (such as the discrete Hartley transform in particular) have been proposed which are best suited for the computation of cyclic convolution of real sequences. Two approaches using Fourier or Hartley transforms are first compared, showing that the recently proposed FFT algorithms for real data present a lower arithmetic complexity than the corresponding DHT-based appr...