A performance-complexity tradeoff for vector perturbation precoding

Chrisos Masouros, Mahini Sellahurai, Tharmalingam Ratnarajah

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We investigate he performance-complexity tradeoff for vector perturbation (VP) precoding in he downlink of multiuser multiple input multiple output (MU-MIMO) systems. To his end, we introduce a VP design ha applies a performance-determined threshold o he desired norm of he preceded signal, o reduce he search through multiple candidate perturbation vectors by he sphere encoder. Once his threshold is me, the search for the perturbation vectors finishes thus saving significant computational burden at the transmitter. Contrary o conventional VP which performs a compuationally intense sphere search to find the absolute minimum of the transmit signal norm, he proposed scheme can trade off error rate performance for a much reduced complexity of precoding. The presented analysis and results show ha he proposed thresholded VP (TVP) offers a complexity reduction of up o 90% in a 4 × 4 and 99% in a 10 × 10 MIMO, for a moderately increased error rate.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
Pages4646-4650
Number of pages5
DOIs
Publication statusPublished - 1 Dec 2013
Event2013 IEEE International Conference on Communications, ICC 2013 - Budapest, United Kingdom
Duration: 9 Jun 201313 Jun 2013

Conference

Conference2013 IEEE International Conference on Communications, ICC 2013
CountryUnited Kingdom
CityBudapest
Period9/06/1313/06/13

Keywords

  • complexity reduction
  • multi-user MIMO
  • sphere encoding
  • Vector perturbation

Fingerprint Dive into the research topics of 'A performance-complexity tradeoff for vector perturbation precoding'. Together they form a unique fingerprint.

Cite this