Simulation-Based Computation of Information Rates for Channels With Memory
Lists
Only you see this
Abstract
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.
BibTeX
@article{arnold2006simulation,
author = {Donald M. Arnold and Hans‐Andrea Loeliger and Pascal O. Vontobel and A. Kavcic and Wei Zeng},
title = {{Simulation-Based Computation of Information Rates for Channels With Memory}},
journal = {IEEE Transactions on Information Theory},
year = {2006},
doi = {10.1109/tit.2006.878110},
}Loading related content...