Skip to Main Content
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.