Optimization of Information Rate Upper and Lower Bounds for Channels With Memory
We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we consider can have a finite number of states, such as partial response channels, or they can have an infinite state space, such as time-varying fading channels. We optimize recently proposed information rate bounds for such channels, which make use of auxiliary finite-state machine channels (FSMCs). Our main contribution...[Show more]
|Collections||ANU Research Publications|
|Source:||IEEE Transactions on Information Theory|
|01_Sadeghi_Optimization_of_Information_2009.pdf||604.31 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.