scispace - formally typeset
Search or ask a question
Journal ArticleDOI

The fast Hartley transform

01 Aug 1984-Vol. 72, Iss: 8, pp 1010-1018
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.
Abstract: A fast algorithm has been worked out for performing the Discrete Hartley Transform (DHT) of a data sequence of N elements in a time proportional to Nlog 2 N. 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. A new timing diagram (stripe diagram) is presented to illustrate the overall dependence of running time on the subroutines composing one implementation; this mode of presentation supplements the simple counting of multiplies and adds. One may view the Fast Hartley procedure as a sequence of matrix operations on the data and thus as constituting a new factorization of the DFT matrix operator; this factorization is presented. The FHT computes convolutions and power spectra distinctly faster than the FFT.
Citations
More filters
Journal ArticleDOI
01 Jun 1999
TL;DR: The basic adaptive algorithm for ANC is developed and analyzed based on single-channel broad-band feedforward control, then modified for narrow-bandFeedforward and adaptive feedback control, which are expanded to multiple-channel cases.
Abstract: Active noise control (ANC) is achieved by introducing a cancelling "antinoise" wave through an appropriate array of secondary sources. These secondary sources are interconnected through an electronic system using a specific signal processing algorithm for the particular cancellation scheme. ANC has application to a wide variety of problems in manufacturing, industrial operations, and consumer products. The emphasis of this paper is on the practical aspects of ANC systems in terms of adaptive signal processing and digital signal processing (DSP) implementation for real-world applications. In this paper, the basic adaptive algorithm for ANC is developed and analyzed based on single-channel broad-band feedforward control. This algorithm is then modified for narrow-band feedforward and adaptive feedback control. In turn, these single-channel ANC algorithms are expanded to multiple-channel cases. Various online secondary-path modeling techniques and special adaptive algorithms, such as lattice, frequency-domain, subband, and recursive-least-squares, are also introduced. Applications of these techniques to actual problems are highlighted by several examples.

1,254 citations


Cites background from "The fast Hartley transform"

  • ...Therefore, the real-valued discrete cosine or discrete Hartley transforms [124], [125] may be more convenient from an implementational point of view....

    [...]

Journal ArticleDOI
TL;DR: In this article, the authors collected electroencephalogram (EEG) measures of prefrontal asymmetry and self-report measures of Behavioral Approach and Inhibition System (BAS and BIS) strength, and general levels of positive and negative affect (PA and NA).
Abstract: Resting anterior brain electrical activity, self-report measures of Behavioral Approach and Inhibition System (BAS and BIS) strength, and general levels of positive and negative affect (PA and NA) were collected from 46 unselected undergraduates on two separate occasions Electroencephalogram (EEG) measures of prefrontal asymmetry and the self-report measures showed excellent internal consistency reliability and adequate test-retest stability Aggregate measures across the two assessments were computed for all indices Subjects with greater relative left prefrontal activation reported higher levels of BAS strength, whereas those with greater relative right prefrontal activation reported higher levels of BIS strength Prefrontal EEG asymmetry accounted for more than 25% of the variance in the self-report measure of relative BAS-BIS strength Prefrontal EEG, however, was not significantly correlated with PA or NA, or the relative strength of PA versus NA Posterior asymmetry was unrelated to the self-report measures

1,251 citations


