Title :
An algorithm to compute large-change sensitivities of linear digital networks
Author_Institution :
Indian Institute of Technology, Delhi, India
fDate :
6/1/1979 12:00:00 AM
Abstract :
An algorithm to compute large-change sensitivities of linear digital networks to simultaneous changes in all the multiplier coefficients has been derived. The technique adopted in this correspondence is a generalization of the existing method for the case of an incremental change in one multiplier coefficient only.
Keywords :
Computer applications; Computer networks; Equations; Fast Fourier transforms; Gratings; Harmonic analysis; Polynomials; Transfer functions;
Journal_Title :
Proceedings of the IEEE
DOI :
10.1109/PROC.1979.11359
