2009 International Conference on Signal Processing Systems 2009
DOI: 10.1109/icsps.2009.150
|View full text |Cite
|
Sign up to set email alerts
|

Haar Transformation of Linear Boolean Function

Abstract: Haar transform is known to have the smallest computational requirement with a considerable interest and attraction drawn towards its spectral properties of Boolean functions. This paper presents Haar transform of Linear Boolean functions, where by the discussion is based on the transformation from the Boolean domain to the Haar domain. The resulting spectrum is given with the corresponding calculations presented, while the analysis of the respective spectral coefficients and their general properties being expl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
4
0
2

Year Published

2012
2012
2016
2016

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 7 publications
0
4
0
2
Order By: Relevance
“…The HAAR algorithm is a multiresolution wavelet transform [18]. The Haar descriptor is mainly used in pattern recognition and image processing [19]. It is also appropriate in communication technologies for data encoding, multiplexing and digital filtering.…”
Section: Features Extractionmentioning
confidence: 99%
See 1 more Smart Citation
“…The HAAR algorithm is a multiresolution wavelet transform [18]. The Haar descriptor is mainly used in pattern recognition and image processing [19]. It is also appropriate in communication technologies for data encoding, multiplexing and digital filtering.…”
Section: Features Extractionmentioning
confidence: 99%
“…It is also appropriate in communication technologies for data encoding, multiplexing and digital filtering. The HAAR functions are widely applied in numerical calculations because they produce a uniform function system approximation of a function system with various arguments [19].…”
Section: Features Extractionmentioning
confidence: 99%
“…Essa transformadaé usada principalmente para reconhecimento de padrões e processamento de imagens [10], sendo também adequada em tecnologias de comunicação para codificação de dados, multiplexação e filtragem digital.…”
Section: B Haar Waveletunclassified
“…As funções Haar são amplamente aplicadas em cálculos numéricos, uma vez que produz uma aproximação uniforme de um sistema de funções com n argumentos [10]. Sendo S n um vetor 1-D. O algoritmo Haar consiste em calcular a média M n/2 para cada par em S n e a diferença média D n/2 em cada par, os quais são definidos na Equação 6.…”
Section: B Haar Waveletunclassified
“…These two methods are well known as fast-Fourier-transform (FFT) like methods [22][23][24][25][26]. It was also shown in [27], that there is a correlation between the Haar spectrum of a linear Boolean function and the Walsh functions which happens to be the rows of the Hadamard matrix.…”
Section: A the Haar Spectrummentioning
confidence: 99%