Sequential generation of binary orthogonal functions

Sequential generation of binary orthogonal functions

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A new method is presented for the generation of three families of discrete Walsh functions. Each function is generated without reference to any other sequency representation. Sequencies up to 10 × 106 zero crossings per second are possible with currently available t.t.l. devices.


    1. 1)
      • : `Applications of Walsh functions', AD 707–431, Proceedings of symposium, 1st–3rd April 1970, Washington, US Naval Research Laboratory, US Defence Documentation Centre.
    2. 2)
      • J.L. Shanks . Computation of the fast Walsh–Fourier transform. IEEE Trans. , 457 - 459
    3. 3)
      • J.E. Whelchel , D.F. Guinn . (1968) , The fast Fourier–Hadamard transform and its use in signal representation and classification.
    4. 4)
      • Gibbs, J.E.: `Discrete complex Walsh functions', Proceedings of the symposium on the applications of Walsh functions, 1970, Washington, US Naval Research Laboratory, p. 107–122.
    5. 5)
      • H.F. Harmuth . (1972) , Transmission of information by orthogonal functions.

Related content

This is a required field
Please enter a valid email address