By Topic

Optimization of Information Rate Upper and Lower Bounds for Channels With Memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Parastoo Sadeghi ; Dept. of Inf. Eng., Australian Nat. Univ., Canberra, ACT ; Pascal O. Vontobel ; Ramtin Shams

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 in this paper is to provide iterative expectation-maximization (EM) type algorithms to optimize the parameters of the auxiliary FSMC to tighten these bounds. We provide an explicit, iterative algorithm that improves the upper bound at each iteration. We also provide an effective method for iteratively optimizing the lower bound. To demonstrate the effectiveness of our algorithms, we provide several examples of partial response and fading channels where the proposed optimization techniques significantly tighten the initial upper and lower bounds. Finally, we compare our results with results obtained by the conjugate gradient optimization algorithm and an improved variation of the simplex algorithm, called Soblex. While the computational complexities of our algorithms are similar to the conjugate gradient method and less than the Soblex algorithm, our algorithms robustly find the tightest bounds. Interestingly, from a channel coding/decoding perspective, optimizing the lower bound is related to increasing the achievable mismatched information rate, i.e., the information rate of a communication system where the decoder at the receiver is matched to the auxiliary channel, and not to the original channel.

Published in:

IEEE Transactions on Information Theory  (Volume:55 ,  Issue: 2 )