Skip navigation
Skip navigation

Optimizing Information Rate Bounds for Channels with Memory

Sadeghi, Parastoo; Vontobel, Pascal; Shams, Ramtin


We consider the problem of optimizing information rate upper and lower bounds for communication channels with (possibly large) memory. A recently proposed auxiliary-channel-based technique allows one to efficiently compute upper and lower bounds on the information rate of such channels. Towards tightening these bounds, we propose iterative expectation-maximization (EM) type algorithms to optimize the parameters of the auxiliary finite-state machine channel (FSMC). From a channel coding...[Show more]

CollectionsANU Research Publications
Date published: 2007
Type: Conference paper
Source: Proceedings of IEEE International Symposium on Information Theory (ISIT 2007)
DOI: 10.1109/ISIT.2007.4557222


File Description SizeFormat Image
01_Sadeghi_Optimizing_Information_Rate_2007.pdf296.25 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  22 January 2019/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator