By Topic

Achievable Rates for Nonlinear Volterra Channels

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

2 Author(s)
Xenoulis, K. ; Dept. of Inf. & Telecommun., Univ. of Athens, Athens, Greece ; Kalouptsidis, N.

Random coding theorems and achievable rates for nonlinear additive noise channels are presented. Modeling the channel's nonlinear behavior as a causal, stationary Volterra system, upper bounds on the average error probability are obtained for maximum likelihood and weakly typical set decoding. The proposed bounds are deduced by treating correct decoding regions as subspaces of high concentration measure and deploying exponential martingale inequalities. Due to the union bound effect and the i.i.d. assumption imposed on the codewords components, the deduced exponents constitute only lower bounds on the true random coding exponents of nonlinear channels. Cubic and fourth-order nonlinearities are used as examples to illustrate the relation of the random coding exponents and achievable rates with respect to the channel's parameters.

Published in:

Information Theory, IEEE Transactions on  (Volume:57 ,  Issue: 3 )