Strict Optimal Rational Approximants of Multisequences

Zhe-Xian Wan, Kai ZhouIEEE Trans. Information Theory 2010 · DOI

Abstract

The synthesis problem of multisequences of elements of a field <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">F</i> is studied. A new way of approximation by rational functions to multisequences is introduced. Different from the usual approach by optimal rational approximant profile, in the proposed strict optimal rational approximant of a multisequence, the components of the optimal rational approximant are not required to have the same denominator. An algorithm to obtain a strict optimal rational approximant profile is established. The relation between optimal rational approximant and strict optimal rational approximant is studied.
BibTeX
@article{wan2010strict,
  author = {Zhe-Xian Wan and Kai Zhou},
  title = {{Strict Optimal Rational Approximants of Multisequences}},
  journal = {IEEE Transactions on Information Theory},
  year = {2010},
  doi = {10.1109/tit.2010.2040940},
}

Loading related content...

Figure