The ergodic decomposition of asymptotically mean stationary random sources - Computer Science > Information TheoryReport as inadecuate




The ergodic decomposition of asymptotically mean stationary random sources - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: It is demonstrated how to represent asymptotically mean stationary AMSrandom sources with values in standard spaces as mixtures of ergodic AMSsources. This an extension of the well known decomposition of stationarysources which has facilitated the generalization of prominent source codingtheorems to arbitrary, not necessarily ergodic, stationary sources. Asymptoticmean stationarity generalizes the definition of stationarity and covers a muchlarger variety of real-world examples of random sources of practical interest.It is sketched how to obtain source coding and related theorems for arbitrary,not necessarily ergodic, AMS sources, based on the presented ergodicdecomposition.



Author: Alexander Schoenhuth

Source: https://arxiv.org/







Related documents