arXiv subjects
Publications and source records attributed to H. M. de Oliveira.
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.
Pointwise-supported generalized wavelets are introduced, based on Dirac, doublet and further derivatives of delta. A generalized biorthogonal analysis leads to standard Taylor series and new Dual-Taylor series that may be interpreted as Laurent Schwartz distributions. A Parseval-like identity is also derived for Taylor series, showing that Taylor series support an energy theorem. New representations for signals called derivagrams are introduced, which are similar to spectrograms. This approach corroborates the impact of wavelets in modern signal analysis.
The Phasor diagrams have long been used in Physics and Engineering. In telecommunications, this is particularly useful to clarify how the modulations work. This paper addresses rotating phasor pathways derived from different standard Amplitude Modulation Systems (e.g. A3E, H3E, J3E, C3F). A cornucopia of algebraic curves is then derived assuming a single tone or a double tone modulation signal. The ratio of the frequency of the tone modulator (fm) and carrier frequency (fc) is considered in two distinct cases, namely: fm/fc<1 and fm/fc>=1. The geometric figures are some sort of Lissajours figures. Different shapes appear looking like epicycloids (including cardioids), rhodonea curves, Lemniscates, folium of Descartes or Lamé curves. The role played by the modulation index is elucidated in each case.
This paper presents the preliminary of a novel scheme of steganography, and introduces the idea of combining two secret keys in the operation. The first secret key encrypts the text using a standard cryptographic scheme (e.g. IDEA, SAFER+, etc.) prior to the wavelet audio decomposition. The way in which the cipher text is embedded in the file requires another key, namely a stego-key, which is associated with features of the audio wavelet analysis.
This paper offers a new regard on compactly supported wavelets derived from FIR filters. Although being continuous wavelets, analytical formulation are lacking for such wavelets. Close approximations for daublets (Daubechies wavelets) and their spectra are introduced here. The frequency detection properties of daublets are investigated through scalograms derived from these new analytical expressions. These near-daublets have been implemented on the Matlab wavelet toolbox and a few scalograms presented. This approach can be valuable for wavelet synthesis from hardware or for application involving continuous wavelet-based systems, such as wavelet OFDM.
A new family of wavelets is introduced, which is associated with Legendre polynomials. These wavelets, termed spherical harmonic or Legendre wavelets, possess compact support. The method for the wavelet construction is derived from the association of ordinary second order differential equations with multiresolution filters. The low-pass filter associated with Legendre multiresolution analysis is a linear phase finite impulse response filter (FIR).
A new transform over finite fields, the finite field Hartley transform (FFHT), was recently introduced and a number of promising applications on the design of efficient multiple access systems and multilevel spread spectrum sequences were proposed. The FFHT exhibits interesting symmetries, which are exploited to derive tailored fast transform algorithms. The proposed fast algorithms are based on successive decompositions of the FFHT by means of Hadamard-Walsh transforms (HWT). The introduced decompositions meet the lower bound on the multiplicative complexity for all the cases investigated. The complexity of the new algorithms is compared with that of traditional algorithms.
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient fast transforms. In this paper some fast algorithms are derived. The theoretical lower bound on the multiplicative complexity for the DFT/DHT are achieved. The approach is based on the factorization of DHT matrices. Algorithms for short blocklengths such as $N \in \{3, 5, 6, 12, 24 \}$ are presented.
Fragile digital watermarking has been applied for authentication and alteration detection in images. Utilizing the cosine and Hartley transforms over finite fields, a new transform domain fragile watermarking scheme is introduced. A watermark is embedded into a host image via a blockwise application of two-dimensional finite field cosine or Hartley transforms. Additionally, the considered finite field transforms are adjusted to be number theoretic transforms, appropriate for error-free calculation. The employed technique can provide invisible fragile watermarking for authentication systems with tamper location capability. It is shown that the choice of the finite field characteristic is pivotal to obtain perceptually invisible watermarked images. It is also shown that the generated watermarked images can be used as publicly available signature data for authentication purposes.
Many continuous wavelets are defined in the frequency domain and do not have analytical expressions in the time domain. Meyer wavelet is ordinarily defined in this way. In this note, we derive new straightforward analytical expressions for both the wavelet and scale function for the Meyer basis. The validity of these expressions is corroborated by numerical computations, yielding no approximation error.
A new algorithm for voice automatic syllabic splitting in the Portuguese language is proposed, which is based on the envelope of the speech signal of the input audio file. A computational implementation in MatlabTM is presented and made available at the URL http://www2.ee.ufpe.br/codec/divisao_silabica.html. Due to its straightforwardness, the proposed method is very attractive for embedded systems (e.g. i-phones). It can also be used as a screen to assist more sophisticated methods. Voice excerpts containing more than one syllable and identified by the same envelope are named as super-syllables and they are subsequently separated. The results indicate which samples corresponds to the beginning and end of each detected syllable. Preliminary tests were performed to fifty words at an identification rate circa 70% (further improvements may be incorporated to treat particular phonemes). This algorithm is also useful in voice command systems, as a tool in the teaching of Portuguese language or even for patients with speech pathology.
Looking forward to introducing an analysis in Galois Fields, discrete functions are considered (such as transcendental ones) and MacLaurin series are derived by Lagrange's Interpolation. A new derivative over finite fields is defined which is based on the Hasse Derivative and is referred to as negacyclic Hasse derivative. Finite field Taylor series and alpha-adic expansions over GF(p), p prime, are then considered. Applications to exponential and trigonometric functions are presented. Theses tools can be useful in areas such as coding theory and digital signal processing.
This paper presents a novel adaptive-filter approach for predicting assets on the stock markets. Concepts are introduced here, which allow understanding this method and computing of the corresponding forecast. This approach is applied, as an example, through the prediction over the actual valuation of the PETR3 shares (Petrobras ON) traded in the Brazilian Stock Market. The first-rate choices of the window length and the number of filter coefficient are evaluated. This is done by observing the correlation between the predictor signal and the actual course performed by the market in terms of both the window prevision length and filter coefficient values. It is shown that such adaptive predictors furnish, on the average, very substantial profit on the invested amount.
This note introduces a new family of wavelets and a multiresolution analysis, which exploits the relationship between analysing filters and Floquet's solution of Mathieu differential equations. The transfer function of both the detail and the smoothing filter is related to the solution of a Mathieu equation of odd characteristic exponent. The number of notches of these filters can be easily designed. Wavelets derived by this method have potential application in the fields of Optics and Electromagnetism.
In this paper we introduce a new family of wavelets, named Chebyshev wavelets, which are derived from conventional first and second kind Chebyshev polynomials. Properties of Chebyshev filter banks are investigated, including orthogonality and perfect reconstruction conditions. Chebyshev wavelets have compact support, their filters possess good selectivity, but they are not orthogonal. The convergence of the cascade algorithm of Chebyshev wavelets is proved by using properties of Markov chains. Computational implementation of these wavelets and some clear-cut applications are presented. Proposed wavelets are suitable for signal denoising.