Optimizing Information Rate Bounds for Channels with Memory
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]
|Collections||ANU Research Publications|
|Source:||Proceedings of IEEE International Symposium on Information Theory (ISIT 2007)|
|01_Sadeghi_Optimizing_Information_Rate_2007.pdf||296.25 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.