A fast algorithm for computing the Hartley/ Fourier spectrum

Abstract

The tectono-sedimentary evolution of the Itararé Subgroup (Late Paleozoic) in the southern flank of the Ponta Grossa arch, States of Santa Catarina and Paraná, Brazil, is interpreted through stratigraphic analysis of outcropping beds. Its evolution seems to have been influenced by faulting causing rising and falling of the arch. The section analyzed runs some 50 km SE-NW, from Mafra (SC)-Rio Negro (PR) to Lapa (PR) and includes about 700 m thickness of glacio-clastic beds assigned to the Campo do Tenente and Mafra formations.

Matrix expansions for computing the discrete hartley transform for blocklength N ≡ 0 (mod 4)

“…The multiplicative complexity of the algorithms (Equations (4) and (5) can be computed, respectively, by (6) and…”

A flexible implementation of a matrix Laurent series-based 16-point fast Fourier and Hartley transforms

“…A lucid tutorial review of fast Fourier techniques is available in [15][16]. In 2000, an algorithm based on multilayer decomposition to calculate the DFT via the DHT was introduced [17][18]. This paper proposes a flexible implementation for the FFT and the Fast Hartley Transform (FHT), using a new approach, which is derived from a matrix-based Laurent series expansion [19].…”

A Matrix Laurent Series-based Fast Fourier Transform for Blocklengths N≡4 (mod 8)

“…Theorem (Heideman) ) In 2000, de Oliveira, Cintra, Campello de Souza [18,19], introduced an algorithm based on multilayer decomposition to calculate the DFT via the discrete Hartley transform (DHT), which meets the minimal complexity for blocklengths up to N=24 [20].…”