Results 161 to 170 of about 978,152 (207)
Fast Transformations with Walsh-Hadamard Functions [PDF]
, 1972 Title: Fast Transformations with Walsh-Hadamard Functions, Author: Frank Y.Y.
Shum, Frank Y.Y.
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Real-Time Walsh-Hadamard Transformation
IEEE Transactions on Computers, 1972A technique for obtaining the digital Walsh-Hadamard transform of two-dimensional discrete pictures in real time is presented. A considerable reduction in total time for the transformation of a picture results since the process of scanning and digitizing one picture line overlaps with computations on the previous line. This is accomplished by operating
Nikitas A. Alexandridis, Allen Klinger
openaire +1 more source
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
Neungsoo Park, Viktor K. Prasanna
openaire +1 more source
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
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.
Abbes Amira +2 more
openaire +2 more sources
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 ...
Kunitoshi Komatsu, Kaoru Sezaki
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
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