Simulation-based computation of information rates for channels with memory
DM Arnold, HA Loeliger, PO Vontobel… - … on information theory, 2006 - ieeexplore.ieee.org
IEEE Transactions on information theory, 2006•ieeexplore.ieee.org
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.
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.
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.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果