By Topic

An algorithm for short-block data detection in the near-to-Toeplitz case

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
$33 $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)
E. M. -K. Ma ; Dept. of Electr. & Comput. Eng., Queen's Univ., Kingston, Ont., Canada ; C. J. Zarowski

Crozier et al. (1990, 1992) have developed schemes for estimating transmitted data on a block-by-block rather than symbol-by-symbol basis. In general, this requires the solution of a linear system of equations with a near-to-Toeplitz structure. In this paper, we apply the algorithm of Cybenko and Berry (1990) for the efficient solution of near-to-Toeplitz linear systems of equations to the data detection problem of Crozier et al. The algorithm of Cybenko and Berry is based upon the use of hyperbolic Householder transformations and is asymptotically more efficient in terms of the number of operations than a direct method of solution based, say, upon the use of a general Cholesky linear system solver. Because near-to-Toeplitz matrices can be very ill conditioned, even when the matrix is small, the application of Bischof's (1990) incremental condition estimator (ICE) algorithm is shown to be useful in detecting such ill conditioning

Published in:

IEEE Transactions on Vehicular Technology  (Volume:47 ,  Issue: 2 )