Opportunistic Decouple-and-Forward Relaying: Harnessing Distributed Antennas
- Authors
- Lee, Jaeyoung; Shin, Hyundong; Heo, Jun
- Issue Date
- 6월-2014
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- Keywords
- multiple-input multiple-output (MIMO); symbol error probability; orthogonal space-time block codes (OSTBCs); amplify-and-forward (AF) relaying
- Citation
- IEICE TRANSACTIONS ON COMMUNICATIONS, v.E97B, no.6, pp.1148 - 1156
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEICE TRANSACTIONS ON COMMUNICATIONS
- Volume
- E97B
- Number
- 6
- Start Page
- 1148
- End Page
- 1156
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/98433
- DOI
- 10.1587/transcom.E97.B.1148
- ISSN
- 0916-8516
- Abstract
- In this paper, we consider decouple-and-forward (DCF) relaying, where the relay encodes and amplifies decoupled data using orthogonal space-time block codes (OSTBCs), to achieve the maximum diversity gain of multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying. Since the channel status of all antennas is generally unknown and time-varying for cooperation in multi-antenna multiple-relay systems, we investigate an opportunistic relaying scheme for DCF relaying to harness distributed antennas and minimize the cooperation overheads by not using the global channel state information (CSI). In addition, for realistic wireless channels which have spatial fading correlation due to closely-spaced antenna configurations and poor scattering environments, we analyze the exact and lower bound on the symbol error probability (SEP) of the opportunistic DCF relaying over spatially correlated MIMO Rayleigh fading channels. Numerical results show that, even in the presence of spatial fading correlation, the proposed opportunistic relaying scheme is efficient and achieves additional performance gain with low overhead.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Electrical Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.