Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Channel equalization for block transmission systems

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)
Kaleh, G.K. ; Ecole Nat. Superieure des Telecommun., Paris, France

In a block transmission system the information symbols are arranged in the form of blocks separated by known symbols. Such a system is suitable for communication over time-dispersive channels subject to fast time-variations, e,g., the HF channel. The known reliable receiver for this system is the nonlinear data-directed estimator (NDDE). This paper presents appropriate equalization methods for this system. A nonstationary innovations representation based on Cholesky factorization is used in order to define a noise whitener and a maximum-likelihood block detector. Also block linear equalizers and block decision-feedback equalizers are derived. For each type we give the zero-forcing and the minimum-mean-squared-error versions. Performance evaluations and comparisons are given. We show that they perform better than conventional equalizers. As compared to the NDDE, the derived block decision-feedback equalizers perform better and are much less complex. Whereas the NDDE uses the Levinson algorithm to solve M/2 Toeplitz systems of decreasing order (where M is the number of symbols per block), the derived equalizers need to process only one Toeplitz system. Moreover, the Schur algorithm, proposed for Cholesky factorization allows us to further reduce the complexity

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:13 ,  Issue: 1 )