Pauli decomposition via the fast Walsh-Hadamard transform [PDF]
New Journal of PhysicsThe decomposition of a square matrix into a sum of Pauli strings is a classical pre-processing step required to realize many quantum algorithms. Such a decomposition requires significant computational resources for large matrices. We present an exact and
Timothy N Georges +3 more
doaj +2 more sources
A Novel Transfer Learning-Based Hybrid EEG-fNIRS Brain-Computer Interface for Intracerebral Hemorrhage Rehabilitation. [PDF]
Adv Sci (Weinh)The study has developed the first clinically validated hybrid EEG‐fNIRS brain‐computer interface fusion framework that systematically overcomes cross‐subject generalization barriers through a novel Wasserstein metric‐driven neural template selection mechanism.
Chen D +18 more
europepmc +2 more sources
Parallel Hardware Implementation of Walsh Hadamard Transform [PDF]
, 2022 The Walsh Hadamard Transform is a powerful notion in digital signal processing. This paper explains the construction of parallel hardware architecture using the mathematical concept of Kronecker product based approach to Walsh Hadamard Transform and its ...
Naskar, Mrinal Kanti; Department of ETCE, Jadavpur University, Kolkata 700 032, West Bengal, India +4 more
core +3 more sources
New fast Walsh–Hadamard–Hartley transform algorithm [PDF]
, 2023 This paper presents an efficient fast Walsh–Hadamard–Hartley transform (FWHT) algorithm that incorporates the computation of the Walsh-Hadamard transform (WHT) with the discrete Hartley transform (DHT) into an orthogonal, unitary single fast transform ...
Hamood, Mounir Taha +3 more
core +1 more source
New Orthogonal Transforms for Signal and Image Processing
Applied Sciences, 2021 In the paper, orthogonal transforms based on proposed symmetric, orthogonal matrices are created. These transforms can be considered as generalized Walsh–Hadamard Transforms.
Andrzej Dziech
doaj +1 more source
Fast Transformations with Walsh-Hadamard Functions [PDF]
, 1972 Title: Fast Transformations with Walsh-Hadamard Functions, Author: Frank Y.Y. Shum, Location: ThodeIn this thesis, various techniques to generate Walsh-Hadamard functions are discussed.
Shum, Frank Y.Y.
core +2 more sources
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
Design and Implementation of Sequency-Ordered Fast Walsh-Hadamard Transform (FWHT) in WCDMA
Tikrit Journal of Engineering Sciences, 2013 This paper presents the implementation of the Fast Walsh Hadamard Transform (FWHT) in sequence ordered method, in order to minimize the interference due to two users trying to transmit at the same time, and an attempt has made to simulate them.
Safaa M. Z. Al-Ubaidi
doaj +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 +4 more
core +2 more sources
Complexity adaptation in H.264/AVC video coder for static cameras [PDF]
, 2009 H.264/AVC uses variable block size motion estimation (VBSME) to improve coding gain. However, its complexity is significant and fixed regardless of the required quality or of the scene characteristics. In this paper, we propose an adaptive complexity
Kim, Chanyul +3 more
core +1 more source