Results 251 to 260 of about 1,090,025 (303)

Ternary Walsh Transform

2005 IEEE International Symposium on Circuits and Systems, 2005
The new ternary Walsh transform is introduced in this article. It is based on Kronecker product as well as the known Galois field (3) (GF(3)) and new ternary operations and its big advantage is that the same hardware implementation can be used for both forward and inverse ternary Walsh transforms.
Bogdan J. Falkowski, Shixing Yan
openaire   +1 more source

A Hybrid Walsh Transform Computer

IEEE Transactions on Computers, 1973
A hybrid special-purpose computer based on a recursive algorithm for discrete Walsh transform computations is described. The device uses feedback in time to reduce the required number of summing junctions to N, the number of data points to be transformed. Computations are completed in 700 ?s when N = 256.
Joseph W. Carl, Richard V. Swartwood
openaire   +2 more sources

The generalized Haar-Walsh transform

2014 IEEE Workshop on Statistical Signal Processing (SSP), 2014
Problem Setup a graph G with vertices V = {v1, . . . , vN} an edge weight matrix W a data vector f ∈ R, where fi corresponds to vi Notation & Recursive Partitioning A preliminary step for the GHWT is to use recursive bisection to generate a recursive partitioning of the graph (see [1] for an example).
Jeff Irion, Naoki Saito 0001
openaire   +1 more source

Computation of the Fast Walsh-Fourier Transform

IEEE Transactions on Computers, 1969
Summary: The discrete, orthogonal Walsh functions can be generated by a multiplicative iteration equation. Using this iteration equation, an efficient Walsh transform computation algorithm is derived which is analogous to the Cooley-Tukey algorithm for the complex-exponential Fourier transform.
exaly   +2 more sources

Upper Bounds on Walsh Transforms

IEEE Transactions on Computers, 1972
Many applications of Walsh functions employ Walsh series expansions. To obtain the advantage of data compression many of the Walsh coefficients must be negligible. It is thus desirable to have a scheme by which their magnitudes can be estimated with little computation.
exaly   +3 more sources

Real-Time Walsh-Hadamard Transformation

IEEE Transactions on Computers, 1972
A 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

Walsh transforms

American Journal of Physics, 1981
Walsh functions are an orthogonal set of square-wave functions that arise when dealing with digitized data. The Walsh transform and inverse Walsh transform are easy to calculate by hand, and can be very quickly done by digital computers. Examples of the uses of Walsh transform include real-time image processing of noisy data, and the rapid solution of ...
openaire   +1 more source

The Walsh-Fourier transform on the real line

Proceedings of NAS RA. Mathematics, 2022
The element of the Walsh system, that is the Walsh functions map from the unit interval to the set {−1, 1}. They can be extended to the set of nonnegative reals, but not to the whole real line. The aim of this article is to give an Walsh-like orthonormal and complete function system which can be extended on the real line.
Gát, G., Goginava, U.
openaire   +2 more sources

The Nonuniform Walsh-Schema Transform

1991
Abstract The Walsh-schema transform allows useful analysis of the expected performance of genetic algorithms. Until recently, its use has been restricted to the static analysis of functions, codings, and operators. In this paper, we present a form of the Walsh-schema transform that accounts for nonuniformly distributed populations, and thereby extend
Clayton L. Bridges, David E. Goldberg
openaire   +2 more sources