Computer Science – Information Theory
Scientific paper
2010-07-27
Computer Science
Information Theory
26 pages
Scientific paper
We 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.
Han Guangyue
Marcus Brian
No associations
LandOfFree
Concavity of Mutual Information Rate for Input-Restricted Finite-State Memoryless Channels at High SNR does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Concavity of Mutual Information Rate for Input-Restricted Finite-State Memoryless Channels at High SNR, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Concavity of Mutual Information Rate for Input-Restricted Finite-State Memoryless Channels at High SNR will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-320177