Algorithms for converting Sequency-, Dyadic-, and Hadamard-ordered Walsh functions
Frequently used Walsh functions can be classified into three forms: (1) Sequency-ordered, (2) Dyadic-ordered and (3) Hadamard-ordered. For converting one form into others, the existing methods are complicated in calculation. This paper establishes six algorithms for doing these conversions.
Year of publication: |
1985
|
---|---|
Authors: | Chen, C.F. ; Leung, W.K. |
Published in: |
Mathematics and Computers in Simulation (MATCOM). - Elsevier, ISSN 0378-4754. - Vol. 27.1985, 5, p. 471-478
|
Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
Profit Opportunities with the American Put-Call Parity When Dividends are Not Expected
Frankfurter, G.M., (1993)
-
Analysis of repair strategies for automatic assembly systems
Leung, W.K., (1996)
-
Analysis of repair strategies for automatic assembly systems
Leung, W.K., (1996)
- More ...