中文
相关论文

相关论文: Achievable Rates for a Distributed Antenna System …

200 篇论文

A discrete memoryless half-duplex relay channel is constructed from a broadcast channel from the source to the relay and destination and a multiple access channel from the source and relay to the destination. When the relay listens, the…

信息论 · 计算机科学 2007-08-17 Saravanan Vijayakumaran , Tan F. Wong , Tat M. Lok

In the half-duplex single relay selection network, comprised of a source, $M$ half-duplex relays, and a destination, only one relay is active at any given time, i.e., only one relay receives or transmits, and the other relays are inactive,…

信息论 · 计算机科学 2015-04-10 Nikola Zlatanov , Vahid Jamali , Robert Schober

This paper investigates the additive white Gaussian noise two-way relay channel, where two users exchange messages through a relay. Asymmetrical channels are considered where the users can transmit data at different rates and at different…

信息论 · 计算机科学 2011-10-26 Lawrence Ong , Christopher M. Kellett , Sarah J. Johnson

In this paper, we derive information-theoretic performance limits for three classes of two-user state-dependent discrete memoryless broadcast channels, with noncausal side-information at the encoder. The first class of channels comprises a…

信息论 · 计算机科学 2012-07-17 K. G. Nagananda , Chandra R. Murthy , Shalinee Kishore

In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of a relay. In this paper, we derive achievable rate regions for four new half-duplex protocols and…

信息论 · 计算机科学 2009-05-16 Sang Joon Kim , Natasha Devroye , Patrick Mitran , Vahid Tarokh

A network of $n$ wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power $P$ or remain silent. The objective is to maximize the number of…

信息论 · 计算机科学 2007-10-30 Masoud Ebrahimi , Amir K. Khandani

This paper introduces a new mathematical framework, which is used to derive joint uplink/downlink achievable rate regions for multi-user spatial multiplexing between one base station and multiple terminals. The framework consists of two…

信息论 · 计算机科学 2010-02-03 Patrick Marsch , Peter Rost , Gerhard Fettweis

We consider a scalable user-centric wireless network with dynamic cluster formation as defined by Bj\"ornsson and Sanguinetti. After having shown the importance of dominant channel subspace information for uplink (UL) pilot decontamination…

信息论 · 计算机科学 2022-01-19 Fabian Göttsch , Noboru Osawa , Takeo Ohseki , Kosuke Yamazaki , Giuseppe Caire

In this paper, we present nontrivial upper and lower bounds on the secrecy capacity of the degraded Gaussian diamond-wiretap channel and identify several ranges of channel parameters where these bounds coincide with useful intuitions.…

信息论 · 计算机科学 2015-04-23 Si-Hyeon Lee , Ashish Khisti

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…

信息论 · 计算机科学 2010-08-16 Anas Chaaban , Aydin Sezgin

In this paper, the diamond relay channel is considered, which consists of one source-destination pair and two relay nodes connected with rate-limited out-of-band conferencing links. In particular, we focus on the half-duplex alternative…

信息论 · 计算机科学 2012-05-08 Chuan Huang , Shuguang Cui

In this paper, achievable rates and optimal resource allocation strategies for imperfectly-known fading relay channels are studied. It is assumed that communication starts with the network training phase in which the receivers estimate the…

信息论 · 计算机科学 2008-03-14 Junwei Zhang , Mustafa Cenk Gursoy

We study the fundamental network capacity of a multi-user wireless downlink under two assumptions: (1) Channels are not explicitly measured and thus instantaneous states are unknown, (2) Channels are modeled as ON/OFF Markov chains. This is…

信息论 · 计算机科学 2010-04-23 Chih-ping Li , Michael J. Neely

In this paper, achievable rates of imperfectly-known fading relay channels are studied. It is assumed that communication starts with the network training phase in which the receivers estimate the fading coefficients of their respective…

信息论 · 计算机科学 2007-07-13 Junwei Zhang , Mustafa Cenk Gursoy

In this paper we investigate the achievable rate of a system that includes a nomadic transmitter with several antennas, which is received by multiple agents, exhibiting independent channel gains and additive circular-symmetric complex…

信息论 · 计算机科学 2007-10-02 Amichai Sanderovich , Shlomo Shamai , Yossef Steinberg

In many wireless communication systems, radios are subject to a duty cycle constraint, that is, a radio only actively transmits signals over a fraction of the time. For example, it is desirable to have a small duty cycle in some low power…

信息论 · 计算机科学 2012-09-24 Lei Zhang , Hui Li , Dongning Guo

Communication networks are often designed and analyzed assuming tight synchronization among nodes. However, in applications that require communication in the energy-efficient regime of low signal-to-noise ratios, establishing tight…

信息论 · 计算机科学 2016-11-18 Ritesh Kolte , Urs Niesen , Piyush Gupta

We analyze the achievable rate in interference-free wireless networks with physical layer fading channels and orthogonal multiple access. As a starting point, the point-to-point channel is considered. We find the optimal physical and…

信息论 · 计算机科学 2016-11-18 Tao Cui , Tracey Ho , Joerg Kliewer

This paper studies the downlink of a cloud radio access network (C-RAN) in which a centralized processor (CP) communicates with mobile users through base stations (BSs) that are connected to the CP via finite-capacity fronthaul links.…

信息论 · 计算机科学 2019-07-23 Pratik Patil , Wei Yu

In a centralized RAN, the signals from multiple RAPs are processed centrally in a data center. Centralized RAN enables advanced interference coordination strategies while leveraging the elastic provisioning of data processing resources. It…

信息论 · 计算机科学 2015-08-11 Peter Rost , Salvatore Talarico , Matthew C. Valenti