DocumentCode
1185306
Title
A predistortion technique for linear networks
Author
Leuenberger, Robert ; Christen, Ernst
Volume
28
Issue
4
fYear
1981
fDate
4/1/1981 12:00:00 AM
Firstpage
355
Lastpage
358
Abstract
This letter presents an efficient algorithm for the predistortion of networks with arbitrary topology. The method is based on a modification of the Levenberg-Marquardt algorithm using small-change transmission sensitivities. A weighted least square error function is formulated and used subsequently in an iterative optimization scheme. The algorithm determines the errors of the transfer function coefficients due to parasitics of the physical network very accurately. Root-finder methods are used to obtain frequency and Q-deviations of poles and zeros. The predistortion of the network is carried out by perturbing the nominal transfer function poles and zeros correspondingly.
Keywords
Least-squares approximation; Linear networks; Active filters; Computational modeling; Computer architecture; Computer interfaces; Iterative algorithms; Poles and zeros; Predistortion; Signal processing algorithms; Telecommunication network topology; Transfer functions;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/TCS.1981.1084986
Filename
1084986
Link To Document