By Topic

Strict Optimal Rational Approximants of Multisequences

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
$31 $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

2 Author(s)
Zhe-Xian Wan ; Key Lab. of Math. Mechanization, Chinese Acad. of Sci., Beijing, China ; Kai Zhou

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 4 )