A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels

@article{Vontobel2008AGO,
  title={A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels},
  author={Pascal O. Vontobel and Aleksandar Kavcic and Dieter-Michael Arnold and Hans-Andrea Loeliger},
  journal={IEEE Transactions on Information Theory},
  year={2008},
  volume={54},
  pages={1887-1918}
}
The classical Blahut-Arimoto algorithm (BAA) is a well-known algorithm that optimizes a discrete memoryless source (DMS) at the input of a discrete memoryless channel (DMC) in order to maximize the mutual information between channel input and output. This paper considers the problem of optimizing finite-state machine sources (FSMSs) at the input of finite-state machine channels (FSMCs) in order to maximize the mutual information rate between channel input and output. Our main result is an… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 113 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 66 extracted citations

114 Citations

01020'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 114 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 49 references

Information Theory and Reliable Communication

  • R. G. Gallager
  • New York: Wiley,
  • 1968
Highly Influential
5 Excerpts

The derivatives of entropy rate and capacity for finite-state channels

  • H. D. Pfister
  • Talk at BIRS Workshop on “Entropy of Hidden…
  • 2007
Highly Influential
5 Excerpts

An upper bound on the capacity of channels with memory and constraint input

  • P. O. Vontobel, D. M. Arnold
  • Proc. IEEE Information Theory Workshop, Cairns…
  • 2001
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…