4.5 Article Proceedings Paper

Simulation-based computation of information rates for channels with memory

Journal

IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 52, Issue 8, Pages 3498-3508

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2006.878110

Keywords

bounds; channel capacity; finite-state models; hidden-Markov models; information rate; sum-product algorithm; trellises

Ask authors/readers for more resources

The information rate of finite-state source/channel models can be accurately estimated by sampling both a long channel input sequence and the corresponding channel output sequence, followed by a forward sum-product recursion on the joint source/channel trellis. This method is extended to compute upper and lower bounds on the information rate of very general channels with memory by means of finite-state approximations. Further upper and lower bounds can be computed by reduced-state methods.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available