By Topic

Fast Algorithms for the Pseudo Walsh Transform Based on Order Numbers

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

1 Author(s)
Li Xiao-mei ; Fac. of Comput., Guangdong Univ. of Technol., Guangzhou, China

Based on matrix copy operator a new ordering is discovered. Based on the evolution of Walsh function in the process of copying matrix operator we introduce a new sequence. In this paper we give the concept of pseudo Walsh transformation and characteristics. According to order number method four fast algorithms are presented. And we gives the rapid algorithm design and realization of the computer of the kind of transformation of the Walsh sequence. Finally we show experiment results and comparison of various algorithms of fast algorithms.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:1 )

Date of Conference:

March 31 2009-April 2 2009