An optimal medium access control with partial observations for sensor networks
EURASIP Journal on Wireless Communications and Networking
Capacity-achieving codes for finite-state channels with maximum-likelihood decoding
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
A robust metric for soft-output detection in the presence of class-a noise
IEEE Transactions on Communications
On reliable communications over channels impaired by bursty impulse noise
IEEE Transactions on Communications
The capacity of channels with feedback
IEEE Transactions on Information Theory
Optimization of information rate upper and lower bounds for channels with memory
IEEE Transactions on Information Theory
The error exponent of variable-length codes over Markov channels with feedback
IEEE Transactions on Information Theory
Capacity region of the finite-state multiple-access channel with and without feedback
IEEE Transactions on Information Theory
Ordering finite-state Markov channels by mutual information
IEEE Transactions on Information Theory
Design and analysis of successive decoding with finite levels for the Markov channel
IEEE Transactions on Information Theory
Feedback capacity of the compound channel
IEEE Transactions on Information Theory
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Capacity-achieving codes for channels with memory with maximum-likelihood decoding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Feedback capacity of a class of symmetric finite-state Markov channels
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
The capacity region of the degraded finite-state broadcast channel
IEEE Transactions on Information Theory
Adaptive FEC error control scheme for wireless video transmission
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Tighter bounds on the capacity of finite-state channels via Markov set-chains
IEEE Transactions on Information Theory
Full length article: On coding for reliable communication over packet networks
Physical Communication
Joint source and sending rate modeling in adaptive video streaming
Image Communication
Hi-index | 755.38 |
The finite-state Markov channel (FSMC) is a discrete time-varying channel whose variation is determined by a finite-state Markov process. These channels have memory due to the Markov channel variation. We obtain the FSMC capacity as a function of the conditional channel state probability. We also show that for i.i.d. channel inputs, this conditional probability converges weakly, and the channel's mutual information is then a closed-form continuous function of the input distribution. We next consider coding for FSMCs. In general, the complexity of maximum-likelihood decoding grows exponentially with the channel memory length. Therefore, in practice, interleaving and memoryless channel codes are used. This technique results in some performance loss relative to the inherent capacity of channels with memory. We propose a maximum-likelihood decision-feedback decoder with complexity that is independent of the channel memory. We calculate the capacity and cutoff rate of our technique, and show that it preserves the capacity of certain FSMCs. We also compare the performance of the decision-feedback decoder with that of interleaving and memoryless channel coding on a fading channel with 4PSK modulation