Premium
Efficient computation of frequency response of digital networks
Author(s) -
Prasad K. P.,
Reddy P. S.
Publication year - 1979
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.4490070209
Subject(s) - eigenvalues and eigenvectors , computation , frequency response , simple (philosophy) , transfer function , mathematics , pole–zero plot , linear system , matrix (chemical analysis) , function (biology) , network analysis , computer science , inversion (geology) , graph , control theory (sociology) , algorithm , mathematical analysis , discrete mathematics , engineering , philosophy , materials science , structural basin , artificial intelligence , composite material , biology , paleontology , control (management) , epistemology , quantum mechanics , evolutionary biology , physics , electrical engineering
A major requirement in the analysis of multi‐input‐multi‐output digital networks is to compute the frequency response at a large number of points from a knowledge of the graph of a network with specified input and output nodes. Though the usual method of analysis by solving linear equations is more efficient than matrix inversion, solution of linear equations at each frequency may still require a large amount of computation. A more efficient method is to determine the poles and zeros of the desired system function and then calculate the frequency response from them. Though poles of the system function could be readily identified as contained in the eigenvalues of the state matrix of the network, difficulty is seen to arise in the determination of zeros which can not so easily be calculated. A simple and efficient method is proposed reducing the determination of zeros to a standard eigenvalue problem.