论文信息 - Vector precoding with bounded complexity

Vector precoding with bounded complexity

We investigate nonlinear pre-equalization techniques for the downlink of multiuser systems from a transmitter equipped with multiple antennas to non-cooperative single antenna mobile receivers. In the focus of this paper is the strongly varying complexity of the tree-structured vector precoding problem. Since the maximum latency of signal processing algorithms is of major interest for practical implementations, suboptimum schemes with an upper bounded complexity are discussed. Simulation results reveal a close to optimum performance at the expense of moderate computational efforts for the considered scenario.

G. Fettweis | R. Habendorf | G. Fettweis | R. Habendorf

[1] Robert F. H. Fischer,et al. Lattice-reduction-aided broadcast precoding , 2004, IEEE Transactions on Communications.

[2] John B. Anderson,et al. Sequential Coding Algorithms: A Survey and Cost Analysis , 1984, IEEE Trans. Commun..

[3] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .

[4] Claus-Peter Schnorr,et al. Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[5] A. Lee Swindlehurst,et al. A vector-perturbation technique for near-capacity multiantenna multiuser communication-part II: perturbation , 2005, IEEE Transactions on Communications.

[6] K. Kammeyer,et al. Efficient algorithm for decoding layered space-time codes , 2001 .

[7] Gerhard Fettweis,et al. SPC09-5: Reduced Complexity Vector Precoding for the Multiuser Downlink , 2006, IEEE Globecom 2006.

[8] A. Lee Swindlehurst,et al. A vector-perturbation technique for near-capacity multiantenna multiuser communication-part I: channel inversion and regularization , 2005, IEEE Transactions on Communications.

[9] Wolfgang Utschick,et al. Minimum Mean Square Error Vector Precoding , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.