By Topic

Minimum error entropy estimation and entropic prediction filtering: An optimal predictive coding scheme

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

1 Author(s)
Thomopoulos, S.C.A. ; Southern Illinois Univ., Carbondale, IL, USA

The minimum error entropy (MEE) estimation problem on discrete, finite, or countably infinite ensembles of arbitrary statistical nature is considered. A combinatorial approach is taken to solve the minimization problem. The solution is obtained in algorithmic form. The numerical complexity of the MEE algorithm is analyzed. An entropic prediction filtering (EPF) coding scheme that utilizes the MEE algorithm to minimize the per symbol error entropy is introduced. Simulation has shown that the EPF can effectively be used to reduce the average codeword length required to encode data. Other applications of the MEE algorithm in signal interpolation and extrapolation are also discussed.

Published in:

Information Theory, IEEE Transactions on  (Volume:31 ,  Issue: 5 )