Results 151 to 160 of about 4,861 (197)
Some of the next articles are maybe not open access.
Cal-sal Walsh-Hadamard transform
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1978Walsh-Hadamard matrices are rearranged such that the first half of the rows represents cal functions in increasing order of sequency whereas the second half represents sal functions in decreasing order of sequency. The transform based on this rearrangement is called the Cal-Sal Walsh-Hadamard transform or (WHT) cs .
Rao, K. R. +3 more
openaire +2 more sources
Cache conscious Walsh-Hadamard transform
2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221), 2002The Walsh-Hadamard Transform (WHT) is an important algorithm in signal processing because of its simplicity. However, in computing large size WHT, non-unit stride access results in poor cache performance leading to severe degradation in performance. This poor cache performance is also a critical problem in achieving high performance in other large size
null Neungsoo Park, N.K. Prasanna
openaire +1 more source
Discrete transforms via the Walsh-Hadamard transform
Signal Processing, 1988Abstract Even-odd transforms (EOTs) such as the discrete cosine (DCT), the discrete sine (DST), the slant (ST) and the discrete Legendre (DLT) transforms are developed from the Walsh-Hadamard transform (WHT). Conversion matrices for all these EOTs are outlined. Computational requirements for implementing these transforms are listed.
S. Venkataraman +3 more
openaire +1 more source
Spatial multiplexing using walsh-hadamard transform
2016 International Conference on Smart Green Technology in Electrical and Information Systems (ICSGTEIS), 2016This paper proposes a model (WHT-SMX), that combines spatial multiplexing (SMX) with walsh-hadamard transform (WHT). The use of WHT is to convert transmit symbols of SMX to change location of constellation points. This is helpful in extending the Euclidean distance between transmit symbols for precise detection.
Man Hee Lee +3 more
openaire +1 more source
The Walsh-Hadamard/discrete Hartley transform
International Journal of Electronics, 1987A new fast algorithm is proposed here to compute the discrete Hartley transform (DHT) via the natural-ordered Walsh-Hadamard transform. The processing is carried out on an intraframe basis in (N × N) data blocks, where N is an integer power of 2. The Walsh-Hadamard transform (WHT)W coefficients are computed directly, and then used to obtain the DHT ...
Hsu, C. Y., Wu, Ja-Ling
openaire +1 more source
Speech processing with Walsh-Hadamard transforms
IEEE Transactions on Audio and Electroacoustics, 1973High-speed algorithms to compute the discrete Hadamard and Walsh transforms of speech waveforms have been developed. Intelligible speech has been reconstructed from dominant Hadamard or Walsh coefficients on a medium sized computer in a non-real-time mode. Degradation of some phonemes was noted at low bit rates of reconstruction, but the reconstruction
null F. Shum, A. Elliott, W. Brown
openaire +1 more source
An FPGA based Walsh Hadamard transforms
ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196), 2002The Walsh-Hadamard transforms are important in many image processing applications including compression, filtering and code design. This paper presents a novel architecture for the fast Hadamard transform, using distributed arithmetic techniques.
A. Amira, A. Bouridane, P. Milligan
openaire +1 more source
1975
This chapter is devoted to the study of the Walsh-Hadamard transform (WHT), which is perhaps the most well-known of the nonsinusoidal orthogonal transforms. The WHT has gained prominence in various digital signal processing applications, since it can essentially be computed using additions and subtractions only. Consequently its hardware implementation
Nasir Ahmed, Kamisetty Ramamohan Rao
openaire +1 more source
This chapter is devoted to the study of the Walsh-Hadamard transform (WHT), which is perhaps the most well-known of the nonsinusoidal orthogonal transforms. The WHT has gained prominence in various digital signal processing applications, since it can essentially be computed using additions and subtractions only. Consequently its hardware implementation
Nasir Ahmed, Kamisetty Ramamohan Rao
openaire +1 more source
Lossless 2D discrete Walsh-Hadamard transform
2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221), 2002The 64-point separable lossless two dimensional (2D) WHT is composed of the 8-point lossless one dimensional WHT. The latter is obtained by first decomposing the 8-point WHT into 2-point WHTs and then replacing every 2-point WHT by a ladder network. Since the coefficients in the ladder network then become real, the advantage of being multiplier-free ...
K. Komatsu, K. Sezaki
openaire +1 more source
Recursive discrete Walsh-Hadamard transformation
Proceedings of the IEEE, 1983New techniques for Walsh-Hadamard spectral analysis are reported, for which spectral coefficients are updated in real time with each new signal sample.
openaire +1 more source