Implementación en sistemas embebidos de la transformada discreta de Hartley
AbstractOrthogonal transformations have been very useful in the characterization and signal processing. In particular Hartley Transform allows for time-frequency representations and vice versa. This paper presents an algorithm for calculating the Discrete Hartley Transform in embedded systems with the objective of minimizing the computational load and storage capacity required. It exploits the similarity with the Discrete Fourier Transform to use a fast algorithm reduces the number of trigonometric functions calculated using the rotation factors (Twiddle factors). In general, the implementation can increase the size of the processing window and increase computational speed compared to direct calculation.
This journal uses Crossref's Cited-By and Reference Linking, so that we can display the citations registered in Crossref here.
This document does not have Crossref citations yet.