Results 151 to 160 of about 978,152 (207)
A novel chaos-based approach for constructing lightweight S-Boxes. [PDF]
Tolpa SH +3 more
europepmc +1 more source
SLM-based PAPR reduction for improved performance of DCO-OFDM LiFi using blind estimation for healthcare monitoring system. [PDF]
Sharaf AA +3 more
europepmc +1 more source
Roadmap on computational methods in optical imaging and holography [invited]. [PDF]
Rosen J +82 more
europepmc +1 more source
Neural spike compression through salient sample extraction and curve fitting dedicated to high-density brain implants. [PDF]
Nekoui M, Sodagar AM.
europepmc +1 more source
A Bit Level Systolic Array for Walsh-Hadamard Transforms
Abstract The Walsh-Hadamard transforms are very important in image data compression, filtering and design of codes. Recently, a systolic array for the Hadamard transform was developed for the speed of computation. However, it requires the addition or subtraction of the input samples in word level.
Long-Wen Chang
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Walsh–Hadamard Transforms: A Review
Advances in Imaging and Electron Physics, 2017Abstract The Walsh–Hadamard Transforms refer to a series of transforms related to Walsh functions and Hadamard matrix. These transforms have numerous applications in different areas of engineering and science. There are many versions of the Walsh–Hadamard Transform.
Ashkan Ashrafi
exaly +2 more sources
Fast Algorithm for Walsh Hadamard Transform on Sliding Windows
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2010This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational requirement of the proposed algorithm is about 1.5 additions per projection vector per sample, which is the lowest among existing fast algorithms for Walsh Hadamard Transform on sliding
Wanli Ouyang, W K Cham, Wai-Kuen Cham
exaly +4 more sources
Unified Matrix Treatment of the Fast Walsh-Hadamard Transform
IEEE Transactions on Computers, 1976A unified matrix treatment is presented for the various orderings of the Walsh-Hadamard (WH) functions using a general framework. This approach clarifies the different definitions of the WH matrix, the various fast algorithms and the reorderings of the WH functions.
Bernard J. Fino, V. Ralph Algazi
exaly +4 more sources

