Algorithms for Z-domain continued fraction expansion by Davis
B. Krishna, Hari Krishna, Yichen Wang · IEEE Transactions on Circuits and Systems · 1988
The authors cast the algorithm for computing the Z-domain continued fraction expansion by A.M. Davis (1982) in the form of a three-term recurrence relation. Such a recurrence relation processes a mirror image polynomial and an anti-mirror image polynomial alternately. The algorithms derived are at least twice as efficient in computational complexity as the algorithms recently proposed by R. Parthasarthy and S.N. Iyer (1987).>