arXiv subjects

H. M. de Oliveira

Publications and source records attributed to H. M. de Oliveira.

At least 19 recordsLinked to original sources

arXiv2021

Von Mises Tapering: A New Circular Windowing

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

eess.SP↗

arXiv2021

Geometrical Representation for Number-theoretic Transforms

This short note introduces a geometric representation for binary (or ternary) sequences. The proposed representation is linked to multivariate data plotting according to the radar chart. As an illustrative example, the binary Hamming transform recently proposed is geometrically interpreted. It is shown that codewords of standard Hamming code $\mathcal{H}(N=7,k=4,d=3)$ are invariant vectors under the Hamming transform. These invariant are eigenvectors of the binary Hamming transform. The images are always inscribed in a regular polygon of unity side, resembling triangular rose petals and/or ``thorns''. A geometric representation of the ternary Golay transform, based on the extended Golay $\mathcal{G}(N=12, k=6, d=6)$ code over $\operatorname{GF}(3)$ is also showed. This approach is offered as an alternative representation of finite-length sequences over finite prime fields.

cs.IT↗

arXiv2020

Rounded Hartley Transform: A Quasi-involution

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.

eess.SP↗

arXiv2020

Infinite Sequences, Series Convergence and the Discrete Time Fourier Transform over Finite Fields

Digital Transforms have important applications on subjects such as channel coding, cryptography and digital signal processing. In this paper, two Fourier Transforms are considered, the discrete time Fourier transform (DTFT) and the finite field Fourier transform (FFFT). A finite field version of the DTFT is introduced and the FFFT is redefined with a complex kernel, which makes it a more appropriate finite field version of the Discrete Fourier Transform. These transforms can handle FIR and IIR filters defined over finite algebraic structures.

math.NT↗

arXiv2020

Multidimensional Wavelets for Scalable Image Decomposition: Orbital Wavelets

Wavelets are closely related to the Schrödinger's wave functions and the interpretation of Born. Similarly to the appearance of atomic orbital, it is proposed to combine anti-symmetric wavelets into orbital wavelets. The proposed approach allows the increase of the dimension of wavelets through this process. New orbital 2D-wavelets are introduced for the decomposition of still images, showing that it is possible to perform an analysis simultaneous in two distinct scales. An example of such an image analysis is shown.

eess.SP↗

arXiv2020

An Overview of Self-Similar Traffic: Its Implications in the Network Design

The knowledge about the true nature of the traffic in computer networking is a key requirement in the design of such networks. The phenomenon of self-similarity is a characteristic of the traffic of current client/server packet networks in LAN/WAN environments dominated by network technologies such as Ethernet and the TCP/IP protocol stack. The development of networks traffic simulators, which take into account this attribute, is necessary for a more realistic description the traffic on these networks and their use in the design of resources (contention elements) and protocols of flow control and network congestion. In this scenario it is recommended do not adopt standard traffic models of the Poisson type.

cs.NI↗

arXiv2020

A Vis-Spectrophotometer with a new topology of nanophotonic diffraction grating

This paper presents a new topology for photonic crystals to replace the monochromator, introducing them with a new alignment (the so-called extended Trinitron) to guide the chromatic pattern producing a spatial distribution similar to that of conventional diffraction gratings. The spectrophotometer uses a LED white light as light source instead of chambers with halogen lamps and mirrors. The system was designed using actual data from the manufacturer of photonic crystals and the total system response is compared against that one of a conventional spectrophotometer with a LED white light or tungsten bulb as a light source. It is shown that the spectral responses are similar in photonic panels containing more than twenty elements.

physics.app-ph↗

arXiv2019

ND-Wavelets Derived from Anti-symmetric Systems of Isolated Particles using the Determinant of Slater

Wavelets are known to be closely related to atomic orbital. A new approach of 2D, 3D and multidimensional wavelet system is proposed from a paralell with anti-symmetric systems of several isolated particles. The theory of fermionic states is used to generate new \textit{n}-dimensions wavelets, $n\ge2$, by the determinant of Slater. As pioneering paper in exchanging formalism between particle wave-functions and wavelets, it opens some perspectives for further adaptations derived from the physics of particles in the wavelet analysis scope.

eess.IV↗

arXiv2018

The Hamming and Golay Number-Theoretic Transforms

New number-theoretic transforms are derived from known linear block codes over finite fields. In particular, two new such transforms are built from perfect codes, namely the \textit {Hamming number-theoretic transform} and the \textit {Golay number-theoretic transform}. A few properties of these new transforms are presented.

cs.IT↗

arXiv2018

A Note on the Shannon Entropy of Short Sequences

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.

cs.IT↗

arXiv2018

A Kotel'nikov Representation for Wavelets

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.

math.CA↗

