File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Concavity of mutual information rate for input-restricted finite-state memoryless channels at high SNR

TitleConcavity of mutual information rate for input-restricted finite-state memoryless channels at high SNR
Authors
Han, GMarcus, B
Issue Date2009
Citation
Ieee International Symposium On Information Theory - Proceedings, 2009, p. 1654-1658 How to Cite?
DOI: http://dx.doi.org/10.1109/ISIT.2009.5205785
AbstractWe consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavior of entropy rate of the output hidden Markov chain and deduce that the mutual information rate of such a channel is concave with respect to the parameters of the input Markov processes at high signal-to-noise ratio. In principle, the concavity result enables good numerical approximation of the maximum mutual information rate and capacity of such a channel. © 2009 IEEE.
Description2009 IEEE International Symposium on Information Theory
Persistent Identifierhttp://hdl.handle.net/10722/62185
ISI Accession Number ID
WOS:000280141401043
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorHan, Gen_HK
dc.contributor.authorMarcus, Ben_HK
dc.date.accessioned2010-07-13T03:55:46Z-
dc.date.available2010-07-13T03:55:46Z-
dc.date.issued2009en_HK
dc.identifier.citationIeee International Symposium On Information Theory - Proceedings, 2009, p. 1654-1658en_HK
dc.identifier.urihttp://hdl.handle.net/10722/62185-
dc.description2009 IEEE International Symposium on Information Theoryen_HK
dc.description.abstractWe consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavior of entropy rate of the output hidden Markov chain and deduce that the mutual information rate of such a channel is concave with respect to the parameters of the input Markov processes at high signal-to-noise ratio. In principle, the concavity result enables good numerical approximation of the maximum mutual information rate and capacity of such a channel. © 2009 IEEE.en_HK
dc.languageengen_HK
dc.relation.ispartofIEEE International Symposium on Information Theory - Proceedingsen_HK
dc.titleConcavity of mutual information rate for input-restricted finite-state memoryless channels at high SNRen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailHan, G:ghan@hku.hken_HK
dc.identifier.authorityHan, G=rp00702en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ISIT.2009.5205785en_HK
dc.identifier.scopuseid_2-s2.0-70449499107en_HK
dc.identifier.hkuros156619en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70449499107&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1654en_HK
dc.identifier.epage1658en_HK
dc.identifier.isiWOS:000280141401043-
dc.identifier.scopusauthoridHan, G=8640067800en_HK
dc.identifier.scopusauthoridMarcus, B=7102086378en_HK

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats