File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Concavity of the mutual information rate for input-restricted memoryless channels at high SNR

TitleConcavity of the mutual information rate for input-restricted memoryless channels at high SNR
Authors
KeywordsConcavity
Entropy Rate
Hidden Markov Chain
Mutual Information Rate
Issue Date2012
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?puNumber=18
Citation
Ieee Transactions On Information Theory, 2012, v. 58 n. 3, p. 1534-1548 How to Cite?
AbstractWe consider a memoryless channel with an input Markov process supported on a mixing finite-type constraint. We continue the development of asymptotics for the entropy rate of the output hidden Markov chain and deduce that, at high signal-to-noise ratio, the mutual information rate of such a channel is concave with respect to "almost" all input Markov chains of a given order. © 2012 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/156283
ISSN
2015 Impact Factor: 1.737
2015 SCImago Journal Rankings: 1.433
ISI Accession Number ID
Funding AgencyGrant Number
University Grants Committee of the Hong Kong Special Administrative Region, ChinaAoE/E-02/08
Research Grants Council of the Hong Kong Special Administrative Region, ChinaHKU 701708P
Funding Information:

Manuscript received July 27, 2010; revised September 21, 2011; accepted September 25, 2011. Date of current version February 29, 2012. This work was supported in part by the University Grants Committee of the Hong Kong Special Administrative Region, China, through Project AoE/E-02/08, and by Research Grants Council of the Hong Kong Special Administrative Region, China, under Grant HKU 701708P. The material in this paper was presented in part at the 2009 IEEE International Symposium on Information Theory.

References
Grants

 

DC FieldValueLanguage
dc.contributor.authorHan, Gen_US
dc.contributor.authorMarcus, BHen_US
dc.date.accessioned2012-08-08T08:41:10Z-
dc.date.available2012-08-08T08:41:10Z-
dc.date.issued2012en_US
dc.identifier.citationIeee Transactions On Information Theory, 2012, v. 58 n. 3, p. 1534-1548en_US
dc.identifier.issn0018-9448en_US
dc.identifier.urihttp://hdl.handle.net/10722/156283-
dc.description.abstractWe consider a memoryless channel with an input Markov process supported on a mixing finite-type constraint. We continue the development of asymptotics for the entropy rate of the output hidden Markov chain and deduce that, at high signal-to-noise ratio, the mutual information rate of such a channel is concave with respect to "almost" all input Markov chains of a given order. © 2012 IEEE.en_US
dc.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?puNumber=18en_US
dc.relation.ispartofIEEE Transactions on Information Theoryen_US
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectConcavityen_US
dc.subjectEntropy Rateen_US
dc.subjectHidden Markov Chainen_US
dc.subjectMutual Information Rateen_US
dc.titleConcavity of the mutual information rate for input-restricted memoryless channels at high SNRen_US
dc.typeArticleen_US
dc.identifier.emailHan, G:ghan@hku.hken_US
dc.identifier.authorityHan, G=rp00702en_US
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1109/TIT.2011.2173730en_US
dc.identifier.scopuseid_2-s2.0-84857779505en_US
dc.identifier.hkuros201667-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84857779505&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume58en_US
dc.identifier.issue3en_US
dc.identifier.spage1534en_US
dc.identifier.epage1548en_US
dc.identifier.isiWOS:000300845900015-
dc.publisher.placeUnited Statesen_US
dc.relation.projectEntropy Rate of Hidden Markov Chains-
dc.identifier.scopusauthoridHan, G=8640067800en_US
dc.identifier.scopusauthoridMarcus, BH=7102086378en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats