Results 271 to 280 of about 1,090,025 (303)
Some of the next articles are maybe not open access.
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
New Capabilities of Walsh Functions and Walsh Transforms
1977Abstract : Research progress has been in four areas: solution of difference equations; sequency ordering of Hadamard functions; generalized orthogonal transformation matrix; and analysis of nonlinear systems.
openaire +1 more source
Die endliche Walsh-Transformation
1982Insbesondere die fur die Anwendung wichtige diskrete Fourier-Transformation ist im Prinzip problemlos einzusetzen. Allerdings ist der Aufwand noch relativ gros und wachst enorm, wenn man diese Transformation im mehrdimensionalen Fall durchfuhren will.
openaire +1 more source
SPIE Proceedings, 1987
Recent developments in computerized tomography (CT), be it by means of X-rays or nuclear magnetic resonance (NMR), was possible due to very thorough mathematical groundwork done by many authors. The great importance of CT and NMR systems especially for medical purposes is obvious.
openaire +1 more source
Recent developments in computerized tomography (CT), be it by means of X-rays or nuclear magnetic resonance (NMR), was possible due to very thorough mathematical groundwork done by many authors. The great importance of CT and NMR systems especially for medical purposes is obvious.
openaire +1 more source
Comments on "Discrete Fourier transform via Walsh transform"
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1979It is pointed out that the method presented in our paper [1] is different from the methods referred to in the above paper, and our method has a small number of computations and inherently has no error.
Tadokoro, Y., Higuchi, T.
openaire +1 more source
A note on the finite Walsh transform (Corresp.)
IEEE Transactions on Information Theory, 1970The theory of the finite Walsh transform is presented as a background to current interest in the fast Walsh transform algorithm.
openaire +2 more sources
Calculation of Walsh transform on MasPar computer
2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353), 2003A new algorithm that extracts parallelism feasible on a SIMD architecture in calculation of Walsh spectral coefficients from reduced representation of the Boolean functions in the form of an array of cubes has been proposed. Detailed studies of the SIMD architecture and deep analysis of the mechanism of mapping the parallel algorithm into the SIMD ...
openaire +2 more sources
Boolean Functions and Their Walsh Transforms
2016Boolean functions are fundamental building blocks for many cryptographic algorithms. This chapter introduces basic concepts and operations of Boolean functions, including Walsh transforms and basic cryptographic properties of Boolean functions.
Chuan-Kun Wu, Dengguo Feng
openaire +1 more source
Testing Random Number Generators by Walsh Transform
IEEE Transactions on Computers, 1977A truly random sequence of numbers has an asymptotically flat Walsh power spectrum. This fact is used to devise a new test for the randomness of the output of random number generators. Because it takes little computing time to obtain the Walsh power spectrum of even very long sequences, generators with large periods can be tested.
openaire +1 more source