FAST ALGORITHMS FOR WALSH TRANSFORM IN BIT-REVERSED SEQUENCY ORDER

Authors
LI Q ZHOU ML SHI BC WANG NC
Citation
Q. Li et al., FAST ALGORITHMS FOR WALSH TRANSFORM IN BIT-REVERSED SEQUENCY ORDER, Chinese Science Bulletin, 43(8), 1998, pp. 627-633
Citations number
2
Categorie Soggetti
Multidisciplinary Sciences
Journal title
Chinese Science Bulletin → ACNP
ISSN journal
10016538
Volume
43
Issue
8
Year of publication
1998
Pages
627 - 633
Database
ISI
SICI code
1001-6538(1998)43:8<627:FAFWTI>2.0.ZU;2-C
Abstract
Bit-reversed sequency order or bit-reversed Walsh order (M) is present ed. Walsh functions in this order can be processed easily, and there i s a simple relation between sequency order and bit-reversed sequency o rder. 8 fast algorithms for discrete Walsh transform in bit-reversed s equency order are given.