Cites methods from "The fast Hartley transform"

  • ...2 The Fast Hartley Transform method of spectral analysis is conceptuilly analogous to the Fast Founer Transform, provides identical output, and IS computationally more efficient 3 Asymmetry scores are used because they can control for nonneurogemc sources of mdividual differences (e g, skull thickness) in power density values (see Wheeler et al, 1993, for further details) 206 VOL 8, NO 3, MAY 1997 RCSULIS Tlu^crrehuon l ....

    [...]

  • ...…Adjacent chunks were overlapped 50% in order to minimize the loss of data due to Hamming window extraction For each chunk, a Fast Hartley Transform (Bracewell, 1984) was used to denve esUmates of spectral power ((xV^) m different 1-Hz frequency bins for each electrode site ^ Spectral power values…...

    [...]

  • ...Each subject partiapated individually m the first baseline EEG session between the 3rd and 6th weeks of the fall 1994 semester Electrodes were placed and checked within the first 50 min of the subject's amval While the expenmenter momtored the recording equipment from an adjacent room, computer instnicuons led the subject through a senes of eight l-mm basebnes dunng which EEG was recorded while the subject sat quietly with eyes opened and closed m counterbalanced tnals The eight baselines were usually completed m less than 15 min Following the removal of electrodes, the subject completed a set of selfreport lnventones, including the general version of the PANAS The second EEG session was completed exactly 6 weeks later It was identical to the first session with two exceptions A different counterbalanced order of eyes-opened and eyes-closed tnals was used, and the BIS/BAS scales (Carver & White, 1994) were administered at this session, in place of the PANAS Approximately 3 months following participation m the second EEG session, each subject was invited to participate in a twosession study dunng which a battery of cognitive and behavioral tasks was administered The second non-EEG session was completed between 4 and 6 months following the second baseline EEG session Near the end of this 2-hr session, the subject completed the PANAS and BIS/BAS scales for a second time Data Reduction and Analysis EEGs from 29 sites (13 homologous pairs and 3 midline sites) of the 10-20 electrode system were recorded using a Lycra stretchable cap (Electro-Cap International, Inc, Eaton, Ohio) positioned according to standard anatomical landmarks All electrode impedances were less than 5,000 ohms, and impedances for homologous sites were within 2,000 ohms All EEG signals were referenced to an electrode placed on the left ear lobe (Al) An electrode was also placed on the nght ear lobe (A2, referenced to Al) so that a denved averaged-ears reference could be used in analyses For the purposes of artifact sconng, vertical and horizontal eye movements (electro-oculograms) were also recorded Electrode pairs were placed at the supra- and suborbit of one eye (randomly selected), and at the external canthi of each eye EEGs were amplified with Grass Model 12 Neurodata System amplifiers after passing through Model 12A5 preamplifiers with bandpass filters set at 1 and 300 Hz and the 60-Hz notch filter I, and passing through antialiasing, low-pass, 36-dB/octave rolloff filters set at 200 Hz (MF6, National Semiconductor Corp, Santa Qara, Cahfomia) Electro-oculograms were processed in a similar manner, with the exception that there was no antialiasing filtenng and amphficaUon was occasionally lowered to 20,000 ohms All EEG and electro-oculogram signals were digitized at 500 Hz using SnapStream (HEM Data Corp, Spnngfield, Michigan) and a 486 DX2-66 computer Digitized EEG signals were calibrated using 25-n.V and 50- ' 10-Hz signals recorded unmediately before and after each ision These signals were visually reviewed off-hne by a trained assistant Portions of each 1-min baselme containing eye movement, muscle movement, or other sources of artifact were removed pnor to further analysis The designation of artifact in any one channel resulted m the removal of data in all channels ensure that data preserved in all channels were denved from the identical Ume penods Then, 1 024-s chunks of artifact-fret EEG were used for spectral analysis If fewer than 10 chunks o artifact-free data were available m a given 1-min baseline, the basehne was dropped from further processing and analysis (1 6% of baselines) TTie denved averaged-ears reference was used for all further data reduction Chunks of artifact-free EEG were extracted through a Hamming window in order to reduce spunous esUmates of spectral power Adjacent chunks were overlapped 50% in order to minimize the loss of data due to Hamming window extraction For each chunk, a Fast Hartley Transform (Bracewell, 1984) was used to denve esUmates of spectral power ((xV^) m different 1-Hz frequency bins for each electrode site ^ Spectral power values were then averaged across all chunks within a smgle baselme Power values were then converted to power density values (ftVV Hz) for the standard EEG bands Analyses focused on the alpha band (8-13 Hz) because previous data indicated that power m the alpha band is inversely related to activation (e g, Shagass, 1972) and is more strongly related to behavior than power m other frequency bands (Davidson, Chapman, Chapman, & Hennques, 1990) Power density values were normalized via log-transformation An asymmetry score was calculated for each of the 13 homologous electrode pairs by subtracting the log-transformed power density value in the alpha band for the left site from that for the nght site (e g , log F4 - log F3) ' Positive asymmetry scores reflect greater left-side activation (greater alpha band power density on nght than on left) In order to assess internal consistency reliability, we calculated an asymmetry score for each 1-min basehne Weighted averages (weighted by the number of artifact-free chunks in a tnal) across the eight 1-min baseline penods within Sessions 1 and 2 were calculated in order to assess test-retest reliability A simple mean based on weighted averages for Sessions 1 and 2 was calculated as the final, aggregate estimate of EEG asymmetry used to assess relations with the self-report mea- Carver and White's (1994) 24-item BIS/BAS scales inventory was used to measure strengths of the BIS and BAS Scores for the 13-item BAS scale and 7-item BIS scale were calculated following Carver and White (l e , summing 4-point Likert scale responses) In order to obtain a self-report metnc conceptually similar to EEG asymmetry (l e , relative strength), we calculated a BAS-BIS difference score by subtracting the z-transformed BIS scale score from the z-transformed BAS scale score Positive BAS-BIS difference scores reflect relatively greater BAS activity The general version of the 20-item PANAS (Watson et al, 1988) self-reported dispositional levels of jwsitive affect (PA) and negative affect (NA) The PA and NA measures were calculated following Watson et al (1988) As with the BIS/ BAS scales, a PA-NA difference score was calculated by subtracting the z-transformed NA score from the z-transformed PA of relations among the vanous measures....

    [...]

Journal ArticleDOI
TL;DR: Note: V. Madisetti, D. B. Williams, Eds.

862 citations

01 Jan 1997
TL;DR: MadMadisetti, D. B. Williams, Eds. as discussed by the authors, LCAV-2005-009 Record created on 2005-06-27, modified on 2017-05-12
Abstract: Note: V. K. Madisetti, D. B. Williams, Eds. Reference LCAV-CHAPTER-2005-009 Record created on 2005-06-27, modified on 2017-05-12

839 citations

Journal ArticleDOI
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.
Abstract: This tutorial paper describes the methods for constructing fast algorithms for the computation of the discrete Fourier transform (DFT) of a real-valued series. The application of these ideas to all the major fast Fourier transform (FFT) algorithms is discussed, and the various algorithms are compared. We present a new implementation of the real-valued split-radix FFT, an algorithm that uses fewer operations than any other real-valued power-of-2-length FFT. We also compare the performance of inherently real-valued transform algorithms such as the fast Hartley transform (FHT) and the fast cosine transform (FCT) to real-valued FFT algorithms for the computation of power spectra and cyclic convolutions. Comparisons of these techniques reveal that the alternative techniques always require more additions than a method based on a real-valued FFT algorithm and result in computer code of equal or greater length and complexity.

489 citations


Cites methods or result from "The fast Hartley transform"

  • ...The Hartley transform [3], [4] is shown in [34] to have properties similar to those of the DFT....

    [...]

  • ...Another recent scheme [19] uses a prime factor map, but computes the modules using the Hartley transform [3], [34]....

    [...]

References
More filters
Journal ArticleDOI
TL;DR: Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
Abstract: An efficient method for the calculation of the interactions of a 2' factorial ex- periment was introduced by Yates and is widely known by his name. The generaliza- tion to 3' was given by Box et al. (1). Good (2) generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series. In their full generality, Good's methods are applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices, where m is proportional to log N. This results inma procedure requiring a number of operations proportional to N log N rather than N2. These methods are applied here to the calculation of complex Fourier series. They are useful in situations where the number of data points is, or can be chosen to be, a highly composite number. The algorithm is here derived and presented in a rather different form. Attention is given to the choice of N. It is also shown how special advantage can be obtained in the use of a binary computer with N = 2' and how the entire calculation can be performed within the array of N data storage locations used for the given Fourier coefficients. Consider the problem of calculating the complex Fourier series N-1 (1) X(j) = EA(k)-Wjk, j = 0 1, * ,N- 1, k=0

11,795 citations

Journal ArticleDOI
G. D. Bergland1
TL;DR: This article is intended as a primer on the fast Fourier transform, which has revolutionized the digital processing of waveforms and is needed for a whole new range of applications for this classic mathematical device.
Abstract: For some time the Fourier transform has served as a bridge between the time domain and the frequency domain. It is now possible to go back and forth between waveform and spectrum with enough speed and economy to create a whole new range of applications for this classic mathematical device. This article is intended as a primer on the fast Fourier transform, which has revolutionized the digital processing of waveforms. The reader's attention is especially directed to the IEEE Transactions on Audio and Electroacoustics for June 1969, a special issue devoted to the fast Fourier transform.

668 citations

Journal ArticleDOI
TL;DR: The discrete Hartley transform (DHT) resembles the discrete Fourier transform (DFT) but is free from two characteristics of the DFT that are sometimes computationally undesirable and promises to speed up Fourier-transform calculations.
Abstract: The discrete Hartley transform (DHT) resembles the discrete Fourier transform (DFT) but is free from two characteristics of the DFT that are sometimes computationally undesirable. The inverse DHT is identical with the direct transform, and so it is not necessary to keep track of the +i and −i versions as with the DFT. Also, the DHT has real rather than complex values and thus does not require provision for complex arithmetic or separately managed storage for real and imaginary parts. Nevertheless, the DFT is directly obtainable from the DHT by a simple additive operation. In most image-processing applications the convolution of two data sequences f1 and f2 is given by DHT of [(DHT of f1) × (DHT of f2)], which is a rather simpler algorithm than the DFT permits, especially if images are. to be manipulated in two dimensions. It permits faster computing. Since the speed of the fast Fourier transform depends on the number of multiplications, and since one complex multiplication equals four real multiplications, a fast Hartley transform also promises to speed up Fourier-transform calculations. The name discrete Hartley transform is proposed because the DHT bears the same relation to an integral transform described by Hartley [ HartleyR. V. L., Proc. IRE30, 144 ( 1942)] as the DFT bears to the Fourier transform.

465 citations

Journal ArticleDOI
R. V. L. Hartley1
01 Mar 1942
TL;DR: In this article, the Fourier identity is expressed in a more symmetrical form which leads to certain analogies between the function of the original variable and its transform, and it permits a function of time to be analyzed into two independent sets of sinusoidal components, one of which is represented in terms of positive frequencies, and the other of negative.
Abstract: The Fourier identity is here expressed in a more symmetrical form which leads to certain analogies between the function of the original variable and its transform. Also it permits a function of time, for example, to be analyzed into two independent sets of sinusoidal components, one of which is represented in terms of positive frequencies, and the other of negative. The steady-state treatment of transmission problems in terms of this analysis is similar to the familiar ones and may be carried out either in terms of real quantities or of complex exponentials. In the transient treatment, use is made of the analogies referred to above, and their relation to the method of "paired echoes" is discussed. A restatement is made of the condition which is known to be necessary in order that a given steady-state characteristic may represent a passive or stable active system (actual or ideal). A particular necessary condition is deduced from this as an illustration.

278 citations

Journal ArticleDOI
Glenn D. Bergland1
TL;DR: In this article, a new procedure for calculating the complex, discrete Fourier transform of real-valued time series is presented for an example where the number of points in the series is an integral power of two.
Abstract: A new procedure is presented for calculating the complex, discrete Fourier transform of real-valued time series. This procedure is described for an example where the number of points in the series is an integral power of two. This algorithm preserves the order and symmetry of the Cooley-Tukey fast Fourier transform algorithm while effecting the two-to-one reduction in computation and storage which can be achieved when the series is real. Also discussed are hardware and software implementations of the algorithm which perform only (N/4) log2 (N/2) complex multiply and add operations, and which require only N real storage locations in analyzing each N-point record.

134 citations