Results 201 to 210 of about 5,165 (219)

Optical Walsh-Hadamard transform for orders 32 and 64

Applied Optics, 1988
A coherent optical system composed of a holographic mask and two Fourier lenses is described for performing an arbitrary linear transform. A set of equations for determining the amplitude-phase distribution of the mask is given. As a specific transform, the Walsh-Hadamard transform for orders 32 and 64 is optically made in 1-D space.
Y S, Chen, S H, Zheng, B Z, Dong, D H, Li, G Z, Yang   +4 more
openaire   +2 more sources

A bit level systolic array for Walsh-Hadamard transforms

Signal Processing, 1993
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.
Chang, Long-Wen, Wu, Ming-Chang
openaire   +2 more sources

ECG Biometric Analysis Using Walsh–Hadamard Transform

2018
The electrocardiogram (ECG) signal expresses unique cardiac features among individuals. This paper proposes a novel method to human identification using ECG. The proposed method utilizes a band-pass filter for quality check and autocorrelation (AC) for feature extraction.
Ranjeet Srivastva, Yogendra Narain Singh
openaire   +1 more source

Parallel vector multidimensional slant, Haar, and Walsh-Hadamard transforms

Multidimensional Systems and Signal Processing, 1992
A new factorization for the slant matrix is developed. The structure of the proposed slant algorithm based on the new factorization is suitable for vector and parallel processing of one- and two-dimensional slant transforms. A unified approach to compute the Walsh-Hadamard, Haar, and slant transforms is presented.
El-Sharkawy, Mohamed, Aburdene, Maurice, Tsang, Wenlong   +2 more
openaire   +2 more sources

Modified Walsh-Hadamard Transform for PDL Mitigation

39th European Conference and Exhibition on Optical Communication (ECOC 2013), 2013
We propose a modified Walsh-Hadamard transform (MWHT) that reduces the PDL penalty by equalizing the performance of both polarization tributaries. The realization of MWHT requires just one piece of PMF and therefore exhibits a very low-cost PDL solution.
null Wei-Ren Peng, I. Morita, T. Tsuritani   +2 more
openaire   +1 more source

Unified Matrix Treatment of the Fast Walsh-Hadamard Transform

IEEE Transactions on Computers, 1976
A 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.
Fino, Bernard J., Algazi, V. Ralph
openaire   +2 more sources

Fast Algorithm for Walsh Hadamard Transform on Sliding Windows

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2010
This 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
openaire   +2 more sources

A Walsh-Hadamard Transform LSI for Speech Recognition

IEEE Transactions on Consumer Electronics, 1982
Abstract- Speech recognition systems are coming to a practical stage thanks to the recent progress of the semiconductor technology. We have developed a low cost speaker-dependent speech recognition unit using Walsh-Hadamard transform (WIT). A WHT LSI has been developed to reduce the cost and the space of the recognition unit, and a high rate of ...
Hidefumi Ohga, Hidekazu Yabuuchi, Eiichi Tsuboka, Kazuaki Mayumi, Kozo Adachi, Osamu Nishijima   +5 more
openaire   +1 more source

Digital filters based on recursive Walsh-Hadamard transformation

IEEE Transactions on Circuits and Systems, 1990
The applicability of the recursive Walsh-Hadamard transformation to FIR and IIR (finite- and infinite-impulse-response) filtering is investigated. It is shown that using a common structure for recursive transforms recently introduced by G. Peceli (1986), the usual frequency-domain FIR filtering problem can be easily converted into a Walsh sequency ...
G. Peceli, B. Feher
openaire   +1 more source

Recursive Algorithm for Sliding Walsh Hadamard Transform

IEEE Transactions on Signal Processing, 2014
In this paper, a recursive sliding transform (RST) algorithm is proposed for the fast implementation of the Walsh Hadamard Transform (WHT) on sliding windows. The proposed RST algorithm accelerates the sliding WHT process by recursively reducing the order of WHT.
openaire   +1 more source