Explicit lower bounds on the outage probability of integer forcing over Nr × 2 channels

Elad Domanovitz, Uri Erez

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The performance of integer-forcing equalization for communication over the compound multiple-input multiple-output channel is investigated. An upper bound on the resulting outage probability as a function of the gap to capacity has been derived previously, assuming a random precoding matrix drawn from the circular unitary ensemble is applied prior to transmission. In the present work a simple and explicit lower bound on the worst-case outage probability is derived for the case of a system with two transmit antennas and two or more receive antennas, leveraging the properties of the Jacobi ensemble. The derived lower bound is also extended to random space-time precoding, and may serve as a useful benchmark for assessing the relative merits of various algebraic space-time precoding schemes.

Original languageEnglish
Title of host publication2017 IEEE Information Theory Workshop, ITW 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages569-573
Number of pages5
ISBN (Electronic)9781509030972
DOIs
StatePublished - 2 Jul 2017
Event2017 IEEE Information Theory Workshop, ITW 2017 - Kaohsiung, Taiwan, Province of China
Duration: 6 Nov 201710 Nov 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2018-January

Conference

Conference2017 IEEE Information Theory Workshop, ITW 2017
Country/TerritoryTaiwan, Province of China
CityKaohsiung
Period6/11/1710/11/17

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Explicit lower bounds on the outage probability of integer forcing over Nr × 2 channels'. Together they form a unique fingerprint.

Cite this