MIMO relaying with linear processing for multiuser transmission in fixed relay networks

Chan Byoung Chae, Taiwen Tang, Robert W. Heath, Sunghyun Cho

Research output: Contribution to journalArticle

271 Citations (Scopus)

Abstract

In this paper, a novel relaying strategy that uses multiple-input multiple-output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks is proposed. The fixed relay processes the received signal with linear operations and forwards the processed signal to multiple users creating a multiuser MIMO relay. This paper proposes upper and lower bounds on the achievable sum rate for this architecture assuming zero-forcing dirty paper coding at the base station, neglecting the direct links from the base station to the users, and with certain structure in the relay. These bounds are used to motivate an implementable multiuser precoding strategy that combines Tomlinson-Harashima precoding at the base station and linear signal processing at the relay, adaptive stream selection, and QAM modulation. Reduced complexity algorithms based on the sum rate lower bounds are used to select a subset of users. We compare the sum rates achieved by the proposed system architecture and algorithms with the sum rate upper bound and the sum rate achieved by the decode-and-forward relaying.

Original languageEnglish
Pages (from-to)727-738
Number of pages12
JournalIEEE Transactions on Signal Processing
Volume56
Issue number2
DOIs
Publication statusPublished - 2008 Feb 1

Fingerprint

Base stations
Processing
Quadrature amplitude modulation
Signal processing
Modulation

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Chae, Chan Byoung ; Tang, Taiwen ; Heath, Robert W. ; Cho, Sunghyun. / MIMO relaying with linear processing for multiuser transmission in fixed relay networks. In: IEEE Transactions on Signal Processing. 2008 ; Vol. 56, No. 2. pp. 727-738.
@article{28cf1b191d2b44c39cb337576b7f91d2,
title = "MIMO relaying with linear processing for multiuser transmission in fixed relay networks",
abstract = "In this paper, a novel relaying strategy that uses multiple-input multiple-output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks is proposed. The fixed relay processes the received signal with linear operations and forwards the processed signal to multiple users creating a multiuser MIMO relay. This paper proposes upper and lower bounds on the achievable sum rate for this architecture assuming zero-forcing dirty paper coding at the base station, neglecting the direct links from the base station to the users, and with certain structure in the relay. These bounds are used to motivate an implementable multiuser precoding strategy that combines Tomlinson-Harashima precoding at the base station and linear signal processing at the relay, adaptive stream selection, and QAM modulation. Reduced complexity algorithms based on the sum rate lower bounds are used to select a subset of users. We compare the sum rates achieved by the proposed system architecture and algorithms with the sum rate upper bound and the sum rate achieved by the decode-and-forward relaying.",
author = "Chae, {Chan Byoung} and Taiwen Tang and Heath, {Robert W.} and Sunghyun Cho",
year = "2008",
month = "2",
day = "1",
doi = "10.1109/TSP.2007.907821",
language = "English",
volume = "56",
pages = "727--738",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

MIMO relaying with linear processing for multiuser transmission in fixed relay networks. / Chae, Chan Byoung; Tang, Taiwen; Heath, Robert W.; Cho, Sunghyun.

In: IEEE Transactions on Signal Processing, Vol. 56, No. 2, 01.02.2008, p. 727-738.

Research output: Contribution to journalArticle

TY - JOUR

T1 - MIMO relaying with linear processing for multiuser transmission in fixed relay networks

AU - Chae, Chan Byoung

AU - Tang, Taiwen

AU - Heath, Robert W.

AU - Cho, Sunghyun

PY - 2008/2/1

Y1 - 2008/2/1

N2 - In this paper, a novel relaying strategy that uses multiple-input multiple-output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks is proposed. The fixed relay processes the received signal with linear operations and forwards the processed signal to multiple users creating a multiuser MIMO relay. This paper proposes upper and lower bounds on the achievable sum rate for this architecture assuming zero-forcing dirty paper coding at the base station, neglecting the direct links from the base station to the users, and with certain structure in the relay. These bounds are used to motivate an implementable multiuser precoding strategy that combines Tomlinson-Harashima precoding at the base station and linear signal processing at the relay, adaptive stream selection, and QAM modulation. Reduced complexity algorithms based on the sum rate lower bounds are used to select a subset of users. We compare the sum rates achieved by the proposed system architecture and algorithms with the sum rate upper bound and the sum rate achieved by the decode-and-forward relaying.

AB - In this paper, a novel relaying strategy that uses multiple-input multiple-output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks is proposed. The fixed relay processes the received signal with linear operations and forwards the processed signal to multiple users creating a multiuser MIMO relay. This paper proposes upper and lower bounds on the achievable sum rate for this architecture assuming zero-forcing dirty paper coding at the base station, neglecting the direct links from the base station to the users, and with certain structure in the relay. These bounds are used to motivate an implementable multiuser precoding strategy that combines Tomlinson-Harashima precoding at the base station and linear signal processing at the relay, adaptive stream selection, and QAM modulation. Reduced complexity algorithms based on the sum rate lower bounds are used to select a subset of users. We compare the sum rates achieved by the proposed system architecture and algorithms with the sum rate upper bound and the sum rate achieved by the decode-and-forward relaying.

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

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

U2 - 10.1109/TSP.2007.907821

DO - 10.1109/TSP.2007.907821

M3 - Article

AN - SCOPUS:39649100853

VL - 56

SP - 727

EP - 738

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 2

ER -