Search

Discrete and continuous standard windowing are revisited and a a new taper is introduced, which is derived from the normal circular distribution by von Mises. Both the continuous-time and the discrete-time windows are considered, and their spectra obtained. A brief comparison with further classical window families is performed in terms of their properties in the spectral domain. These windows can be used in spectral analysis, and in particular, in the design of FIR (finite impulse response) filters as an alternative to the Kaiser window, Comment: 6 figures. arXiv admin note: substantial text overlap with arXiv:1806.10273

A new multiplication-free transform derived from DHT is introduced: the RHT. Investigations on the properties of the RHT led us to the concept of weak-inversion. Using new constructs, we show that RHT is not involutional like the DHT, but exhibits quasi-involutional property, a new definition derived from the periodicity of matrices. Thus instead of using the actual inverse transform, the RHT is viewed as an involutional transform, allowing the use of direct (multiplication-free) to evaluate the inverse. A fast algorithm to compute RHT is presented. This algorithm show embedded properties. We also extended RHT to the two-dimensional case. This permitted us to perform a preliminary analysis on the effects of RHT on images. Despite of some SNR loss, RHT can be very interesting for applications involving image monitoring associated to decision making, such as military applications or medical imaging., Comment: 6 pages. Manuscript originally published in 2002 at the International Telecommunications Symposium ITS 2002. Readers are encouraged to access newer results at arXiv:2007.02232

For source sequences of length L symbols we proposed to use a more realistic value to the usual benchmark of number of code letters by source letters. Our idea is based on a quantifier of information fluctuation of a source, F(U), which corresponds to the second central moment of the random variable that measures the information content of a source symbol. An alternative interpretation of typical sequences is additionally provided through this approach., Comment: 3 figures

This paper presents a wavelet representation using baseband signals, by exploiting Kotel'nikov results. Details of how to obtain the processes of envelope and phase at low frequency are shown. The archetypal interpretation of wavelets as an analysis with a filter bank of constant quality factor is revisited on these bases. It is shown that if the wavelet spectral support is limited into the band $[f_m,f_M]$, then an orthogonal analysis is guaranteed provided that $f_M \leq 3f_m$, a quite simple result, but that invokes some parallel with the Nyquist rate. Nevertheless, in cases of orthogonal wavelets whose spectrum does not verify this condition, it is shown how to construct an "equivalent" filter bank with no spectral overlapping., Comment: 6 pages, 15 figures

This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general, than the well known Goertzel Algorithm., Comment: 4 pages, 3 figures, 1 table. In: 10th International Symposium on Communication Theory and Applications, Ambleside, UK

Shape-invariant signals under the Discrete Fourier Transform are investigated, leading to a class of eigenfunctions for the unitary discrete Fourier operator. Such invariant sequences (eigensequences) are suggested as user signatures over the real adder channel (t-RAC) and a multiuser communication system over the t-RAC is presented., Comment: 6 pages, 1 figure, 1 table. VI International Telecommunications Symposium (ITS2006)

This paper presents the foundations of a computer oriented approach for preparing a list of random treatment assignments to be adopted in randomised controlled trials. Software is presented which can be applied in the earliest stage of clinical trials and bioequivalence assays. This allocation of patients to treatment in clinical trials ensures exactly equal treatment numbers. The investigation of the randomness properties of an assignment leads to the concept of a 'strong randomised list'. The new approach introduced in this note is based on thresholds and produces a strong randomised list of treatment assignments., Comment: 8 pages. XIV Reuniao Anual da Federacao de Sociedades de Biologia Experimental FeSBE, Caxamb\'u, Brazil, 1999

A relationship between the Riemann zeta function and a density on integer sets is explored. Several properties of the examined density are derived., Comment: 7 pages, 5 figures; VII Encontro Regional de Matem\'atica Aplicada e Computacional, 2007, Recife

In this paper a variant of the classical hierarchical cluster analysis is reported. This agglomerative (bottom-up) cluster technique is referred to as the Adaptive Mean-Linkage Algorithm. It can be interpreted as a linkage algorithm where the value of the threshold is conveniently up-dated at each interaction. The superiority of the adaptive clustering with respect to the average-linkage algorithm follows because it achieves a good compromise on threshold values: Thresholds based on the cut-off distance are sufficiently small to assure the homogeneity and also large enough to guarantee at least a pair of merging sets. This approach is applied to a set of possible substituents in a chemical series., Comment: 4 pages, 2 figures, 2 tables. Congresso Brasileiro de Automatica CBA, Natal, RN, Brazil, 2002

New continuous wavelets of compact support are introduced, which are related to the beta distribution. They can be built from probability distributions using 'blur'derivatives. These new wavelets have just one cycle, so they are termed unicycle wavelets. They can be viewed as a soft variety of Haar wavelets whose shape is fine-tuned by two parameters a and b. Close expressions for beta wavelets and scale functions as well as their spectra are derived. Their importance is due to the Central Limit Theorem applied for compactly supported signals., Comment: 7 pages, 4 figures. Journal of Communication and Information Systems, former Journal of the Brazilian Telecommunications Society, ISSN 1980-6604 pp.105-111

In continuous-time wavelet analysis, most wavelet present some kind of symmetry. Based on the Fourier and Hartley transform kernels, a new wavelet multiresolution analysis is proposed. This approach is based on a pair of orthogonal wavelet functions and is named as the Fourier-Like and Hartley-Like wavelet analysis. A Hilbert transform analysis on the wavelet theory is also included., Comment: 7 pages, 10 figures, Anais do XXII Simp\'osio Brasileiro de Telecomunica\c{c}\~oes, Campinas, 2005

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)., Comment: 6 pages, 6 figures, 1 table In: Computational Methods in Circuits and Systems Applications, WSEAS press, pp.211-215, 2003. ISBN: 960-8052-88-2

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., Comment: 10 pages, 4 figures, 2 tables, International Conference on System Engineering, Communications and Information Technologies, 2001, Punta Arenas. ICSECIT 2001 Proceedings. Punta Arenas: Universidad de Magallanes, 2001

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., Comment: 5 pages, 7 figures

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., Comment: 10 pages, 2 figures

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., Comment: 18 pages, 6 figures