Results 141 to 150 of about 2,434,155 (179)
Recent Advances and Application of Machine Learning for Protein-Protein Interaction Prediction in Rice: Challenges and Future Perspectives. [PDF]
ProteomesMerumba SB, Ahmed HO, Fu D, Yang P.
europepmc +1 more source
New Fast Walsh–Hadamard–Hartley Transform Algorithm [PDF]
International Journal of Electrical and Computer Engineering, 2023 <span lang="EN-US">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 possesses the block diagonal structure. The proposed algorithm is implemented
Suha Suliman Mardan, Mounir Taha Hamood
exaly +3 more sources
Optimized Fast Walsh–Hadamard Transform on GPUs for Non-Binary LDPC Decoding [PDF]
Parallel Computing, 2014 We analyse the role of the FWHT under the non-binary LDPC decoding problem.We quantify the trade-off between memory bank conflicts and the throughput on GPUs.The FWHT employs radix-n approaches tuned to the number of shared memory banks.The FWHT was tuned for both 16 and 32 shared memory bank GPU architectures.
Gabriel Falcao, Vitor Silva
exaly +5 more sources
Fast Walsh–Hadamard–Fourier Transform Algorithm
IEEE Transactions on Signal Processing, 2011 No description ...
Said Boussakta
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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, Wai-Kuen Cham, W K Cham
exaly +4 more sources
Fast Computation of the Discrete Walsh and Hadamard Transforms
IEEE Transactions on Image Processing, 1998The discrete Walsh and Hadamard transforms are often used in image processing tasks such as image coding, pattern recognition, and sequency filtering. A new discrete Walsh transform (DWT) algorithm is derived in which a modified form of the DWT relation is decomposed into smaller-sized transforms using vectorized quantities.
D Sundararajan, M O Ahmad
exaly +4 more sources
Fast Reconstructed and High-Quality Ghost Imaging With Fast Walsh–Hadamard Transform
Photonics Research, 2016 In this paper, we propose a ghost imaging scheme with fast Walsh–Hadamard transform, named GIFWHT. In the scheme, Walsh–Hadamard pattern pairs are used to illuminate an object to generate pairs of detection results, and the corresponding differential detection result is used as the result as that from the conventional bucket detector. By performing the
Shengmei Zhao, Le Wang
exaly +2 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
Proceedings of the IEEE, 1988
A microprocessor-based algorithm for the calculation of symmetrical components of a three-phase system is presented. The symmetrical component transformation is applied to the input waveform, and the harmonic content in the sequence components thus obtained is filtered out by using the fast Walsh-Hadamard transform.
J Henry
exaly +3 more sources
A microprocessor-based algorithm for the calculation of symmetrical components of a three-phase system is presented. The symmetrical component transformation is applied to the input waveform, and the harmonic content in the sequence components thus obtained is filtered out by using the fast Walsh-Hadamard transform.
J Henry
exaly +3 more sources