English
Related papers

Related papers: Power Allocation for Fading Channels with Peak-to-…

200 papers

This paper investigates the maximal channel coding rate achievable at a given blocklength $n$ and error probability $\epsilon$, when the codewords are subject to a long-term (i.e., averaged-over-all-codeword) power constraint. The…

Information Theory · Computer Science 2015-07-15 Wei Yang , Giuseppe Caire , Giuseppe Durisi , Yury Polyanskiy

We consider the problem of rate and power allocation for a sensor network under the pairwise distributed source coding constraint. For noiseless source-terminal channels, we show that the minimum sum rate assignment can be found by finding…

Information Theory · Computer Science 2009-06-10 Shizheng Li , Aditya Ramamoorthy

Asymptotic comparisons of ergodic channel capacity at high and low signal-to-noise ratios (SNRs) are provided for several adaptive transmission schemes over fading channels with general distributions, including optimal power and rate…

Information Theory · Computer Science 2012-02-07 Yuan Zhang , Cihan Tepedelenlioglu

In this letter, we consider an underlay cognitive radio network assisted by dual-hop decode-and-forward (DF) relaying. For a general multi-user network, we adopt a max-min fairness relay selection scheme and analyse the outage probability…

Information Theory · Computer Science 2021-05-11 Lanwei Zhang , Rajitha Senanayake , Saman Atapattu , Jamie Evans

We consider a joint scheduling-and-power-allocation problem of a downlink cellular system. The system consists of two groups of users: real-time (RT) and non-real-time (NRT) users. Given an average power constraint on the base station, the…

Information Theory · Computer Science 2017-05-08 Ahmed Ewaisha , Cihan Tepedelenlioglu

The problem of resource allocation is studied for a two-user fading orthogonal multiaccess relay channel (MARC) where both users (sources) communicate with a destination in the presence of a relay. A half-duplex relay is considered that…

Information Theory · Computer Science 2016-11-17 Lalitha Sankar , Yingbin Liang , H. Vincent Poor , Narayan B. Mandayam

There are currently a plurality of capacity theories of fading channels, including the ergodic capacity for fast fading channels and outage capacity for slow fading channels. However, analyses show that the outage capacity is a…

Information Theory · Computer Science 2019-04-01 Xuezhi Yang

Wireless systems that carry delay-sensitive information (such as speech and/or video signals) typically transmit with fixed data rates, but may occasionally suffer from transmission outages caused by the random nature of the fading…

Information Theory · Computer Science 2016-11-15 Zoran Hadzi-Velkov , Nikola Zlatanov , Robert Schober

Upper bounds on the capacity of vector Gaussian channels affected by fading are derived under peak amplitude constraints at the input. The focus is on constraint regions that can be decomposed in a Cartesian product of sub-regions. This…

Information Theory · Computer Science 2022-07-05 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

We investigate the problem of message transmission and the problem of common randomness (CR) generation over single-user multiple-input multiple-output (MIMO) slow fading channels with average input power constraint, additive white Gaussian…

Information Theory · Computer Science 2022-10-24 Rami Ezzine , Moritz Wiese , Christian Deppe , Holger Boche

In fading channels, power allocation over channel state may bring a rate increment compared to the fixed constant power mode. Such a rate increment is referred to power allocation gain. It is expected that the power allocation gain varies…

Information Theory · Computer Science 2014-12-25 Zhengchuan Chen , Pingyi Fan , Dapeng Wu , Liquan Shen

In this paper, we aim to design an adaptive power allocation scheme to minimize the average transmit power of a hybrid automatic repeat request with chase combining (HARQ-CC) enabled non-orthogonal multiple access (NOMA) system under strict…

Information Theory · Computer Science 2019-11-05 Yanqing Xu , Donghong Cai , Fang Fang , Zhiguo Ding , Chao Shen , Gang Zhu

This paper considers resource allocation to achieve max-min fairness in a selection-based orthogonal frequency division multiplexing network wherein source nodes are assisted by fixed decode-and-forward relays. The joint problem of…

Information Theory · Computer Science 2011-12-14 Kianoush Hosseini , Raviraj S. Adve

The performance of systems where multiple users communicate over wireless fading links benefits from channel-adaptive allocation of the available resources. Different from most existing approaches that allocate resources based on perfect…

Information Theory · Computer Science 2009-09-07 Antonio G. Marques , Georgios B. Giannakis , Javier Ramos

We analyze a wireless communication system with finite block length and finite battery energy, under quasi-static Nakagami-m fading. Wireless energy transfer is carried out in the downlink while information transfer occurs in the uplink.…

Information Theory · Computer Science 2017-12-21 Onel L. A. López , Evelio M. G. Fernández , R. D. Souza , H. Alves

This paper considers the minimization of transmit power in Gaussian parallel interference channels, subject to a rate constraint for each user. To derive decentralized solutions that do not require any cooperation among the users, we…

Information Theory · Computer Science 2011-11-09 Jong-Shi Pang , Gesualdo Scutari , Francisco Facchinei , Chaoxiong Wang

This is the first part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading. Both transmitter and jammer are subject to power constraints which can be enforced over each codeword short-term…

Information Theory · Computer Science 2008-08-27 George T. Amariucai , Shuangqing Wei

The capacity of peak-power limited, single-antenna, noncoherent, flat-fading channels with memory is considered. The emphasis is on the capacity pre-log, i.e., on the limiting ratio of channel capacity to the logarithm of the…

Information Theory · Computer Science 2009-02-20 Tobias Koch , Amos Lapidoth

Compute-and-forward (CF) is a relaying strategy which allows the relay to decode a linear combination of the transmitted messages. This work studies the optimal power allocation problem for the CF scheme in fast fading channels for…

Information Theory · Computer Science 2024-11-18 Lanwei Zhang , Jamie Evans , Jingge Zhu

This paper studies the performance of block coding on an additive white Gaussian noise channel under different power limitations at the transmitter. Lower bounds are presented for the minimum error probability of codes satisfying maximal…

Information Theory · Computer Science 2020-08-19 Gonzalo Vazquez-Vilar
‹ Prev 1 3 4 5 6 7 10 Next ›