Virtual Full-Duplex Relaying with Half-Duplex Relays
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hong, Song nam | - |
dc.contributor.author | Caire, Giuseppe | - |
dc.date.accessioned | 2022-07-15T21:02:31Z | - |
dc.date.available | 2022-07-15T21:02:31Z | - |
dc.date.created | 2021-05-13 | - |
dc.date.issued | 2015-09 | - |
dc.identifier.issn | 0018-9448 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/156369 | - |
dc.description.abstract | We consider virtual full-duplex relaying by means of half-duplex relays. In this configuration, each relay stage in a multihop relaying network is formed by at least two relays, used alternatively in transmit and receive modes, such that while one relay transmits its signal to the next stage, the other relay receives a signal from the previous stage. With such a pipelined scheme, the source is active and sends a new information message in each time slot. We consider the achievable rates for various coding schemes and compare them with a cut-set upper bound, which is tight in certain conditions. We show that both lattice-based compute-and-forward (CoF) and quantize-map-and-forward (QMF) yield attractive performance and implementation. In particular, QMF in this context does not require long messages and joint (non-unique) decoding, if the quantization mean-square distortion at the relays is chosen appropriately. In addition, in the multihop case the gap of QMF from the cut-set upper bound grows logarithmically with the number of stages, and not linearly as in the case of noise level quantization. Furthermore, we show that CoF is particularly attractive in the case of multihop relaying, when the channel gains have fluctuations not larger than 3 dB, yielding a rate that does not depend on the number of relaying stages. In particular, we argue that such architecture may be useful for a wireless backhaul with line-of-sight propagation between the relays | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Institute of Electrical and Electronics Engineers | - |
dc.title | Virtual Full-Duplex Relaying with Half-Duplex Relays | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Hong, Song nam | - |
dc.identifier.doi | 10.1109/TIT.2015.2453942 | - |
dc.identifier.scopusid | 2-s2.0-84939832290 | - |
dc.identifier.wosid | 000360015900010 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Information Theory, pp.1 - 21 | - |
dc.relation.isPartOf | IEEE Transactions on Information Theory | - |
dc.citation.title | IEEE Transactions on Information Theory | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 21 | - |
dc.type.rims | ART | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.description.journalRegisteredClass | other | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | COOPERATIVE STRATEGIES | - |
dc.subject.keywordPlus | CAPACITY THEOREMS | - |
dc.subject.keywordPlus | NETWORKS | - |
dc.subject.keywordAuthor | Compute-and-Forward | - |
dc.subject.keywordAuthor | Half-Duplex Relays | - |
dc.subject.keywordAuthor | Multihop Relay Channel | - |
dc.subject.keywordAuthor | Quantize-and-Forward | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/7152910 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.