Can we characterize the wavelets through linear transformation? the answer for this question is certainly YES. In this paper we have characterized the Haar wavelet matrix by their linear transformation and proved some theorems on properties of Haar wavelet matrix such as Trace, eigenvalue and eigenvector and diagonalization of a matrix.

In this paper, a minimization of Haar wavelet series for simplification of circuits and Haar based decision diagrams representing discrete multiple-valued functions is proposed. The minimization is performed by permutation of indices of generalized Haar functions. Experimental results show that this method provides reasonable reduction in the number of non-zero coefficients. The Haar series red...

We give a new generalization for Haar functions. The generalization starts from the Walsh-like functions and based on the connection between the original Walsh and Haar systems. We generalize the Haar– Fourier Transform too.

In this article,we present a wavelet method for solving stochastic Volterra integral equations based on Haar wavelets. First, we approximate all functions involved in the problem by Haar Wavelets then, by substituting the obtained approximations in the problem, using the It^{o} integral formula and collocation points then, the main problem changes into a system of linear or nonlinear equation w...

The new class of weights called A p weights is introduced. We prove that a characterization and an unconditional basis of the weighted Lp space Lp(Rn,w(x)dx) with w ∈ A p (1 < p < ∞) are given by the Haar wavelets and the Haar scaling function. As an application of these results, we establish a greedy basis by using the Haar wavelets and the Haar scaling function again.

Unnormalized Haar spectra and Ordered Binary Decision Diagrams (OBDDs) are two standard representations of Boolean functions used in logic design. In this article, mutual relationships between those two representations have been derived. The method of calculating the Haar spectrum from OBDD has been presented. The decomposition of the Haar spectrum, in terms of the cofactors of Boolean function...

We prove that in Polish, abelian, non-locally-compact groups the family of Haar null sets of Christensen does not fulfil the countable chain condition, that is, there exists an uncountable family of pairwise disjoint universally measurable sets which are not Haar null. (Dougherty, answering an old question of Christensen, showed earlier that this was the case for some Polish, abelian, non-local...

Let f : X → Y be a based map of simply connected spaces. The corresponding evaluation map ω : map(X, Y ; f)→ Y induces a homomorphism of homotopy groups whose image in πn(Y ) is called the nth evaluation subgroup of f . The nth Gottlieb group of X occurs as the special case in which Y = X and f = 1X . We identify the homomorphism induced on rational homotopy groups by this evaluation map, in te...

An orthogonal Haar scattering transform is a deep network computed with a hierarchy of additions, subtractions and absolute values over pairs of coefficients. Unsupervised learning optimizes Haar pairs to obtain sparse representations of training data with an algorithm of polynomial complexity. For signals defined on a graph, a Haar scattering is computed by cascading orthogonal Haar wavelet tr...