• DocumentCode
    2366287
  • Title

    A fast algorithm for computing the capacity of discrete memoryless channels

  • Author

    Liang, Xue-Bin

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
  • fYear
    2010
  • fDate
    17-19 March 2010
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    In this paper, we propose a fast algorithm for computing the capacity of an arbitrarily given discrete memoryless channel (DMC). The proposed algorithm is iterative and it is proved to be convergent for any given DMC. Numerical experiment shows that this new proposed algorithm works well for DMCs with tens of hundreds input and output symbols, while the Arimoto-Blahut algorithm appears to be slowly convergent in those cases.
  • Keywords
    channel capacity; iterative methods; memoryless systems; Arimoto-Blahut algorithm; discrete memoryless channel capacity; iterative algorithm; Channel capacity; Information theory; Iterative algorithms; Memoryless systems; Monte Carlo methods; Mutual information; Probability distribution; Arimito-Blahut´s algorithm; discrete memoryless channels; fast algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Sciences and Systems (CISS), 2010 44th Annual Conference on
  • Conference_Location
    Princeton, NJ
  • Print_ISBN
    978-1-4244-7416-5
  • Electronic_ISBN
    978-1-4244-7417-2
  • Type

    conf

  • DOI
    10.1109/CISS.2010.5464903
  • Filename
    5464903
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2366287