By Topic

Upper Bounds of Error Probabilities for Stationary Gaussian Channels With Feedback

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ihara, S. ; Grad. Sch. of Inf. Sci., Nagoya Univ., Nagoya, Japan

In this paper, we discuss the coding schemes and error probabilities in information transmission over additive Gaussian noise channels with feedback, where the Gaussian noise processes are stationary but not necessarily white. In the case of the white Gaussian channel it is known that the minimum error probability, under the average power constraint, decreases faster than the exponential of any order. Recently Gallager and Nakiboğlu (2010) proposed a coding scheme for the white Gaussian channel and successfully showed the multiple-exponential decay of the error probability for all rates below capacity. This paper aims to prove that, without any special assumptions on the noise of the stationary Gaussian channel, the minimum error probability decreases multiple-exponentially fast. In general, no explicit formulas are known for the capacity of the stationary Gaussian channel. In this paper, we introduce a lower bound C* on the capacity C. Then we prove that the minimum error probability decreases multiple-exponentially fast for all rates below C*, but not for all rates below C. In the process of proving, the scheme proposed by Gallager and Nakiboğlu proves itself to be quite useful, even though the Gaussian channel is not white.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 12 )