JOURNAL ARTICLE

Multihop virtual full-duplex relay channels

Abstract

We introduce a multihop "virtual" full-duplex relay channel as a special case of a general multiple multicast relay network. For such network, quantize-map-and-forward (QMF) (or noisy network coding (NNC)) can achieve the cut-set upper bound within a constant gap where the gap grows linearly with the number of relay stages K. However, this gap may not be negligible for the systems with multihop transmissions (e.g., a power-limited wireless backhaul system operating at high frequencies). In this paper, we obtain an improved result to the capacity scaling where the gap grows logarithmically as log (K). This is achieved by using an optimal quantization at relays and by exploiting relays' messages (decoded in the previous time slot) as side-information at the destination. We further improve the performance of this network by presenting a mixed strategy where each relay can perform either decode-and-forward (DF) or QMF with possibly rate-splitting.

Keywords:
Relay Linear network coding Computer science Relay channel Multicast Computer network Quantization (signal processing) Wireless Topology (electrical circuits) Wireless network Upper and lower bounds Channel (broadcasting) Power (physics) Algorithm Telecommunications Mathematics Electrical engineering Physics Engineering

Metrics

8
Cited By
1.00
FWCI (Field Weighted Citation Impact)
14
Refs
0.81
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Full-Duplex Wireless Communications
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Cooperative Communication and Network Coding
Physical Sciences →  Computer Science →  Computer Networks and Communications
Wireless Communication Security Techniques
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.