Speech Compression Based on Discrete Walsh Hadamard Transform
نویسندگان
چکیده
منابع مشابه
Speech Compression Based on Discrete Walsh Hadamard Transform
This paper presents a new lossy compression algorithm for stationary signal based on Discrete Walsh Hadamard Transform (DWHT). The principle of compression algorithm consists in framing the original speech signal into stationary frames and applying the DWHT. Then, the obtained coefficients are thresholded in order to truncate all coefficients below a given thresholds values. Compression is achi...
متن کاملCache conscious Walsh-Hadamard transform
The Walsh-Hadamard Transform (WHT) is an important algorithmin 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 signal transforms. In this paper, we develo...
متن کاملData Compression in Brain-Machine/Computer Interfaces Based on the Walsh-Hadamard Transform
This paper reports on the application of the Walsh-Hadamard transform (WHT) for data compression in brain-machine/brain-computer interfaces. Using the proposed technique, the amount of the neural data transmitted off the implant is compressed by a factor of at least 63 at the expense of as low as 4.66% RMS error between the signal reconstructed on the external host and the original neural signa...
متن کاملDouble Walsh-Hadamard Transform OFDM System
The aim of this paper is to present a novel technique to reduce the PAPR in OFDM signals. The main advantage of the proposed technique, named Double WHTOFDM reduces the SER in frequency selective channels without incrementing the error floor in non-linear channels, which happens in the conventional WHT-OFDM. Therefore, the technique proposed in this paper is a simple and efficient solution to a...
متن کاملCharacterizing and Enumerating Walsh-Hadamard Transform Algorithms
We propose a way of characterizing the algorithms computing a Walsh-Hadamard transform that consist of a sequence of arrays of butterflies (I2n−1 ⊗ DFT2) interleaved by linear permutations. Linear permutations are those that map linearly the binary representation of its element indices. We also propose a method to enumerate these algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Engineering and Electronic Business
سال: 2013
ISSN: 2074-9023,2074-9031
DOI: 10.5815/ijieeb.2013.03.07