By Topic

Algorithm and architecture for Gray code ordered fast Walsh transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Falkowski, B.J. ; Dept. of Electr. Eng., Portland State Univ., OR, USA ; Perkowski, M.A.

The generation of two new Walsh transforms in Gray code orderings from the straight binary code is shown. A recursive algorithm for Gray-code-ordered Walsh transforms is based on a novel operator called the bisymmetrical pseudo Kronecker product. The recursive algorithm is the basis for the flow diagram of a constant geometry fast Walsh transform in Gray code ordering. The algorithm is fast (N log 2 N additions/subtractions), is computer efficient, and is implemented in the iterative architecture

Published in:

Circuits and Systems, 1990., IEEE International Symposium on

Date of Conference:

1-3 May 1990