By Topic

Algorithms for Z-domain continued fraction expansion by Davis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
B. Krishna ; Dept. of Math., Bahrain Univ., Isa Town, Bahrain ; H. Krishna ; Y. Wang

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)

Published in:

IEEE Transactions on Circuits and Systems  (Volume:35 ,  Issue: 10 )