Abstract
Vertex disjoint (non touching) loops have to be processed to form all combinations of disjoint loops for Mason’s graph. Similarly Coates’ graph-based method needs all spanning disjoint loop sets. This is required to obtain the transfer function/solve equations of a system represented by Mason’s/Coates’ signal flow graph. A Boolean formula is presented in this note to obtain them. A Boolean function is formed comprising product of sums of pairs of touching loops for each connected component. It is then simplified using some rules of Boolean algebra. The resulting terms are “complemented” to derive all combinations of non touching loops for a Mason’s graph. Using an additional Boolean rule, the same formula gives all spanning disjoint loop sets of a Coates’ graph. The graph need not be connected.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
