Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
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.
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Eric Price, David P. Woodruff
FOCS 2011