Skip to Main Content
A spectral approach to the synthesis of a tributary switching network (TRIB), that is the irredundant Maitra cascade is presented. The properties of Boolean functions which are TRIB-realisable are defined in the Rademacher-Walsh spectral domain. An algorithm for realising a TRIB based on these properties is given. The procedure is quite efficient for hand computation and computer operation. The method is demonstrated by numerical examples.