Efficient vector perturbation in multi-antenna multi-user systems based on approximate integer relations

European Signal Processing Conference

Volumn , Issue , 2006, Pages

  Seethaler, Dominik ^a   Matz, Gerald ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST SYSTEMS; INTEGER RELATIONS; LATTICE REDUCTION; MULTI-ANTENNA; MULTI-USER; MULTIUSER SYSTEM; SINGULAR VALUES; VECTOR PERTURBATION;

BROADCASTING ANTENNAS; PERTURBATION TECHNIQUES;

SIGNAL PROCESSING;

EID: 84862609222     PISSN: 22195491     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. C. B. Peel, B. M. Hochwald, and A. L. Swindlehurst, .A vector-perturbation technique for near-capacity multiantenna multiuser communication - Part I: Channel inversion and regularization,. IEEE Trans. Comm., vol. 53, pp. 195.202, Jan. 2005.
2. B. M. Hochwald, C. B. Peel, and A. L. Swindlehurst, .A vector-perturbation technique for near-capacity multiantenna multiuser communication - Part II: Perturbation,. IEEE Trans. Comm., vol. 53, pp. 537.544, March 2005.
3. C. Windpassinger, R. F. H. Fischer, T. Vencel, and J. B. Huber, .Precoding in multiantenna and multiuser communications,. IEEE Trans. Wireless Comm., vol. 3, pp. 1305.1316, July 2004.
4. J. Jaldén and B. Ottersten, .An exponential lower bound onthe expected complexity of sphere decoding,. in Proc. IEEEICASSP 2004, vol. IV, (Montreal, Canada), pp. 393.396, May 2004.
5. C. Windpassinger, R. F. H. Fischer, and J. B. Huber, . Latticereductionaided broadcast precoding,. IEEE Trans. Comm.,vol. 52, pp. 2057.2060, Dec. 2004.
6. A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász, .Factoring polynomials with rational coefficients,. Math. Ann., vol. 261, pp. 515.534, 1982.
7. M. Taherzadeh, A. Mobasher, and A. Khandani, .LLL latticebasis reduction achieves the maximum diversity in MIMO systems,. in Proc. IEEE ISIT 2005, (Adelaide, Australia), pp. 1300.1304, Sept. 2005.
8. V. L. Clarkson, Approximation of Linear Forms by Lattice Points with Applications to Signal Processing. PhD thesis, Australian National University, 1997.
9. M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization. Berlin: Springer, 2nd ed., 1993.
10. D. Wübben, R. Böhnke, V. Kühn, and K. Kammeyer, .Near-maximum-likelihood detection of MIMO systems using MMSE-based lattice-reduction,. in Proc. IEEE ICC 2004, vol. 2, (Paris, France), pp. 798.802, june 2004.
11. H. Vikalo and B. Hassibi, .On the sphere decoding algorithm II. Generalizations, second-order statistics, and applications to communications,. IEEE Trans. Signal Processing, vol. 53, pp. 2819.2834, Aug. 2005.
12. H. Yao and G. W. Wornell, .Lattice-reduction-aided detectorsfor MIMO communication systems,. in Proc. IEEE Globecom 2002, vol. 1, (Taipeh, Taiwan), pp. 424.428, Nov. 2002.
13. C. Windpassinger and R. F. H. Fischer, .Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction,. in Proc. IEEE InformationTheory Workshop, (Paris, France), pp. 345.348, March/April 2003.
14. G. H. Golub and C. F. Van Loan, Matrix Computations. Baltimore: Johns Hopkins University Press, 3rd ed., 1996.
15. H. Artés, D. Seethaler, and F. Hlawatsch, .Efficient detectionalgorithms for MIMO channels: A geometrical approach toapproximate ML detection,. IEEE Trans. Signal Processing,vol. 51, pp. 2808.2820, Nov. 2003.
16. H. Ferguson, D. Bailey, and S. Arno, .Analysis of PSLQ, aninteger relation finding algorithm,. Math. Comput., vol. 68,no. 10, pp. 351.369, 1999.