The Fast Hartley Transform Algorithm

Hou,

doi:10.1109/tc.1987.1676877

Cited by 154 publications

(46 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this paper, an efficient and numerically stable FFT algorithm (Hou 1987;Burrus and Eschenbacher 1981) is used to calculate the minimum step size required for interpolation of Euler angles. For a given angle, the frequency corresponding to the largest spike in the Fourier transformed space is recorded and the corresponding time step is calculated.…”

Section: Ace Computationmentioning

confidence: 99%

A fast, accurate, and smooth planetary ephemeris retrieval system

Arora

Russell

2010

Celest Mech Dyn Astr

View full text Add to dashboard Cite

Precise trajectory simulations typically require an ephemeris retrieval system, i.e. some mechanism to identify planetary body states and orientations at given times. However, the ephemeris systems most commonly used throughout industry and academia are, by design, general in their capabilities and application. Here, we introduce a new system called FIRE (Fast Interpolated Runtime Ephemeris) that is designed for custom trajectory applications that favor speed and smooth derivatives. The new system minimizes the overhead associated with ephemeris calls through the use of archived splines, a runtime ephemeris (stored in random access memory of the computer), and batch processing routines. Further, our approach naturally provides first and second time derivatives for a small additional computational cost. The derivative capability is particularly attractive for optimization and targeting where smooth and accurate derivatives are important. Relative performance comparisons with the Jet Propulsion Laboratory's Spacecraft Planet Instrument C-matrix Events ephemeris system show typical speed improvements of approximately two orders of magnitude (250 times) for various state and orientation calls. Performance comparisons for high fidelity trajectory propagations are also considered and a factor of 70 in performance increase is achieved for typical cases. The new tool has potential value to any high precision application or software requiring fast, accurate, and smooth ephemeris data.

show abstract

Section: Ace Computationmentioning

confidence: 99%

A fast, accurate, and smooth planetary ephemeris retrieval system

Arora

Russell

2010

Celest Mech Dyn Astr

View full text Add to dashboard Cite

show abstract

“…This aspect can be usefully exploited for computation of discrete Hartley transform (DHT). As is well known, Hou [10], DHT can yield DFT, hence, the proposed structure becomes potential for computation of DCT, DST, DHT as well as DFT.…”

Section: Introductionmentioning

confidence: 95%

Discrete sine transform and its inverse—realization through recursive algorithms

Jain¹,

Kumar²,

Jain³

2007

Circuit Theory & Apps

View full text Add to dashboard Cite

show abstract

“…Above all, the discrete Hartley basis (DHB) has a similar analysis capacity as the fast Fourier transform (FFT) for dealing with harmonics [21] and a low correlation with the identity matrix [22]. In order to design a dictionary possessing discernibility in the time domain and the frequency domain, a combination of DHB and an identity matrix was constructed.…”

Section: Introductionmentioning

confidence: 99%

On the Application of Joint-Domain Dictionary Mapping for Multiple Power Disturbance Assessment

Cai

et al. 2018

Energies

View full text Add to dashboard Cite

This paper proposes a joint-domain dictionary mapping method to obtain high assessment accuracy of multiple power disturbances. Firstly, in order to achieve resolutions in both the time and frequency domains, a joint-domain dictionary is proposed which consists of a discrete Hartley base and an identity matrix. Due to the low correlation between the discrete Hartley base and the identity matrix, the joint-domain dictionary mapping can separately capture the approximations of the sinusoidal components and transients. Since the mapping coefficients contain the physical quantities, the eigenvalues of each component can be effectively estimated. A quantified eigenvalue classifier was designed for identifying power disturbances using the estimated eigenvalues. The proposed method was compared with several advanced methods through simulated power disturbances under different noise conditions, and actual data from the Institute of Electrical and Electronics Engineers Power and Energy Society database. The results reveal that the joint-domain dictionary mapping technique shows good performance on parameter estimation and recognition precision, even dealing with complicated multiple power disturbances.

show abstract

The Fast Hartley Transform Algorithm

Cited by 154 publications

References 18 publications

A fast, accurate, and smooth planetary ephemeris retrieval system

A fast, accurate, and smooth planetary ephemeris retrieval system

Discrete sine transform and its inverse—realization through recursive algorithms

On the Application of Joint-Domain Dictionary Mapping for Multiple Power Disturbance Assessment

Contact Info

Product

Resources

About