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

Convex constraint and semiprojected steepest descent algorithms-for single-carrier equalization in wideband MIMO 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

4 Author(s)
Kasparis, C. ; Dept. of Electr. & Electron. Eng., Bristol Univ., UK ; Piechocki, R.J. ; Nix, A.R. ; Fletcher, P.N.

Two computationally efficient algorithms are proposed for equalizing wideband MIMO channels in the space-time domain. Both of proposed methods can be viewed as modifications to the steepest descent method, for implementing the zero-forcing (or unconstraint maximum-likelihood) MIMO equalizer, which allows constraints about the feasible solution set to be incorporated in the iterative estimation process. The first approach assumes that the solution belongs in a closed convex set (inside a Hilbert space) and nearest point projection on the set is performed in each iterative step. The method is guaranteed to converge in the optimum point inside the convex set and hence provides significantly better performance than the standard linear equalizers. Fast convergence to a nearly optimal estimate can be achieved by the second proposed algorithm in which the new estimate in each iteration, is semiprojected on the discrete-discontinuous solution set. The proposed algorithms are of very low complexity as the number of arithmetic operations scales only linearly with the problem's dimensionally.

Published in:

Signal Processing Advances in Wireless Communications, 2004 IEEE 5th Workshop on

Date of Conference:

11-14 July 2004