# Walsh Sampling with Incomplete Noisy Signals

@article{Lu2018WalshSW,
title={Walsh Sampling with Incomplete Noisy Signals},
author={Yi Janet Lu},
journal={ArXiv},
year={2018},
volume={abs/1602.00095}
}
• Y. Lu
• Published 30 January 2016
• Mathematics, Computer Science
• ArXiv
With the advent of massive data outputs at a regular rate, admittedly, signal processing technology plays an increasingly key role. Nowadays, signals are not merely restricted to physical sources, they have been extended to digital sources as well. Under the general assumption of discrete statistical signal sources, we propose a practical problem of sampling incomplete noisy signals for which we do not know a priori and the sampling size is bounded. We approach this sampling problem by Shannon…
4 Citations

## Figures, Tables, and Topics from this paper

New Results on the DMC Capacity and Renyi's Divergence
• Y. Lu
• Computer Science, Mathematics
ArXiv
• 2017
This work is concerned with analytical results of channel capacity in the new setting, and studies both the Blahut-Arimoto algorithm and the most recent results for the transition matrix of $N\times M$.
Walsh-Hadamard Transform and Cryptographic Applications in Bias Computing
• Computer Science
IACR Cryptol. ePrint Arch.
• 2016
This paper gives a closed-form exact solution for the correlation involving the multiple polynomial of any weight for the first time and shows that Walsh analysis is useful and effective to a broad class of cryptanalysis problems.
• Y. Lu
• Computer Science
2016 Future Technologies Conference (FTC)
• 2016
This work is believed to shed light on noisy sparse WHT, which remains to be a big open challenge, and will help to study parallel data-intensive computing, which has a broad range of applications.
Efficient Estimation of Pauli Channels
• Mathematics, Physics
• 2019
Pauli channels are ubiquitous in quantum information, both as a dominant noise source in many computing architectures and as a practical model for analyzing error correction and fault tolerance.

## References

SHOWING 1-10 OF 31 REFERENCES
Walsh transforms and cryptographic applications in bias computing
• Mathematics, Computer Science
Cryptography and Communications
• 2015
This work gives a closed-form exact solution for the correlation involving the multiple polynomial of any weight for the first time and shows that Walsh analysis is useful and effective to a broad class of cryptanalysis problems.
Robust sublinear complexity Walsh-Hadamard transform with arbitrary sparse support
• Mathematics, Computer Science
2015 IEEE International Symposium on Information Theory (ISIT)
• 2015
Algorithms for computing Walsh-Hadamard transform with arbitrary K-sparse support with inherent connection to coding over a binary symmetric channel or a binary-input additive white Gaussian noise channel to obtain the transform-domain signal with sublinear complexity.
The SPRIGHT algorithm for robust sparse Hadamard Transforms
• Mathematics, Computer Science
2014 IEEE International Symposium on Information Theory
• 2014
It is shown that the K-sparse HT of the signal can be reconstructed from noisy time domain samples with a vanishing error probability using the same sample complexity O(K logN) as in the noiseless case of [1] and computational complexity1 O(N logN).
SPRIGHT: A Fast and Robust Framework for Sparse Walsh-Hadamard Transform
• Mathematics, Computer Science
ArXiv
• 2015
It is shown that there is no extra price that needs to be paid for being robust to noise other than a constant factor, and the same sample complexity and computational complexity can be maintained as those of the noiseless case using the SParse Robust Iterative Graph-based Hadamard Transform (SPRIGHT) algorithm.
Fast Correlation Attacks over Extension Fields, Large-Unit Linear Approximation and Cryptanalysis of SNOW 2.0
• Computer Science, Mathematics
CRYPTO
• 2015
An efficient algorithm to compute the large-unit distribution of a broad class of functions is proposed, which allows to find better linear approximations than the bitwise ones with low complexity in symmetric-key primitives.
Computation of channel capacity and rate-distortion functions
• R. Blahut
• Mathematics, Computer Science
IEEE Trans. Inf. Theory
• 1972
A simple algorithm for computing channel capacity is suggested that consists of a mapping from the set of channel input probability vectors into itself such that the sequence of probability vectors generated by successive applications of the mapping converges to the vector that achieves the capacity of the given channel.
Fast correlation attacks on certain stream ciphers
• Mathematics, Computer Science
Journal of Cryptology
• 2005
Two new correlation attacks are presented to determine the initial digits of a, provided that the numbert of feedback taps is small, and are demonstrated to be successful against shift registers of considerable lengthk (typically,k=1000).
An Introduction To Statistical Signal Processing
• Computer Science
• 2004
This volume describes the essential tools and techniques of statistical signal processing and offers a wide variety of examples of the most popular random process models and their basic uses and properties.
An algorithm for computing the capacity of arbitrary discrete memoryless channels
• S. Arimoto
• Mathematics, Computer Science
IEEE Trans. Inf. Theory
• 1972
A systematic and iterative method of computing the capacity of arbitrary discrete memoryless channels is presented and a few inequalities that give upper and lower bounds on the capacity are derived.
A Fast Hadamard Transform for Signals With Sublinear Sparsity in the Transform Domain
• Mathematics, Computer Science
IEEE Trans. Inf. Theory
• 2015
A new iterative low-complexity algorithm for computing the Walsh–Hadamard transform (WHT) of an $N$ dimensional signal with a $K$ -sparse WHT based on the subsampling (aliasing) property of the WHT, where a suitable aliasing pattern is induced in the transform domain.