ScholarLens Back to search
1985•Electronics LettersRequires access

Fast Hartley transform algorithm

Hans-Jürgen Meckelburg, D. Lipka

Open publisher page 45 citations

Abstract

The discrete Hartley transform is a new tool for the analysis, design and implementation of digital signal processing algorithms and systems. It is strictly symmetrical concerning the transformation and its inverse. A new fast Hartley transform algorithm has been developed. Applied to real signals, it is faster than a real fast Fourier transform, especially in the case of the inverse transformation. The speed of operation for a fast convolution can thus be increased.

About this research paper

What this paper is about

The discrete Hartley transform is a new tool for the analysis, design and implementation of digital signal processing algorithms and systems. It is strictly symmetrical concerning the transformation and its inverse. A new fast Hartley transform algorithm has been developed. Applied to real signals, it is faster than a real fast Fourier transform, especially in the case of the inverse transformation. The speed of operation for a fast convolution can thus be increased.

Why it matters

OpenAlex reports 45 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The discrete Hartley transform is a new tool for the analysis, design and implementation of digital signal processing algorithms and systems. It is strictly symmetrical concerning the transformation and its inverse. A new fast Hartley transform algorithm has been developed. Applied to real signals, it is faster than a real fast Fourier transform, especially in the case of the inverse transformation. The speed of operation for a fast convolution can thus be increased.

Key concepts: Hartley transform, Discrete Hartley transform, Algorithm, Discrete Fourier transform (general), Convolution (computer science), Transformation (genetics), Inverse, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Fast Hartley transform algorithm — Research Paper | ScholarLens