JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/15065
|
Title: | Performance analysis for two-way lossy-forward relaying with random Rician K-factor |
Authors: | Qian, Shen He, Jiguang Juntti, Markku Matsumoto, Tad |
Keywords: | Outage probability two-way relaying lossy-forward random K-factor multiple access channel (MAC) |
Issue Date: | 2017-07-31 |
Publisher: | The Institute of Electronics, Information and Communication Engineers (IEICE) |
Magazine name: | IEICE Communications Express |
Volume: | 6 |
Number: | 10 |
Start page: | 578 |
End page: | 583 |
DOI: | 10.1587/comex.2017XBL0091 |
Abstract: | A novel lossy-forward (LF) cooperative communication scheme based on the decode-and-forward (DF) protocol allowing source-relay link errors is proposed recently. The LF relaying scheme always allows the relay to forward the decoded information to the destination even though it may contain errors. The knowledge of the correlation between received information sequences is exploited in the decoding process at the destination to improve the system performance. In this paper, we derive exact expressions of the outage probability upper bound for a two-way LF relay system over Rician fading channels with random K-factor. The K-factor follows empirical distributions derived from measurement data. It is found that the two-way relaying with LF is superior to that with DF scheme in terms of the outage performance. |
Rights: | Copyright (C) 2017 The Institute of Electronics, Information and Communication Engineers (IEICE). Shen Qian, Jiguang He, Markku Juntti, Tad Matsumoto, IEICE Communications Express, 6(10), 2017, 578-583. http://dx.doi.org/10.1587/comex.2017XBL0091 |
URI: | http://hdl.handle.net/10119/15065 |
Material Type: | publisher |
Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
File |
Description |
Size | Format |
2559.pdf | | 796Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|