Optimizing information rate bounds for channels with memory

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 171-175

  Sadeghi, Parastoo ^a   Vontobel, Pascal O ^b   Shams, Ramtin ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Finite state machine channels; Information rate; Lower bounds; Mismatch decoding; Optimization; Upper bounds

Indexed keywords

FINITE-STATE MACHINE CHANNELS; INFORMATION RATE; LOWER BOUNDS; MISMATCH DECODING; UPPER BOUNDS;

BLIND SOURCE SEPARATION; CHANNEL CODING; COMMUNICATION SYSTEMS; COMPUTER NETWORKS; CYBERNETICS; INFORMATION THEORY; ITERATIVE METHODS; TECHNICAL PRESENTATIONS;

OPTIMIZATION;

EID: 50949115085     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557222     Document Type: Conference Paper

References (11)

1. E. Biglieri, J. Proakis, and S. Shamai, "Fading channels: Information-theoretic and communications aspects," IEEE Trans. Inform. Theory. vol. 44, no. 6, pp. 2619-2692, Oct. 1998.
2. J. G. Proakis, Digital Communications, 4th ed. New York: McGraw-Hill, 2000.
3. D. Arnold, H.-A. Loeliger, P. O. Vontobel, A. Kavčić, and W. Zeng, "Simulation-based computation of information rates for channels with memory," IEEE Trans. on Inform. Theory, vol. IT-52, no. 8, pp. 3498-3508, Aug. 2006.
4. D. Arnold and H.-A. Loeliger, "On the information rate of binary-input channels with memory," in Proc. 2001 IEEE Int. Conf. on Communications, Helsinki, Finland, June 11-14 2001, pp. 2692-2695.
5. V. Sharma and S. K. Singh, "Entropy and channel capacity in the regenerative setup with applications to Markov channels," in Proc. IEEE Intern. Symp. on Inform. Theory, Washington, D.C., June 24-29 2001, p. 283.
6. H. D. Pfister, J. B. Soriaga, and P. H. Siegel, "On the achievable information rates of finite-state ISI channels," in Proc. IEEE GLOBECOM, San Antonio, TX, Nov. 2001, pp. 2992-2996.
7. D. Arnold, H.-A. Loeliger, and P. O. Vontobel, "Computation of information rates from finite state/source channel models," in Proc. 40th Allerton Conf. on Communications, Control, and Computing, Allerton House, Monticello, Illinois, USA, October 2-4 2002.
8. A. Ganti, A. Lapidoth, and I. E. Telatar, "Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit," IEEE Trans. on Inform. Theory, vol. IT-46, no. 7, pp. 2315-2328, 2000.
9. P. O. Vontobel, A. Kavčić, D. Arnold, and H.-A. Loeliger, "A generalization of the Blahut-Arimoto algorithm for finite-state channels," accepted (after revisions) for IEEE Trans. Inform. Theory, available online under http://www.hpl.hp.com/personal/ Pascal_Vontobel, Nov. 2005.
10. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
11. P. Sadeghi and P. Rapajic, "Capacity analysis for finite-state Markov mapping of flat-fading channels," IEEE Trans. Commun., vol. 53, no. 5, pp. 833-840, May 2005.