By Topic

Capacity penalty due to ideal zero-forcing decision-feedback equalization

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

3 Author(s)
Barry, J.R. ; Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; Lee, E.A. ; Messerschmitt, D.G.

We consider the capacity C of a continuous-time channel with frequency response H(f) and additive white Gaussian noise. If H(f)|-2 behaves like a polynomial of order ρ at high frequencies, we show that the per-symbol capacity approaches ρ/2 nats per channel use at high signal powers. If the receiver uses an ideal zero forcing decision-feedback equalizer (DFE) consisting of a sampled whitened-matched filter followed by a zero-forcing tail canceler that is free of error propagation, the overall system is free of intersymbol interference and has a well-defined capacity CZF. By comparing this capacity with the capacity C of the underlying channel, we quantify the loss of information inherent in the tail-canceling operation that typifies zero-forcing DFE and zero-forcing precoding systems. For strictly bandlimited channels, we find that the capacity penalty approaches zero in the limit of large signal power. On the other hand, for nonstrictly bandlimited channels, the asymptotic penalty is nonzero; however, with bandwidth optimization, the asymptotic penalty is at most 0.59 dB, and the asymptotic ratio CZF/C is at least 93.6%, depending on the asymptotic order ρ of the channel response

Published in:

Information Theory, IEEE Transactions on  (Volume:42 ,  Issue: 4 )