中文
相关论文

相关论文: The Filtered Gaussian Primitive Diamond Channel

200 篇论文

Diversity-multiplexing trade-off has been studied extensively to quantify the benefits of different relaying strategies in terms of error and rate performance. However, even in the case of a single half-duplex relay, which seems fully…

信息论 · 计算机科学 2013-05-16 Ritesh Kolte , Ayfer Özgür

In this paper, we investigate the capacity of the Gaussian two-hop full-duplex (FD) relay channel with residual self-interference. This channel is comprised of a source, an FD relay, and a destination, where a direct source-destination link…

信息论 · 计算机科学 2016-11-17 Nikola Zlatanov , Erik Sippel , Vahid Jamali , Robert Schober

A new approach to distributed cooperative beamforming in relay networks with frequency selective fading is proposed. It is assumed that all the relay nodes are equipped with finite impulse response (FIR) filters and use a filter-and-forward…

适应与自组织系统 · 物理学 2016-11-15 Haihua Chen , Alex B. Gershman , Shahram Shahbazpanahi

An Interference Channel with Generalized Feedback (IFC-GF) is a model for a wireless network where several source-destination pairs compete for the same channel resources, and where the sources have the ability to sense the current channel…

信息论 · 计算机科学 2010-06-10 Echo Yang , Daniela Tuninetti

This paper revisits the Gaussian degraded relay channel, where the link that carries information from the source to the destination is a physically degraded version of the link that carries information from the source to the relay. The…

信息论 · 计算机科学 2016-10-19 Silas L. Fong , Vincent Y. F. Tan

The capacity of a relay channel with inter-symbol interference (ISI) and additive colored Gaussian noise is examined under an input power constraint. Prior results are used to show that the capacity of this channel can be computed by…

信息论 · 计算机科学 2011-03-02 Chiranjib Choudhuri , Urbashi Mitra

We consider the N-relay Gaussian diamond network where a source node communicates to a destination node via N parallel relays through a cascade of a Gaussian broadcast (BC) and a multiple access (MAC) channel. Introduced in 2000 by Schein…

信息论 · 计算机科学 2013-08-09 Bobbie Chern , Ayfer Özgür

This paper describes an approach for half-duplex cooperative transmission in a classical three-node relay channel. Assuming availability of channel state information at nodes, the approach makes use of this information to optimize distinct…

信息论 · 计算机科学 2011-11-09 Tan F. Wong , Tat M. Lok , John M. Shea

In this paper, we study the three-node Decode-and-Forward (D&F) relay network subject to random and burst packet erasures. The source wishes to transmit an infinite stream of packets to the destination via the relay. The three-node D&F…

信息论 · 计算机科学 2022-11-30 Shubhransh Singhvi , Gayathri R. , P. Vijay Kumar

We derive the optimal resource allocation of a practical half-duplex scheme for the Gaussian multiple access channel with transmitter cooperation (MAC-TC). Based on rate splitting and superposition coding, two users transmit information to…

信息论 · 计算机科学 2015-03-20 Ahmad Abu Al Haija , Mai Vu

As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, for which lower and upper bounds on the capacity are derived. For the parallel relay channel with degraded subchannels, the…

信息论 · 计算机科学 2007-07-13 Yingbin Liang , Venugopal V. Veeravalli , H. Vincent Poor

Quantize-Map-and-Forward (QMF) relaying has been shown to achieve the optimal diversity-multiplexing trade-off (DMT) for arbitrary slow fading full-duplex networks as well as for the single-relay half-duplex network. A key reason for this…

信息论 · 计算机科学 2016-11-18 Ayan Sengupta , I-Hsiang Wang , Christina Fragouli

This paper investigates the Diversity Multiplexing Tradeoff (DMT) of the generalized quantize-and-forward (GQF) relaying scheme over the slow fading half-duplex multiple-access relay channel (HD-MARC). The compress-and-forward (CF) scheme…

信息论 · 计算机科学 2014-06-24 Ming Lei , Mohammad Reza Soleymani

This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each…

信息论 · 计算机科学 2011-08-02 Ahmad Abu Al Haija , Mai Vu

We consider the arbitrarily varying Gaussian relay channel with sender frequency division. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. It is observed that when the channel…

信息论 · 计算机科学 2018-06-01 Uzi Pereg , Yossef Steinberg

We consider the transmission of a common message from a transmitter to three receivers over a broadcast channel, referred to as a multicast channel in this case. All the receivers are allowed to cooperate with each other over full-duplex…

信息论 · 计算机科学 2017-02-20 Victor Exposito , Sheng Yang , Nicolas Gresset

This paper studies the throughput maximization problem for a three-node relay channel with non-ideal circuit power. In particular, the relay operates in a half-duplex manner, and the decode-and-forward (DF) relaying scheme is adopted.…

信息论 · 计算机科学 2017-06-20 Hengjing Liang , Chuan Huang , Zhi Chen , Shaoqian Li

It is known that circularly symmetric Gaussian signals are the optimal input signals for the partial decode-and-forward (PDF) coding scheme in the Gaussian multiple-input multiple-output (MIMO) relay channel, but there is currently no…

信息论 · 计算机科学 2019-11-15 Christoph Hellings , Patrick Gest , Thomas Wiegart , Wolfgang Utschick

Communication over a fully quantum relay channel is considered. We establish three bounds based on different coding strategies, i.e., partial decode-forward, measure-forward, and assist-forward. Using the partial-decode forward strategy,…

量子物理 · 物理学 2025-05-22 Uzi Pereg

In this paper, relay selection is considered to enhance security of a cooperative system with multiple threshold-selection decode-and-forward (DF) relays. Threshold-selection DF relays are the relays in which a predefined signal-to-noise…

信号处理 · 电气工程与系统科学 2018-03-05 C. Kundu , T. M. N. Ngatched , O. A. Dobre