• DocumentCode
    2782805
  • Title

    Switched lattice reduction-aided detection techniques for MIMO systems

  • Author

    Zu, K. ; de Lamare, R.C.

  • Author_Institution
    Dept. of Electron., Commun. Res. Group, Univ. of York, York, UK
  • fYear
    2011
  • fDate
    27-29 Sept. 2011
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Lattice reduction (LR) aided multiple-input- multiple-output (MIMO) linear detection can achieve the diversity order as the maximum likelihood detection (MID). By employing the most commonly used Lenstra, Lenstra, and L. Lov´asz (LLL) algorithm, an equivalent channel matrix which is shorter and nearly orthogonal is obtained. The noise enhancement can be greatly reduced by employing the LR-aided detection. However, the LLL algorithm cannot guarantee to find the optimal basis. The optimal lattice basis can be found by the Korkin and Zolotarev (KZ) reduction which is infeasible in practice due to its high complexity. In this paper, a switched algorithm is proposed based on the complex LLL (CLLL) algorithm to approach the optimal performance while maintaining a reasonable complexity. The linear and successive interference cancelation (SIC) detection algorithms are devised based on a strategy that permutes the lattice bases and switches to the best available set. The results of simulation show that the proposed techniques outperform existing methods.
  • Keywords
    MIMO communication; interference suppression; telecommunication channels; Korkin and Zolotarev reduction; LLL algorithm; LR-aided detection; Lenstra-Lenstra-L. Lov´asz algorithm; MIMO systems; channel matrix; complex LLL algorithm; lattice reduction aided multiple-input-multiple-output linear detection; maximum likelihood detection; successive interference cancelation detection algorithm; switched lattice reduction-aided detection techniques;
  • fLanguage
    English
  • Publisher
    iet
  • Conference_Titel
    Sensor Signal Processing for Defence (SSPD 2011)
  • Conference_Location
    London
  • Electronic_ISBN
    978-1-84919-661-1
  • Type

    conf

  • DOI
    10.1049/ic.2011.0149
  • Filename
    6253405