ece382-fall2011-block-diagram-signal-flow-graph-slides-4-pages3

# C s george lee purdue univ block diagrams signal flow

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Diagrams & Signal-Flow Graphs ECE382 11 / 31 Definition of Graphs v1 e4 e1 v2 e3 e2 A graph G is an ordered pair G = (V , E) consisting of a set V of vertices or nodes and a set E of edges joining pairs of vertices, where V = {v1 , v2 , . . . , vn } and E = {e1 , e2 , . . . , vm }. If the edges of a graph are directional, then it is called digraph. Signal flow graphs are digraphs in which the vertices represent system variables or signals of a system and the edges represent components of the system. The gain of an edge is a transmittance. C. S. George Lee (Purdue Univ.) Block Diagrams & Signal-Flow Graphs ECE382 12 / 31 v3 Signal Flow Graphs - Definitions Node a node is a point representing a system variable or signal Transmittance is a gain between 2 nodes. Branch a branch is a directed line segment joining 2 nodes. The gain of a branch is a transmittance. Input node is a node that has only outgoing branches. This is independent variable. Output node is a node that has only incoming branches. Path a path is a traversal of connected branches in the direction of the branch arrows. If no node is crossed more than once, the path is open. If the path ends at the same node from which it began and does not cross any other node more than once, it is closed. C. S. George Lee (Purdue Univ.) Block Dia...
View Full Document

## This note was uploaded on 02/05/2012 for the course ECE 382 taught by Professor Staff during the Fall '08 term at Purdue.

Ask a homework question - tutors are online