Improvements on Making BKW Practical for Solving LWE
The learning with errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum–Kalai–Wasserman (BKW) algorithm. This paper presents new improvements of BKW-
Alessandro Budroni +4 more
doaj +1 more source
A new FWHT‐CMF‐DFE based approach for channel equalization in CP‐free OFDM systems
Orthogonal frequency division multiplexing (OFDM) has been widely used in wireless communication systems due to its robustness against the frequency selectivity of fading channels. It provides optimal performance and it also meets the requirements of the
Gazihan Aykırı +3 more
doaj +1 more source
Design and Implementation of a Speller based on EMG Signal
A speller is a communication device designed for those suffering from neuromuscular disorders having difficulty to speak. An EMG based design is proposed which uses eye blinks for character selection that offers high accuracy and more comfort to the user.
P M Shyam Prasad +3 more
doaj +1 more source
SPRIGHT: A Fast and Robust Framework for Sparse Walsh-Hadamard Transform
We consider the problem of computing the Walsh-Hadamard Transform (WHT) of some $N$-length input vector in the presence of noise, where the $N$-point Walsh spectrum is $K$-sparse with $K = {O}(N^δ)$ scaling sub-linearly in the input dimension $N$ for some ...
Xiao Li 0022 +3 more
openaire +3 more sources
Registration of Brain Images using Fast Walsh Hadamard Transform
A lot of image registration techniques have been developed with great significance for data analysis in medicine, astrophotography, satellite imaging and few other areas. This work proposes a method for medical image registration using Fast Walsh Hadamard transform. This algorithm registers images of the same or different modalities.
D. Sasikala, R. Neelaveni
openaire +4 more sources
A Blind Video Copyright Protection Technique in Maximum and Minimum Energy Frames Based on The Fast Walsh Hadamard Transform (FWHT) and Discrete Wavelet Transform (DWT) and Arnold Map [PDF]
Video copyright protection is the most generally acknowledged method of preventing data piracy. This paper proposes a blind video copyright protection technique based on the Fast Walsh Hadamard Transform (FWHT), Discrete Wavelet Transform (DWT), and ...
Laftah, Muna M., Resen, Mohammed S.
core
Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs)
No description ...
Boussakta S, Holt AGJ
openaire +2 more sources
Optical full Hadamard matrix multiplexing and noise effects [PDF]
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.
Streeter, Lee +4 more
core +1 more source
Fast computation of discrete Hartley transform via Walsh–Hadamard transform
A new fast algorithm is proposed to compute the discrete Hartley transform (DHT) via the Walsh-Hadamard transform (WHT). The processing is carried out on an interframe basis in (N × N) data blocks, where N is an integer power of two. The WHT coefficients are obtained directly, and then used to obtain the DHT coefficients.
Hsu, C. Y., Wu, Ja-Ling
openaire +1 more source
Matrix Factorization and Some Fast Discrete Transforms
In this paper, three discrete transforms related to vector spaces over finite fields are studied. For our purposes, and according to the properties of the finite fields, the most suitable transforms are as follows: for binary fields, this is the Walsh ...
Iliya Bouyukliev +2 more
doaj +1 more source

