Optimization of information rate upper and lower bounds for channels with memory

IEEE Transactions on Information Theory

Volumn 55, Issue 2, 2009, Pages 663-688

  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; Mismatched decoding; Optimization; Stationary and ergodic channels; Upper bound

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CHANNEL CAPACITY; COMMUNICATION SYSTEMS; CONJUGATE GRADIENT METHOD; CONTOUR FOLLOWERS; CONTROL THEORY; DECODING; FADING (RADIO); ITERATIVE METHODS; OPTIMIZATION; SIGNAL ENCODING;

FINITE-STATE MACHINE CHANNELS; INFORMATION RATE; LOWER BOUNDS; MISMATCHED DECODING; STATIONARY AND ERGODIC CHANNELS; UPPER BOUND;

FADING CHANNELS;

EID: 61349094791     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.2009581     Document Type: Article

References (35)

1. J. G. Proakis, Digital Communications, 4th ed. New York: McGraw-Hill, 2000.
2. E. Biglieri, J. Proakis, and S. Shamai (Shitz), "Fading channels: Information-theoretic and communications aspects," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2619-2692, Oct. 1998.
3. D. M. 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. Inf. Theory, vol. 52, no. 8, pp. 3498-3508, Aug. 2006.
4. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
5. D. Arnold and H.-A. Loeliger, "On the information rate of binary-input channels with memory," in Proc. 2001 IEEE Int. Conf. Communications Helsinki, Finland, Jun. 2001, pp. 2692-2695.
6. V. Sharma and S. K. Singh, "Entropy and channel capacity in the regenerative setup with applications to Markov channels," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 283.
7. 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.
8. P. O. Vontobel and D. M. Arnold, "An upper bound on the capacity of channels with memory and constraint input," in Proc. IEEE Information Theory Workshop, Cairns, Australia, Sep. 2001, pp. 147-149.
9. S. Yang, A. Kavčić, and S. Tatikonda, "Feedback capacity of finitestate machine channels," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 799-810, Mar. 2005.
10. P. O. Vontobel, A. Kavčić, D. M. Arnold, and H.-A. Loeliger, "A generalization of the Blahut-Arimoto algorithm to finite-state channels," IEEE Trans. Inf. Theory, vol. 54, no. 5, pp. 1887-1918, May 2008.
11. D. Arnold, H.-A. Loeliger, and P. O. Vontobel, "Computation of information rates from finite state/source channel models," in Proc. 40th Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2002, pp. 457-466.
12. A. Ganti, A. Lapidoth, and I. E. Telatar, "Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit," IEEE Trans. Inf. Theory, vol. 46, no. 7, pp. 2315-2328, Nov. 2000.
13. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inf. Theory, vol. IT-20, no. 2, pp. 284-287, Mar. 1974.
14. P. Sadeghi, P. O. Vontobel, and R. Shams, "Optimizing information rate bounds for channels with memory," in Proc. IEEE Intern. Symp. Information Theory, Nice, France, Jun. 2007, pp. 171-175.
15. A. Dempster, N. Laird, and D. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," J. Roy. Statist. Soc., vol. 39, no. 1, pp. 1-38, 1977.
16. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling, Numerical Recipes in C, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 1992.
17. R. Shams, R. A. Kennedy, P. Sadeghi, and R. Hartley, "Gradient intensity-based registration of multi-modal images of the brain," in Proc. IEEE Int. Conf. Computer Vision (ICCV), Rio de Janeiro, Brazil, Oct. 2007.
18. E. N. Gilbert, "Capacity of a burst-noise channel," Bell Syst. Tech. J., vol. 39, no. 9, pp. 1253-1265, Sep. 1960.
19. E. O. Elliott, "Estimates of error rates for codes on burst-noise channels," Bell Syst. Tech. J., vol. 42, no. 5, pp. 1977-1997, Sep. 1963.
20. F. Le Gland and L. Mevel, "Exponential forgetting and geometric ergodicity in hidden Markov models," Math. Contr. Signals Syst., vol. 13, pp. 63-93, 2000.
21. T. M. Cover and J. A. Thomas, Elements of Information Theory, ser. Wiley Series in Telecommunications. New York: Wiley, 1991.
22. L. E. Baum, "An inequality and associated maximization technique in statistical estimation for probabilistic functions of a Markov process," Inequalities, vol. 3, pp. 1-8, 1972.
23. C. F. J.Wu, "On the convergence properties of the EM algorithm," Ann. Statist., vol. 11, no. 1, pp. 95-103, Mar. 1983.
24. L. Mevel and L. Finesso, "Asymptotical statistics of misspecified hidden Markov models," IEEE Trans. Autom. Control, vol. 49, no. 7, pp. 1123-1132, Jul. 2004.
25. F. Rusek, "Partial Response and Faster-Than-Nyquist Signaling," Ph.D. dissertation, Lund Uni., Lund, Sweden, 2007.
26. R. H. Clarke, "A statistical theory of mobile-radio reception," Bell Syst. Tech. J., vol. 47, no. 6, pp. 957-1000, 1968.
27. P. Sadeghi and P. Rapajic, "On information rates of time-varying fading channels modeled as finite-state Markov channels," IEEE Trans. Commun., vol. 56, no. 8, pp. 1268-1278, Aug. 2008.
28. P. Sadeghi, R. A. Kennedy, P. Rapajic, and R. Shams, "Finite-state Markov modeling of fading channels - a survey of principles and applications," IEEE Signal Process. Mag., vol. 25, no. 5, pp. 57-80, Sep. 2008.
29. X. Deng and A. M. Haimovich, "Information rates of time varying Rayleigh fading channels," in Proc. IEEE Int. Conf. Communications (ICC), Paris, France, Jun. 2004, pp. 573-577.
30. A. J. Goldsmith and P. Varaiya, "Capacity, mutual information, and coding for finite-state Markov channels," IEEE Trans. Inf. Theory vol. 42, no. 3, pp. 868-886, May 1996.
31. L. Li and A. J. Goldsmith, "Low-complexity maximum-likelihood detection of coded signals sent over finite-state Markov channels," IEEE Trans. Commun., vol. 50, no. 4, pp. 524-531, Apr. 2002.
32. C. Komninakis and R. D. Wesel, "Joint iterative channel estimation and decoding in flat correlated Rayleigh fading," IEEE J. Select. Areas Commun., vol. 19, no. 9, pp. 1706-1717, Sep. 2001.
33. T. Li, X. Jin, and O. M. Collins, "Successive decoding for finite state Markov modelled flat fading channels," in Proc. IEEE Int. Symp. Information Theory (ISIT), Seattle, WA, Jul. 2006, pp. 11-15.
34. H. Kong and E. Shwedyk, "Sequence detection and channel estimation over finite state Markov channels," IEEE Trans. Veh. Technol., vol. 48, no. 3, pp. 833-839, May 1999.
35. M. Riediger and E. Shwedyk, "Communication receivers based on Markov models of the fading channel," IEE Proc. Commun., vol. 150, no. 4, pp. 275-279, Aug. 2003.