MIMO relaying with linear processing for multiuser transmission in fixed relay networks
- Authors
- Chae, Chan-Byoung; Tang, Taiwen; Heath, Robert W., Jr.; Cho, Sunghyun
- Issue Date
- Feb-2008
- Publisher
- IEEE
- Keywords
- Broadcast channels (BC); Multiple-input multiple-output (MIMO) systems; Multiuser channels; Relays
- Citation
- IEEE TRANSACTIONS ON SIGNAL PROCESSING, v.56, no.2, pp.727 - 738
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON SIGNAL PROCESSING
- Volume
- 56
- Number
- 2
- Start Page
- 727
- End Page
- 738
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/42675
- DOI
- 10.1109/TSP.2007.907821
- ISSN
- 1053-587X
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF COMPUTING > ERICA 컴퓨터학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/42675)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.