By Topic

Twice universal linear prediction of individual sequences

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

2 Author(s)
Singer, A.C. ; Adv. Syst. Directorate, Sanders, Nashua, NH, USA ; Feder, M.

We present a “twice universal” linear prediction algorithm over the unknown parameters and model orders, in which the sequentially accumulated square prediction error is as good as any linear predictor of order up to some M, for any individual sequence. The extra loss comprises of a parameter “redundancy” term proportional to (p/2)n-1ln(n), and a model order “redundancy” term proportional to n-1ln(p), where p, is the model order we compare with, and n is the data length. The computational complexity of the algorithm is about the complexity of a recursive least squares (RLS) linear predictor of order M

Published in:

Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on

Date of Conference:

16-21 Aug 1998