Strict Optimal Rational Approximants of Multisequences

The synthesis problem of multisequences of elements of a field F 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 multisequ...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2010-04, Vol.56 (4), p.1719-1728
Hauptverfasser:	Wan, Zhe-Xian, Zhou, Kai
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Approximants Approximation Cost accounting Exact sciences and technology Formal power series (FPS) generating function Information theory Information, signal and communications theory liner complexity Mathematical analysis Mathematics minimal polynomial optimal rational approximant Optimization Polynomials Power generation Rational functions Synthesis Telecommunications and information theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The synthesis problem of multisequences of elements of a field F 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.
ISSN:	0018-9448 1557-9654
DOI:	10.1109/TIT.2010.2040940