Information Theory and Reliable Communication
Information Theory and Reliable Communication
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
Analysis of low-density parity-check codes for the Gilbert-Elliott channel
IEEE Transactions on Information Theory
A Binary Communication Channel With Memory Based on a Finite Queue
IEEE Transactions on Information Theory
Design and analysis of turbo codes on Rayleigh fading channels
IEEE Journal on Selected Areas in Communications
Hidden Markov modeling of flat fading channels
IEEE Journal on Selected Areas in Communications
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
Hi-index | 0.00 |
A discrete (binary-input 2q-ary output) communication channel with memory is introduced with the objective to judiciously capture both the statistical memory and the soft-decision information of time-correlated fading channels modulated via binary phase-shift keying and coherently demodulated with an output quantizer of resolution q. It is shown that the discrete channel can be explicitly described in terms of its binary input process and a 2q-ary noise process. It is also shown that the channel is symmetric and admits a simple expression for its capacity when its noise is stationary ergodic. The 2q-ary noise process is next modeled via a generalized version of the recently studied binary queue-based channel (2007) to produce a mathematically tractable stationary ergodic M'th order Markovian noise source with 2q + 2 parameters. Numerical results indicate that the capacity of the discrete channel with q = 2, 3 is substantially improved over the cases of perfect channel interleaving (which yields an equivalent memoryless channel) and of hard-decision demodulation (q = 1). These results point to potentially large performance gains achievable by designing coding schemes for this discrete channel that exploit both its memory and soft-decision information, as opposed to ignoring either of them.