Topic
Hadamard transform
About: Hadamard transform is a research topic. Over the lifetime, 7262 publications have been published within this topic receiving 94328 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: The Hadamard and SJT product of matrices are two types of special matrix product applied to the diAerential quadrature (DQ) solution of geometrically nonlinear bending of isotropic and orthotropic rectangular plates to demonstrate the superb eAciency, accuracy and simplicity of the new approaches in applying DQ method for nonlinear computations.
77 citations
TL;DR: The effect of multiplexing in Fourier transform spectroscopy (FTS) and other coding techniques such as Hadamard transform spectral analysis (HTA) on the signal/noise ratio arises from two factors as mentioned in this paper.
Abstract: The effect of multiplexing in Fourier transform spectroscopy (FTS) (and other coding techniques such as Hadamard transform spectroscopy) on the signal/noise ratio arises from two factors. The first of these is a N½ improvement for a spectrum containing N resolution elements since each individual resolution element is now viewed for an N-fold longer time. The second factor is due to the simultaneous observation of all resolution elements, raising the signal level by a factor N for an uniform spectrum.
77 citations
TL;DR: This work develops a technique to construct bent-negabent Boolean functions by using complete mapping polynomials and derives the upper bound ⌈n/2⌉ for the algebraic degree of a negabent function on n variables.
Abstract: Parker considered a new type of discrete Fourier transform, called nega-Hadamard transform. We prove several results regarding its behavior on combinations of Boolean functions and use this theory to derive several results on negabentness (that is, flat nega-spectrum) of concatenations, and partially symmetric functions. We derive the upper bound ⌈n/2⌉ for the algebraic degree of a negabent function on n variables. Further, a characterization of bent-negabent functions is obtained within a subclass of the Maiorana-McFarland set. We develop a technique to construct bent-negabent Boolean functions by using complete mapping polynomials. Using this technique, we demonstrate that for each l ≥ 2, there exist bent-negabent functions on n = 12l variables with algebraic degree n/4 + 1 = 3l + 1. It is also demonstrated that there exist bent-negabent functions on eight variables with algebraic degrees 2, 3, and 4. Simple proofs of several previously known facts are obtained as immediate consequences of our work.
76 citations
TL;DR: 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 windows.
Abstract: 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 windows.
76 citations
TL;DR: An algorithm and its implementation to recompress video frame data, which is to be stored into external memory, are proposed, thereby enabling reduction of memory requirements and bandwidth and reducing the total compression/decompression latency cycles.
Abstract: An algorithm and its implementation to recompress video frame data, which is to be stored into external memory, are proposed, thereby enabling reduction of memory requirements and bandwidth. To support random access capability, frames are organized as 1/spl times/8-pixel arrays, which are then compressed into 32-bit segments. The compression ratio is fixed at 50%. For both compression efficiency and low complexity, modified Hadamard transform and Golomb-Rice (GR) coding are utilized. Objective and subjective video quality assessments are performed. Efficient hardware designs including GR encoding/decoding and packing/unpacking are also proposed to reduce the total compression/decompression latency cycles. The proposed hardware designs are suitable for the integration with MPEG-2 decoders thanks to fast operation and simple interface logic.
75 citations