Skip to main content
SpringerLink
Log in

On Boolean Techniques for Non Touching Loops of Signal Flow Graphs

  • Short Paper
  • Published:
Circuits, Systems, and Signal Processing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. W.K. Chen (ed.), The Circuits and Filters Hand Book (IEEE Press, New York, 1995)

    Google Scholar 

  2. W.K. Chen, Graph Theory and Its Engineering Applications (World Scientific, Singapore, 1997)

    Book  Google Scholar 

  3. B.C. Kuo, Automatic Control Systems (Prentice Hall, New York, 1998)

    Google Scholar 

  4. K. Ogata, Modern Control Engineering, 3rd edn. (Prentice Hall, New York, 1997)

    Google Scholar 

  5. V.C. Prasad, Compact form of Mason’s gain formula for signal flow graphs. Int. J. Electr. Eng. Educ. 47, 393–403 (2010) Manchester University Press

    Google Scholar 

  6. V.C. Prasad, Simplification of signal flow graphs. J. Circuits Syst. Signal Process. 30, 673–682 (2011)

    Article  MATH  Google Scholar 

  7. D.R. Shier, D.E. Whited, Algorithms for generating minimal cut sets by inversion. IEEE Trans. Reliab. R-34(4), 314–319 (1985)

    Article  Google Scholar 

  8. K. Thulasiraman, M.N.S. Swamy, Graphs: Theory and Algorithms (Wiley Interscience, New York, 1992)

    Book  MATH  Google Scholar 

  9. C.H. Wang, Computer aided manipulation of mason’s formula and its applications. Int. J. Circuit Theory Appl. 20, 357–370 (1992)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Engineering, Dayalbagh Educational Institute, Dayalbagh, Agra, 282005, India

    V. C. Prasad

Authors
  1. V. C. Prasad
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. C. Prasad.

Additional information

V.C. Prasad is retired from Indian Institute of Technology, New Delhi, India.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Prasad, V.C. On Boolean Techniques for Non Touching Loops of Signal Flow Graphs. Circuits Syst Signal Process 32, 1443–1453 (2013). https://doi.org/10.1007/s00034-012-9490-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-012-9490-2

Keywords

Search

Navigation