Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
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. © 2006 IEEE.
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Robert C. Durbeck
IEEE TACON