A program for signal flow graphs:: (an alternative to Mason's theorem)

• D. Midgley ^[1] ; M.D. Richardson ^[1]
  1. [1] University of Hull

     University of Hull

     Reino Unido

     
• Localización: Compel: International journal for computation and mathematics in electrical and electronic engineering, ISSN 0332-1649, Vol. 4, Nº 3, 1985, págs. 155-165
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • Signal flow graphs for networks of electronic systems are often reduced to transfer functions by Mason's theorem. An interactive software package is presented to make this process fully automated. The nodes are numbered. Input to the program specifies the transmittance between node pairs, first noting the start‐node‐number followed by that of the destination‐node. Transmittances are represented either as real numbers or as a string of characters. With real transmittances the output of the program takes the form of a numerator and a denominator of the transfer function, each as a real number. With character‐string transmittances the numerator and denominator of the output are available both as strings and as arrays of products of prime numbers, where each prime number has uniquely represented an input character string.