• DocumentCode
    1502070
  • Title

    Algorithms for Z-domain continued fraction expansion by Davis

  • Author

    Krishna, Bal ; Krishna, Hari ; Wang, Yunbiao

  • Author_Institution
    Dept. of Math., Bahrain Univ., Isa Town, Bahrain
  • Volume
    35
  • Issue
    10
  • fYear
    1988
  • fDate
    10/1/1988 12:00:00 AM
  • Firstpage
    1338
  • Lastpage
    1339
  • Abstract
    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)
  • Keywords
    computational complexity; polynomials; Z-domain continued fraction expansion; antimirror image polynomial; circuit theory; computational complexity; mirror image polynomial; stability testing; system theory; three-term recurrence relation; Circuit stability; Circuit synthesis; Circuit testing; Circuits and systems; Computational complexity; Digital filters; Forward contracts; Mirrors; Polynomials; System testing;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/31.7611
  • Filename
    7611
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1502070