ABSTRACT Discrete Hartley transform is an important tool in digital signal processing. This paper presents a novel recursive algorithm for realization of one-dimensional discrete Hartley transform of even length. The transform is constructed by single folding of input data and using Chebyshev Polynomial. Single folding algorithm provides data throughput two times of that achieved by the convent...

By Ralph A. Vernacchia, Ph.D., and Sylvia Veit-Hartley, B.A. Center for Performance Enhancement, Western Washington University This excellent work by Vernacchia and Veit-Hartley was presented at the Coaching Education Level III in December, 1998. It not only shows the quality of the authors’ research and writing, but also the what one might fi nd at a Level III seminar. Both authors are to be c...

This paper is concerned with the definition of the continuous fractional Hartley transform. First, a general theory of linear fractional transform is presented to provide a systematic procedure to define the fractional version of any well-known linear transforms. Then, the results of general theory are used to derive the definitions of fractional Fourier transform (FRFT) and fractional Hartley ...

In this paper, we propose a unified theory for arithmetic transforms of a variety of discrete trigonometric transforms. The main contribution of this work is the elucidation of the interpolation process required in arithmetic transforms. We show that the interpolation method determines the transform to be computed. Several kernels were examined and asymptotic interpolation formulae were derived...

In this paper, a relation for finding type-II discrete sine transform (DST) from type-I discrete Hartley transform (DHT) has been derived. The transform length N is taken as even. Using this relation, the (N 1) output components of DST can be realized from DHT. The DHT is one of the transforms used for converting data in time domain into frequency domain using only real values.