Abstract
In this paper, the concept of evolution is introduced to examine the generation process for Walsh function systems. By considering the generation process for Walsh function systems as the evolution process of certain discrete dynamic systems, a new unified generation pattern which is called the Bisectional Evolutional Generation Pattern (BEGP for short) for Walsh function systems is proposed, combined with their properties of symmetric copying. As a byproduct of this kind of pattern, a kind of ordering for Walsh function systems which is called quasi-Hadamard ordering is found naturally.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Walsh, J.L.: A Closed Set of Orthogonal Functions. Amer. J. Math. 15, 5–24 (1923)
Wang, N.: Walsh Function Generated with Evolution. Journal of Image and Graphics 3, 225–231 (1996)
Wang, N.: The Mathematical Beauty of Walsh Functions (I). Journal of Yunnan University (19 supp.), 306–314 (1997)
Wang, N.: The Mathematical Beauty of Walsh Functions (II). Journal of Yunnan University (19 supp.), 315–323 (1997)
Falkowski, B.J., Perkowski, M.A.: Algorithms and Architecture for Gray Code Ordered Fast Walsh Transform. In: Proc. IEEE Int. Symp. Circ. & Syst (23rd ISCAS), New Orleans, USA, pp. 2913–1916 (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, N., Lu, J., Shi, B. (2007). Walsh Function Systems: The Bisectional Evolutional Generation Pattern. In: Kang, L., Liu, Y., Zeng, S. (eds) Evolvable Systems: From Biology to Hardware. ICES 2007. Lecture Notes in Computer Science, vol 4684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74626-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-74626-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74625-6
Online ISBN: 978-3-540-74626-3
eBook Packages: Computer ScienceComputer Science (R0)