Probabilistically-Shaped DMT for IM-DD Systems with Low-Complexity Fast WHT-Based PDSP
Photonics, 2022 Transmission capacity and receiver sensitivity of an intensity-modulation direct detection (IM-DD) optical discrete multi-tone (DMT) system can be improved by using the probabilistically shaping (PS) technique.
Yi Liu +4 more
doaj +1 more source
Improvements on Making BKW Practical for Solving LWE
Cryptography, 2021 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
IET Communications, 2021 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
A New Algorithm for Solving Ring-LPN with a Reducible Polynomial [PDF]
, 2014 The LPN (Learning Parity with Noise) problem has recently proved to be of great importance in cryptology. A special and very useful case is the RING-LPN problem, which typically provides improved efficiency in the constructed cryptographic primitive.
Guo, Qian +2 more
core +1 more source
Design and Implementation of a Speller based on EMG Signal
International Journal of Computational Intelligence Systems, 2017 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
Wavelets and Wavelet Packets on Quantum Computers [PDF]
, 1999 We show how periodized wavelet packet transforms and periodized wavelet transforms can be implemented on a quantum computer. Surprisingly, we find that the implementation of wavelet packet transforms is less costly than the implementation of wavelet ...
Klappenecker, Andreas
core +2 more sources
Quantum Mechanics helps in searching for a needle in a haystack [PDF]
, 1997 Quantum mechanics can speed up a range of search applications over unsorted data. For example imagine a phone directory containing N names arranged in completely random order.
A. Elitzur +6 more
core +3 more sources
Fast computation of discrete Hartley transform via Walsh–Hadamard transform
Electronics Letters, 1987 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
Low computational complexity variable block size (VBS) partitioning for motion estimation using the Walsh Hadamard transform (WHT) [PDF]
, 2009 Variable Block Size (VBS) based motion estimation has been adapted in state of the art video coding, such as H.264/AVC, VC-1. However, a low complexity H.264/AVC encoder cannot take advantage of VBS due to its power consumption requirements.
Kim, Chanyul, O'Connor, Noel E.
core +1 more source
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform [PDF]
, 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