Duality Bounds on the Cut-Off Rate with Applications to Ricean Fading

We propose to use an expression of Csiszar & Korner's to upper bound Gallager's E/sub 0/(/spl rho/,Q,r) function. We demonstrate this approach by computing the high SNR asymptotic expansion of the computational cut-off rate of the peak-or average-power limited discrete-time memoryless Ricean fading channel with no-or with only partial-side information at the receiver.

[1]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[2]  Mung Chiang,et al.  Geometric Programming for Communication Systems , 2005, Found. Trends Commun. Inf. Theory.

[3]  Richard E. Blahut,et al.  Hypothesis testing and information theory , 1974, IEEE Trans. Inf. Theory.

[4]  Robert G. Gallager,et al.  A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.

[5]  Thomas H. E. Ericson,et al.  A Gaussian channel with slow fading (Corresp.) , 1970, IEEE Trans. Inf. Theory.

[6]  Suguru Arimoto.  Computation of random coding exponent functions , 1976, IEEE Trans. Inf. Theory.

[7]  Amos Lapidoth,et al.  Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels , 2003, IEEE Trans. Inf. Theory.

[8]  H. Vincent Poor,et al.  The noncoherent rician fading Channel-part I: structure of the capacity-achieving input , 2005, IEEE Transactions on Wireless Communications.

[9]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[10]  G. Taricco,et al.  Capacity of fading channel with no side information , 1997 .

[11]  Paul F. Byrd,et al.  Handbook of elliptic integrals for engineers and scientists , 1971 .

[12]  I. S. Gradshteyn,et al.  Table of Integrals, Series, and Products , 1976 .

[13]  Imre Csisźar,et al.  The Method of Types , 1998, IEEE Trans. Inf. Theory.

[14]  S. Shamai,et al.  The capacity of discrete-time Rayleigh fading channels , 1997, Proceedings of IEEE International Symposium on Information Theory.

[15]  Shlomo Shamai,et al.  Fading Channels: Information-Theoretic and Communication Aspects , 1998, IEEE Trans. Inf. Theory.

[16]  Frits Beukers,et al.  SPECIAL FUNCTIONS (Encyclopedia of Mathematics and its Applications 71) , 2001 .

[17]  Robert G. Gallager,et al.  The random coding bound is tight for the average code (Corresp.) , 1973, IEEE Trans. Inf. Theory.

[18]  H. Vincent Poor,et al.  Noncoherent Rician fading Channel-part II: spectral efficiency in the low-power regime , 2005, IEEE Transactions on Wireless Communications.

[19]  Peter J. McLane,et al.  Random Coding Error Exponents for Two-Dimensional Flat Fading Channels with Complete Channel State Information , 1999, IEEE Trans. Inf. Theory.