By Topic

The evolving generation and fast algorithms of Walsh transforms

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
$33 $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

3 Author(s)
Ningtao chen ; School of Computer Science & Technology, Huazhong University of Science & Technology, Wuhan, 430074, China ; Nengchao wang ; Baochang shi

Six orderings of Walsh function are derived evolutionally by means of "row copy" and "block copy". Two (Walshand Paley-ordering) are generated by row copy and other four (Hadamard-, X-, XT- and G-ordering) are generated by block copy. XT- and G-ordering are deduced by extending the concept of up-down shift symmetry to that of up-down mirror image symmetry. XT-ordering is the transposed X-ordering, which is not symmetric as X-ordering; G-ordering is symmetric as the three known ones (Walsh- and Paley- and Hadamard-ordering). The four symmetric orderings construct an exactly symmetric Walsh function system. At last, two fast algorithms are proposed for G-ordering Walsh transform. The approaches introduced are applicable to other orderings Walsh transforms. Both algorithms have a regular recursive structure and are easy to be implemented on parallel computers. Furthermore, the method serves as a frame to design fast algorithms for discrete transforms.

Published in:

Electronics, Circuits and Systems, 2005. ICECS 2005. 12th IEEE International Conference on

Date of Conference:

11-14 Dec. 2005