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 M… Show more
A new fast algorithm for computing the discrete Hartley transform (DHT) is presented, which is based on the expansion of the transform matrix. The algorithm presents a better performance, in terms of multiplicative complexity, than previously known fast Hartley transform algorithms and same performance, in terms of additive complexity, as the Split-Radix algorithm. A detailed description of the computation of DHTs with blocklengths 8 and 16 is shown. The algorithm is very attractive for blocklengths N ≥ 128.
A new fast algorithm for computing the discrete Hartley transform (DHT) is presented, which is based on the expansion of the transform matrix. The algorithm presents a better performance, in terms of multiplicative complexity, than previously known fast Hartley transform algorithms and same performance, in terms of additive complexity, as the Split-Radix algorithm. A detailed description of the computation of DHTs with blocklengths 8 and 16 is shown. The algorithm is very attractive for blocklengths N ≥ 128.
“…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].…”
This paper describes a flexible architecture for implementing a new fast computation of the discrete Fourier and Hartley transforms, which is based on a matrix Laurent series. The device calculates the transforms based on a single bit selection operator. The hardware structure and synthesis are presented, which handled a 16-point fast transform in 65 nsec, with a Xilinx SPARTAN 3E device.
“…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].…”
General guidelines for a new fast computation of blocklength 8m+4 DFTs are presented, which is based on a Laurent series involving matrices. Results of non-trivial real multiplicative complexity are presented for blocklengths N≤64, achieving lower multiplication counts than previously published FFTs. A detailed description for the cases m=1 and m=2 is presented.Resumo-Linhas gerais de uma nova transformada rápida de Fourier para seqüências de comprimento 8m+4, baseada em séries matriciais de Laurent, são apresentadas. Resultados de complexidade expressos em multiplicações reais não-triviais são apresentados para comprimentos de bloco inferiores a 65, exigindo menos multiplicações do que FFTs prévias. Uma descrição detalhada do algoritmo é feita para os casos em que m=1 e m=2.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.