Cart (Loading....) | Create Account
Close category search window
 

Low-complexity MIMO blind, adaptive channel shortening

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)
Martin, R.K. ; Dept. of Electr. & Comput. Eng., Air Force Inst. of Technol., Wright-Patterson AFB, OH, USA ; Walsh, J.M. ; Johnson, C.R.

Channel shortening is often employed as a means of mitigating intersymbol and intercarrier interference (ISI and ICI) in systems using multicarrier modulation. The Multicarrier Equalization by Restoration of RedundancY (MERRY) algorithm has previously been shown to blindly and adaptively shorten a channel to the length of the guard interval in a multicarrier system. This paper addresses synchronization and complexity reduction issues that were not dealt with in previous work and provides extensions to and generalizations of the MERRY algorithm. A modification is presented that removes the square root and division needed at each iteration without introducing additional complexity, with the added benefit of allowing the use of constraints other than a unit norm equalizer; an extension is proposed that allows for the use of more data in the MERRY update; the algorithm is generalized to the multiple-input multiple output (MIMO) and fractionally spaced cases; a low-complexity, blind symbol synchronization technique is proposed, and a method is proposed for blind initialization of the algorithm to avoid slow modes of convergence. Each extension to the basic MERRY algorithm is accompanied by an illustrative simulation example.

Published in:

Signal Processing, IEEE Transactions on  (Volume:53 ,  Issue: 4 )

Date of Publication:

April 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.