• DocumentCode
    2427988
  • Title

    Transmit Precoding for the Multiple Antenna Broadcast Channel

  • Author

    Airy, Manish ; Bhadra, Sandeep ; Heath, Robert W. ; Shakkottai, Sanjay

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX
  • Volume
    3
  • fYear
    2006
  • fDate
    7-10 May 2006
  • Firstpage
    1396
  • Lastpage
    1400
  • Abstract
    In this paper we compare the following two methods of transmit preceding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also termed zero forcing or ZF) precoding and scalar Tomlinson-Harashima (TH) precoding applied to sum-rate achieving transmit precoding. Our results indicate that vector perturbation applied to channel inversion preceding can significantly reduce power enhancement and yields the full diversity afforded by the channel to each user. Scalar TH-modulo reduction significantly reduces the power enhancement for precoding based on sum-rate criterion. The solution to vector perturbation applied to ZF precoding requires the solution to an integer optimization problem which is exponentially complex, or an approximation to the integer optimization problem which requires the Lenstra-Lenstra-Lovasz algorithm of polynomial complexity. Instead we propose a simpler solution (an approximation) to the vector perturbation problem based on the Rayleigh-Ritz theorem (R.A. Horn and C.R. Johnson, 1985). This approximate solution achieves the same diversity order as the optimal vector perturbation technique, but suffers a small coding loss. This solution is of polynomial complexity order. Further, a small increase in complexity with a "sphere"-based search around this solution yields significantly better performance. Since this vector perturbation is required to be done at the symbol rate, the lower complexity of the proposed algorithm is valuable in practice
  • Keywords
    antenna arrays; broadcast channels; channel coding; computational complexity; optimisation; polynomials; precoding; Lenstra-Lenstra-Lovasz algorithm; broadcast channel; channel inversion; integer optimization problem; multiple antenna; polynomial complexity; scalar Tomlinson-Harashima precoding; sphere-based search; sum-rate criterion; transmit precoding; vector perturbation; zero forcing; Additive noise; Array signal processing; Broadcasting; Decision feedback equalizers; Interference; MIMO; Polynomials; Receiving antennas; Transmitters; Transmitting antennas;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Vehicular Technology Conference, 2006. VTC 2006-Spring. IEEE 63rd
  • Conference_Location
    Melbourne, Vic.
  • ISSN
    1550-2252
  • Print_ISBN
    0-7803-9391-0
  • Electronic_ISBN
    1550-2252
  • Type

    conf

  • DOI
    10.1109/VETECS.2006.1683064
  • Filename
    1683064