D. Gesbert, A. van der Veen, and A. Paulraj, "On the Equivalence of Blind Equalizers Based on MRE and Subspace Intersections," IEEE Trans. Sig. Proc., vol. 47, no. 3, pp. 856--859, March 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....a set of linear transformations that relate the receiver weights for each user, then these transformations are used to augment the standard ACMA equations. The algorithm is similar in spirit to that described in [12] where the CM property was combined with Mutually Referenced Equalizer algorithm [13, 14, 15] for blind equalization. However, in this paper, additional structure is exploited so that only a single receiver is estimated for each user. The data model assumed in this paper is presented in the next section, together with a brief description of the STBC framework of [7] The ACMA approach of ....

D. Gesbert, A. van der Veen, and A. Paulraj, "On the Equivalence of Blind Equalizers Based on MRE and Subspace Intersections," IEEE Trans. Sig. Proc., vol. 47, no. 3, pp. 856--859, March 1999.

.... techniques such as the subspace channel estimation algorithm [8] the cross relation algorithm [18] and the least squares smoothing (LSS) algorithm [12] 19] The dual of the column space methods is the row space techniques for symbol estimations [14] or direct equalizer construction [3] [4]. Manuscript received July 24, 2000; revised September 26, 2001. This work was supported in part by the National Science Foundation under Contract CCR9804019 and the Multidisciplinary University Research Initiative (MURI) under the Office of Naval Research Contract N00014 00 1 0564. The associate ....

....define sp (15) sp (16) This leads to sp , and (17) The above equation serves as the basis of a number of techniques to be presented next. It should be pointed out that van der Veen et al. first proposed the use of intersection of and to obtain a direct input sequence estimation scheme [4], 14] The computation of intersection, especially in the presence of noise, can be quite involved [5] 14] In our approach, the direct intersection is avoided by the use of oblique projections. B. Oblique Projection Algorithms Recall from (11) From the above subspace definitions, we have ....

D. Gesbert, A. J. van der Veen, and A. Paulraj, "On the equivalence of blind equalizers based on MRE and subspace intersections," IEEE Trans. Signal Processing, vol. 47, pp. 856--859, Mar. 1999.

.... x i x i z w 0 w 1 x i 1 z (0) i z (1) i e i Figure 1. Mutually referenced equalizers several shifts of the row span of the data matrix are intersected. This procedure is such that only the symbol sequence that is present in all shifts will remain, thus removing the ISI. As shown in [6], the algorithm is essentially identical to the mutually referenced equalizer (MRE) technique by Gesbert e.a. 7] The MRE idea is illustrated in figure 1: if the received data vector x i at time i is obtained by the convolution of a source symbol sequence by a filter of length 2, then there ....

....1 x k 1 : 5) Taking two delays of the inputs, we can write w 1 X (1) s 0 s 1 s N 1 ] w 0 X (0) 6) Thus, the equalizer outputs can be paired, which is the idea behind the MRE technique. The equalizers can be found in various ways, adaptively or using subspace intersections, cf. [6], essentially by solving min w 0 ;w 1 k [w 0 w 1 ] X (0) X (1) k 2 with a suitable norm constraint on [w 0 w 1 ] The solution is given by the left singular vector corresponding to the smallest singular value of Theta X (0) X (1) The corresponding right ....

D. Gesbert, A.J. van der Veen, and A. Paulraj, "On the equivalence of blind equalizers based on MRE and subspace intersections, " IEEE Trans. Signal Proc., vol. 47, pp. 856--859, Mar. 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC