English
Related papers

Related papers: DMT of weighted Parallel Channels: Application to …

200 papers

In this paper, we study the end-to-end distortion/delay tradeoff for a analogue source transmitted over a fading channel. The analogue source is quantized and stored in a buffer until it is transmitted. There are two extreme cases as far as…

Information Theory · Computer Science 2007-07-13 Qiang Li , C. N. Georghiades

The sum capacity of a class of discrete memoryless interference channels is determined. This class of channels is defined analogous to the Gaussian Z-interference channel with weak interference; as a result, the sum capacity is achieved by…

Information Theory · Computer Science 2012-07-16 Fangfang Zhu , Biao Chen

This letter analyses the effective capacity of communications system using unified models. In order to obtain a simple closed-form mathematically tractable expression, two different unified approximate models have been used. The mixture…

Information Theory · Computer Science 2018-04-26 H. Al-Hmood , H. S. Al-Raweshidy

In this paper, we analyze the performance of the uplink communication of massive multi-cell multiple-input multiple-output (MIMO) systems under the effects of pilot contamination and delayed channels because of terminal mobility. The base…

Information Theory · Computer Science 2016-11-17 Anastasios K. Papazafeiropoulos , Hien Quoc Ngo , Tharm Ratnarajah

The present paper is devoted to the evaluation of energy detection based spectrum sensing over different multipath fading and shadowing conditions. This is realized by means of a unified and versatile approach that is based on the…

The "Carbon Copy onto Dirty Paper" (CCDP) channel is the compound "writing on dirty paper" channel in which the channel output is obtained as the sum of the channel input, white Gaussian noise and a Gaussian state sequence randomly selected…

Information Theory · Computer Science 2017-07-11 Stefano Rini , Shlomo Shamai

A tradeoff between sum rate and fairness for MISO broadcast communication employing dirty paper coding or zero-forcing dirty paper coding at physical layer is investigated in this paper. The tradeoff is based on a new design objective…

Information Theory · Computer Science 2019-02-18 Ji-You Huang , Hsiao-feng Francis Lu

We consider the problem of finding optimal, fair and distributed power-rate strategies to achieve the sum capacity of the Gaussian multiple-access block-fading channel. In here, the transmitters have access to only their own fading…

Information Theory · Computer Science 2012-08-24 Sibi Raj B. Pillai , Bikash K. Dey , Yash Deshpande , Krishnamoorthy Iyer

In \cite{Chandar2008}, Chandar et al studied a problem of sequential frame synchronization for a frame transmitted randomly and uniformly among $A$ slots. For a discrete memory-less channel (DMC), they showed that the frame length $N$ must…

Information Theory · Computer Science 2015-06-24 R. M. Sundaram , Devendra Jalihal , Venkatesh Ramaiyan

In this paper we consider a channel model that is often used to describe the mobile wireless scenario: multiple-antenna additive white Gaussian noise channels subject to random (fading) gain with full channel state information at the…

Information Theory · Computer Science 2018-06-28 Austin Collins , Yury Polyanskiy

We study the effect of channel fading in Wireless Power Transfer (WPT) and show that fading enhances the RFto- DC conversion efficiency of nonlinear RF energy harvesters. We then develop a new form of signal design for WPT, denoted as…

Information Theory · Computer Science 2018-09-13 Bruno Clerckx , Junghoon Kim

In this paper, we consider a particular class of selective fading channel corresponding to a channel that is selective either in time or in frequency. For this class of channel, we propose a systematic way to achieve the optimal DMT derived…

Information Theory · Computer Science 2010-10-14 Lina Mroueh , Jean-Claude Belfiore

Independent parallel q-ary symmetric channels are a suitable transmission model for several applications. The proposed weighted-Hamming metric is tailored to this setting and enables optimal decoding performance. We show that some…

Information Theory · Computer Science 2024-02-16 Sebastian Bitzer , Alberto Ravagnani , Violetta Weger

The Gaussian broadcast channel (GBC) with $K$ transmit antennas and $K$ single-antenna users is considered for the case in which the channel state information is obtained at the transmitter via a finite-rate feedback link of capacity $r$…

Information Theory · Computer Science 2010-02-18 Chinmay S. Vaze , Mahesh K. Varanasi

This paper considers the discrete Fourier transform (DFT) based hybrid beamforming multiuser system and studies the use of analog beam selection schemes. We first analyze the uplink ergodic achievable rates of the zero-forcing (ZF) receiver…

Information Theory · Computer Science 2018-07-04 Yu Han , Shi Jin , Jun Zhang , Jiayi Zhang , Kai-Kit Wong

We propose Dynamic Meta-Metrics (DMM), a framework for machine translation evaluation that learns source-sentence conditioned combinations of existing metrics. Rather than relying on a single static ensemble or language-specific weighting,…

Computation and Language · Computer Science 2026-05-12 Luke Zhang , Justin Vasselli , Aditya Khan , York Hay Ng , En-Shiun Annie Lee

Channel estimation is one of the most important parts in current mobile communication systems. Among the huge contributions in channel estimation studies, the discrete Fourier transform (DFT)-based channel estimation has attracted lots of…

Information Theory · Computer Science 2015-04-29 H. Yu , C. Yang

The capacity of discrete-time, non-coherent, multipath fading channels is considered. It is shown that if the delay spread is large in the sense that the variances of the path gains do not decay faster than geometrically, then capacity is…

Information Theory · Computer Science 2016-11-18 Tobias Koch , Amos Lapidoth

We consider linear precoding and decoding in the downlink of a multiuser multiple-input, multiple-output (MIMO) system, wherein each user may receive more than one data stream. We propose several mean squared error (MSE) based criteria for…

Information Theory · Computer Science 2009-02-10 Adam J. Tenenbaum , Raviraj S. Adve

We consider stability of scheduled multiaccess message communication with random coding and joint maximum-likehood decoding of messages. The framework we consider here models both the random message arrivals and the subsequent reliable…

Information Theory · Computer Science 2007-07-13 KCV Kalyanarama Sesha Sayee , Utpal Mukherji