On beamforming with finite rate feedback in multiple-antenna systems

Krishna Kiran Mukkavilli, Ashutosh Sabharwal, Elza Erkip, Behnaam Aazhang

Research output: Contribution to journalArticle

Abstract

In this paper, we study a multiple-antenna system where the transmitter is equipped with quantized information about instantaneous channel realizations. Assuming that the transmitter uses the quantized information for beamforming, we derive a universal lower bound on the outage probability for any finite set of beamformers. The universal lower bound provides a concise characterization of the gain with each additional bit of feedback information regarding the channel. Using the bound, it is shown that finite information systems approach the perfect information case as (t - 1)2-B/t-1, where B is the number of feedback bits and t is the number of transmit antennas. The geometrical bounding technique, used in the proof of the lower bound, also leads to a design criterion for good beamformers, whose outage performance approaches the lower bound. The design criterion minimizes the maximum inner product between any two beamforming vectors in the beamformer codebook, and is equivalent to the problem of designing unitary space-time codes under certain conditions. Finally, we show that good beamformers are good packings of two-dimensional subspaces in a 2t-dimensional real Grassmannian manifold with chordal distance as the metric.

Original languageEnglish (US)
Pages (from-to)2562-2579
Number of pages18
JournalIEEE Transactions on Information Theory
Volume49
Issue number10
DOIs
StatePublished - Oct 2003

Fingerprint

Beamforming
Outages
Transmitters
Antennas
Feedback
Space time codes
Information systems
information system
performance

Keywords

  • Beamforming
  • Feedback
  • Multiple antennas
  • Outage probability
  • Transmit diversity
  • Unitary codes

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

On beamforming with finite rate feedback in multiple-antenna systems. / Mukkavilli, Krishna Kiran; Sabharwal, Ashutosh; Erkip, Elza; Aazhang, Behnaam.

In: IEEE Transactions on Information Theory, Vol. 49, No. 10, 10.2003, p. 2562-2579.

Research output: Contribution to journalArticle

Mukkavilli, Krishna Kiran ; Sabharwal, Ashutosh ; Erkip, Elza ; Aazhang, Behnaam. / On beamforming with finite rate feedback in multiple-antenna systems. In: IEEE Transactions on Information Theory. 2003 ; Vol. 49, No. 10. pp. 2562-2579.
@article{52a7663ceb92404eaec9a7cd9c596d45,
title = "On beamforming with finite rate feedback in multiple-antenna systems",
abstract = "In this paper, we study a multiple-antenna system where the transmitter is equipped with quantized information about instantaneous channel realizations. Assuming that the transmitter uses the quantized information for beamforming, we derive a universal lower bound on the outage probability for any finite set of beamformers. The universal lower bound provides a concise characterization of the gain with each additional bit of feedback information regarding the channel. Using the bound, it is shown that finite information systems approach the perfect information case as (t - 1)2-B/t-1, where B is the number of feedback bits and t is the number of transmit antennas. The geometrical bounding technique, used in the proof of the lower bound, also leads to a design criterion for good beamformers, whose outage performance approaches the lower bound. The design criterion minimizes the maximum inner product between any two beamforming vectors in the beamformer codebook, and is equivalent to the problem of designing unitary space-time codes under certain conditions. Finally, we show that good beamformers are good packings of two-dimensional subspaces in a 2t-dimensional real Grassmannian manifold with chordal distance as the metric.",
keywords = "Beamforming, Feedback, Multiple antennas, Outage probability, Transmit diversity, Unitary codes",
author = "Mukkavilli, {Krishna Kiran} and Ashutosh Sabharwal and Elza Erkip and Behnaam Aazhang",
year = "2003",
month = "10",
doi = "10.1109/TIT.2003.817433",
language = "English (US)",
volume = "49",
pages = "2562--2579",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - On beamforming with finite rate feedback in multiple-antenna systems

AU - Mukkavilli, Krishna Kiran

AU - Sabharwal, Ashutosh

AU - Erkip, Elza

AU - Aazhang, Behnaam

PY - 2003/10

Y1 - 2003/10

N2 - In this paper, we study a multiple-antenna system where the transmitter is equipped with quantized information about instantaneous channel realizations. Assuming that the transmitter uses the quantized information for beamforming, we derive a universal lower bound on the outage probability for any finite set of beamformers. The universal lower bound provides a concise characterization of the gain with each additional bit of feedback information regarding the channel. Using the bound, it is shown that finite information systems approach the perfect information case as (t - 1)2-B/t-1, where B is the number of feedback bits and t is the number of transmit antennas. The geometrical bounding technique, used in the proof of the lower bound, also leads to a design criterion for good beamformers, whose outage performance approaches the lower bound. The design criterion minimizes the maximum inner product between any two beamforming vectors in the beamformer codebook, and is equivalent to the problem of designing unitary space-time codes under certain conditions. Finally, we show that good beamformers are good packings of two-dimensional subspaces in a 2t-dimensional real Grassmannian manifold with chordal distance as the metric.

AB - In this paper, we study a multiple-antenna system where the transmitter is equipped with quantized information about instantaneous channel realizations. Assuming that the transmitter uses the quantized information for beamforming, we derive a universal lower bound on the outage probability for any finite set of beamformers. The universal lower bound provides a concise characterization of the gain with each additional bit of feedback information regarding the channel. Using the bound, it is shown that finite information systems approach the perfect information case as (t - 1)2-B/t-1, where B is the number of feedback bits and t is the number of transmit antennas. The geometrical bounding technique, used in the proof of the lower bound, also leads to a design criterion for good beamformers, whose outage performance approaches the lower bound. The design criterion minimizes the maximum inner product between any two beamforming vectors in the beamformer codebook, and is equivalent to the problem of designing unitary space-time codes under certain conditions. Finally, we show that good beamformers are good packings of two-dimensional subspaces in a 2t-dimensional real Grassmannian manifold with chordal distance as the metric.

KW - Beamforming

KW - Feedback

KW - Multiple antennas

KW - Outage probability

KW - Transmit diversity

KW - Unitary codes

UR - http://www.scopus.com/inward/record.url?scp=0242270754&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0242270754&partnerID=8YFLogxK

U2 - 10.1109/TIT.2003.817433

DO - 10.1109/TIT.2003.817433

M3 - Article

VL - 49

SP - 2562

EP - 2579

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 10

ER -