arXiv2017

Linear Computer-Music through Sequences over Galois Fields

It is shown how binary sequences can be associated with automatic composition of monophonic pieces. We are concerned with the composition of e-music from finite field structures. The information at the input may be either random or information from a black-and-white, grayscale or color picture. New e-compositions and music score are made available, including a new piece from the famous Lenna picture: the score of the e-music < > The corresponding stretch of music score are presented. Some particular structures, including clock arithmetic (mod 12), GF(7), GF(8), GF(13) and GF(17) are addressed. Further, multilevel block-codes are also used in a new approach of e-music composition, engendering a particular style as an e-composer. As an example, Pascal multilevel block codes recently introduced are handled to generate a new style of electronic music over GF(13).

cs.SD↗

arXiv2017

Understanding MIDI: A Painless Tutorial on Midi Format

A short overview demystifying the midi audio format is presented. The goal is to explain the file structure and how the instructions are used to produce a music signal, both in the case of monophonic signals as for polyphonic signals.

cs.SD↗

arXiv2017

Multiuser Communication Based on the DFT Eigenstructure

The eigenstructure of the discrete Fourier transform (DFT) is examined and new systematic procedures to generate eigenvectors of the unitary DFT are proposed. DFT eigenvectors are suggested as user signatures for data communication over the real adder channel (RAC). The proposed multiuser communication system over the 2-user RAC is detailed.

cs.IT↗

arXiv2016

Performance Assessment of WhatsApp and IMO on Android Operating System (Lollipop and KitKat) during VoIP calls using 3G or WiFi

This paper assesses the performance of mobile messaging and VoIP connections. We investigate the CPU usage of WhatsApp and IMO under different scenarios. This analysis also enabled a comparison of the performance of these applications on two Android operating system (OS) versions: KitKat or Lollipop. Two models of smartphones were considered, viz. Galaxy Note 4 and Galaxy S4. The applications behavior was statistically investigated for both sending and receiving VoIP calls. Connections have been examined over 3G and WiFi. The handset model plays a decisive role in CPU usage of the application. t-tests showed that IMO has a better performance that WhatsApp whatever be the Android at a significance level 1%, on Galaxy Note 4. In contrast, WhatsApp requires less CPU than IMO on Galaxy S4 whatever be the OS and access (3G/WiFi). Galaxy Note 4 using WiFi always outperformed S4 in terms of processing efficiency.

cs.PF↗

arXiv2016

A New Information Theoretical Concept: Information-Weighted Heavy-tailed Distributions

Given an arbitrary continuous probability density function, it is introduced a conjugated probability density, which is defined through the Shannon information associated with its cumulative distribution function. These new densities are computed from a number of standard distributions, including uniform, normal, exponential, Pareto, logistic, Kumaraswamy, Rayleigh, Cauchy, Weibull, and Maxwell-Boltzmann. The case of joint information-weighted probability distribution is assessed. An additive property is derived in the case of independent variables. One-sided and two-sided information-weighting are considered. The asymptotic behavior of the tail of the new distributions is examined. It is proved that all probability densities proposed here define heavy-tailed distributions. It is shown that the weighting of distributions regularly varying with extreme-value index $α> 0$ still results in a regular variation distribution with the same index. This approach can be particularly valuable in applications where the tails of the distribution play a major role.

math.ST↗

arXiv2015

Multilayer Hadamard Decomposition of Discrete Hartley Transforms

Discrete transforms such as the discrete Fourier transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in signal processing. The successful application of transform techniques relies on the existence of the so-called fast transforms. In this paper some fast algorithms are derived which meet the lower bound on the multiplicative complexity of the DFT/DHT. The approach is based on a decomposition of the DHT into layers of Walsh-Hadamard transforms. In particular, fast algorithms for short block lengths such as $N \in \{4, 8, 12, 24\}$ are presented.

cs.DS↗

arXiv2015

Efficient Multiplex for Band-Limited Channels: Galois-Field Division Multiple Access

A new Efficient-bandwidth code-division-multiple-access (CDMA) for band-limited channels is introduced which is based on finite field transforms. A multilevel code division multiplex exploits orthogonality properties of nonbinary sequences defined over a complex finite field. Galois-Fourier transforms contain some redundancy and just cyclotomic coefficients are needed to be transmitted yielding compact spectrum requirements. The primary advantage of such schemes regarding classical multiplex is their better spectral efficiency. This paper estimates the \textit{bandwidth compactness factor} relatively to Time Division Multiple Access TDMA showing that it strongly depends on the alphabet extension. These multiplex schemes termed Galois Division Multiplex (GDM) are based on transforms for which there exists fast algorithms. They are also convenient from the implementation viewpoint since they can be implemented by a Digital Signal Processor.

cs.IT↗