2011/06/05 by Iddo Naiss, Haim Permuter, Haim H. Permuter +2
Computer Science · Engineering · Mathematics · #94A15 #Advanced Data Compression Techniques #Cellular Automata and Applications #FOS: Computer and information sciences #Information Theory (cs.IT) #Mathematical Approximation and Integration #Sparse and Compressive Sensing Techniques #Wireless Communication Security Techniques #cs.IT #math.IT #msc:94A15
paper · pdf · doi:10.48550/arxiv.1106.0895
41 pages, 13 figures, 19 references
arxiv created 2011/06/05 · openalex publication_date 2011/06/05 · arxiv updated 2011/06/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we consider the rate distortion problem of discrete-time, ergodic, and stationary sources with feed forward at the receiver. We derive a sequence of achievable and computable rates that converge to the feed-forward rate distortion. We show that, for ergodic and stationary sources, the rate align Rn(D)=(1)/(n)min I(Xn→ Xn)align is achievable for any n, where the minimization is taken over the transition conditioning probability p(xn|xn) such that \exd(Xn,Xn)≤ D. The limit of Rn(D) exists and is the feed-forward rate distortion. We follow Gallager's proof where there is no feed-forward and, with appropriate modification, obtain our result. We provide an algorithm for calculating Rn(D) using the alternating minimization procedure, and present several numerical examples. We also present a dual form for the optimization of Rn(D), and transform it into a geometric programming problem.