Results 41 to 50 of about 2,157,914 (307)

Optical full Hadamard matrix multiplexing and noise effects [PDF]

open access: yes, 2009
Hadamard multiplexing provides a considerable SNR boost over additive random noise but Poisson noise such as photon noise reduces the boost. We develop the theory for full H-matrix Hadamard transform imaging under additive and Poisson noise effects.
Burling-Claridge, G. Robert   +3 more
core   +2 more sources

Hadamard-transform spectral acquisition with an acousto-optic tunable filter in a broadband stimulated Raman scattering microscope.

open access: yesOptics Express, 2021
We present a novel configuration for high spectral resolution multiplexing acquisition based on the Hadamard transform in stimulated Raman scattering (SRS) microscopy.
L. Genchi   +4 more
semanticscholar   +1 more source

Using Hadamard transform for cryptanalysis of pseudo-random generators in stream ciphers [PDF]

open access: yesEAI Endorsed Transactions on Energy Web, 2020
In this work we discuss results obtained from an application of the Hadamard transform to cryptanalysis, andin particular, we determine the probability to decipher different pseudo-random number generators used ascomponents of stream ciphers.
Guillermo Sosa-Gómez   +2 more
doaj   +1 more source

Characterization of Basic 5-Value Spectrum Functions Through Walsh-Hadamard Transform

open access: yesIEEE Transactions on Information Theory, 2021
The first and the third authors recently introduced a spectral construction of plateaued and of 5-value spectrum functions. In particular, the design of the latter class requires a specification of integers $\{W(u):u\in \mathbb {F}^{n}_{2}\}$ , where ...
S. Hodžić, P. Horák, E. Pasalic
semanticscholar   +1 more source

Improved Subsampled Randomized Hadamard Transform for Linear SVM [PDF]

open access: yesAAAI Conference on Artificial Intelligence, 2020
Subsampled Randomized Hadamard Transform (SRHT), a popular random projection method that can efficiently project a d-dimensional data into r-dimensional space (r ≪ d) in O(dlog(d)) time, has been widely used to address the challenge of high ...
Zijian Lei, Liang Lan
semanticscholar   +1 more source

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform [PDF]

open access: yes, 2015
For every fixed constant $\alpha > 0$, we design an algorithm for computing the $k$-sparse Walsh-Hadamard transform of an $N$-dimensional vector $x \in \mathbb{R}^N$ in time $k^{1+\alpha} (\log N)^{O(1)}$.
Cheraghchi, Mahdi, Indyk, Piotr
core   +3 more sources

Reversible Hadamard transforms

open access: yesFacta universitatis - series: Electronics and Energetics, 2007
A coding method which reconstruct an original digital image without distortion is called "reversible coding". In case of the classical block transform coding (Cosine, Hadamard, Haar and etc) we have to make the number of levels of the transform coefficient very large in order to reconstruct the input signal with no distortion.
Hakob Sarukhanyan   +3 more
openaire   +2 more sources

Some Cryptographic Properties of Functions Based on their 2q-Nega-Hadamard Transform [PDF]

open access: yesInternational Journal of Mathematical, Engineering and Management Sciences
Negabent functions play a vital role in the field of cryptography and coding theory for designing secure cryptosystems. In this article, we investigate the various properties of 2q-nega-Hadamard transform (2q-NHT) of the functions from Z_q^n to Z_2q with
Deep Singh   +4 more
doaj   +1 more source

High Sensitivity Snapshot Spectrometer Based on Deep Network Unmixing

open access: yesSensors, 2020
Spectral detection provides rich spectral–temporal information with wide applications. In our previous work, we proposed a dual-path sub-Hadamard-s snapshot Hadamard transform spectrometer (Sub-s HTS).
Hui Xie   +4 more
doaj   +1 more source

Error suppression via complementary gauge choices in Reed-Muller codes [PDF]

open access: yes, 2017
Concatenation of two quantum error correcting codes with complementary sets of transversal gates can provide a means towards universal fault-tolerant computation.
Chamberland, Christopher   +1 more
core   +2 more sources

Home - About - Disclaimer - Privacy