Results 191 to 200 of about 35,175 (225)
Some of the next articles are maybe not open access.

Hadamard transform spectrometry

Chemometrics and Intelligent Laboratory Systems, 1991
Abstract Dyer, S.A., 1991. Hadamard transform spectrometry. Chemometrics and Intelligent Laboratory Systems, 12: 101–115. Hadamard transform spectrometry (HTS) provides a means of obtaining a multiplex advantage with a dispersive spectrometric technique.
openaire   +1 more source

BIFORE or Hadamard transform

IEEE Transactions on Audio and Electroacoustics, 1971
BIFORE or Hadamard transform is defined and several of its properties are developed. BIFORE power and phase spectra are developed and their frequency-sequency composition is explored. Using matrix partitioning, fast algorithms for efficient computation of BIFORE coefficients and power and phase spectra are developed.
N. Ahmed, K. Rao, A. Abdussattar
openaire   +1 more source

Large symmetric π transformations for Hadamard transforms

Applied Optics, 1983
Many multiplexing instruments utilize the fast Hadamard transform (FHT) to demultiplex the signal. In the past, the FHT includes the π1 and π2 transformations to reorder vectors before and after a Sylvester-type Hadamard transform. Although the computational effort involved in the π1 and the Sylvester-type Hadamard transform scales as n log2n ...
openaire   +2 more sources

Generalized Hadamard—Fourier Transforms

IETE Journal of Research, 1976
Kernel of the discrete Fourier transform of order p is a p x p orthonormal kernel with pth roots of unity as its entries. Kernel of the Hadamard transform (and in particular, that of the Walsh-Fourier transform) of order p, when it exists, is a p x p orthonormal kernel with second roots of unity i.e. ± 1 as its entries. Orthonormal kernels of order 2n,
openaire   +1 more source

Hadamard Transform Analytical Systems

1978
A spectrometer sorts electromagnetic radiation into its component colors. Each color corresponds to a particular value of a parameter—wavelength, energy, or frequency—and the resulting spectrum displays the intensity of radiation for each value of this parameter.
openaire   +1 more source

Skew Williamson-Hadamard Transforms

2011
Skew Hadamard matrices are of special interest due to their uses, among others, in constructing orthogonal designs. Fast computational algorithms for skew Williamson-Hadamard transforms are constructed in this chapter. Fast algorithms of two groups of transforms based on skew-symmetric Williamson-Hadamard matrices are designed using the block ...
openaire   +1 more source

Fast Williamson-Hadamard Transforms

2011
Hadamard matrices have recently received attention due to their numerous known and promising applications. The FHT algorithms were developed for the orders N = 2n, 12 · 2n, 4n. The difficulties of the construction of the N ≡ 0(mod 4)-point HT are related to the problem of the existence of Hadamard matrices (the so-called Hadamard problem).
openaire   +1 more source

Hadamard Transforms

2011
Jaakko Astola   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy