English
Related papers

Related papers: Maximizing the Partial Decode-and-Forward Rate in …

200 papers

We consider a half-duplex diamond relay channel, which consists of one source-destination pair and two relay nodes connected with two-way rate-limited out-of-band conferencing links. Three basic schemes and their achievable rates are…

Information Theory · Computer Science 2015-03-17 Chuan Huang , Jinhua Jiang , Shuguang Cui

We study the question of reconstructing two signals $f$ and $g$ from their convolution $y = f\ast g$. This problem, known as {\em blind deconvolution}, pervades many areas of science and technology, including astronomy, medical imaging,…

Information Theory · Computer Science 2016-06-16 Xiaodong Li , Shuyang Ling , Thomas Strohmer , Ke Wei

We address in this paper decoding aspects of the Compute-and-Forward (CF) physical-layer network coding strategy. It is known that the original decoder for the CF is asymptotically optimal. However, its performance gap to optimal decoders…

Information Theory · Computer Science 2014-04-18 Asma Mejri , Ghaya Rekaya-Ben Othman

We have evaluated the optimal secrecy rate for Amplify-and-Forward (AF) relay networks with multiple eavesdroppers. Assuming i.i.d. Gaussian noise at the destination and the eavesdroppers, we have devised technique to calculate optimal…

Information Theory · Computer Science 2014-06-02 Siddhartha Sarma , Samar Agnihotri , Joy Kuri

The paper addresses large-scale, convex optimization problems that need to be solved in a distributed way by agents communicating according to a random time-varying graph. Specifically, the goal of the network is to minimize the sum of…

Optimization and Control · Mathematics 2020-10-28 Andrea Camisa , Francesco Farina , Ivano Notarnicola , Giuseppe Notarstefano

In this manuscript, we analyze the sparse signal recovery (compressive sensing) problem from the perspective of convex optimization by stochastic proximal gradient descent. This view allows us to significantly simplify the recovery analysis…

Data Structures and Algorithms · Computer Science 2013-04-19 Rong Jin , Tianbao Yang , Shenghuo Zhu

Reconfigurable intelligent surfaces (RISs) represent a radical new technology that can shape the radio wave propagation in wireless communication systems and offers a great variety of possible performance and implementation gains. Motivated…

Information Theory · Computer Science 2021-09-06 Nemanja Stefan Perović , Le-Nam Tran , Marco Di Renzo , Mark F. Flanagan

In this paper, the multiple-input multiple-output (MIMO) transmit beampattern matching problem is considered. The problem is formulated to approximate a desired transmit beampattern (i.e., an energy distribution in space and frequency) and…

Optimization and Control · Mathematics 2018-02-21 Ziping Zhao , Daniel P. Palomar

The Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel is studied in this paper. The base station broadcasts confidential messages to K intended users while keeping the messages secret from an eavesdropper. The…

Information Theory · Computer Science 2022-05-16 Yue Qi , Mojtaba Vaezi

In this paper, we study the zero-delay source-channel coding problem, and specifically the problem of obtaining the vector transformations that optimally map between the m-dimensional source space and the k-dimensional channel space, under…

Information Theory · Computer Science 2016-11-15 Emrah Akyol , Kumar Viswanatha , Kenneth Rose , Tor Ramstad

Reliable communication over a discrete memoryless channel with the help of a relay has aroused interest due to its widespread applications in practical scenarios. By considering the system with a mismatched decoder, previous works have…

Information Theory · Computer Science 2024-10-16 Xinwei Li , Lingyi Chen , Shitong Wu , Huihui Wu , Hao Wu , Wenyi Zhang

We consider the Gaussian interference channel with an intermediate relay as a main building block for cooperative interference networks. On the achievability side, we consider compress-and-forward based strategies. Specifically, a…

Information Theory · Computer Science 2015-03-18 Ye Tian , Aylin Yener

We cast motion planning under uncertainty as a stochastic optimal control problem, where the optimal posterior distribution has an explicit form. To approximate this posterior, this work frames an optimization problem in the space of…

Robotics · Computer Science 2026-01-06 Zinuo Chang , Hongzhe Yu , Patricio Vela , Yongxin Chen

We derive closed-form expressions for the achievable rates of a buffer-aided full-duplex (FD) multiple-input multiple-output (MIMO) Gaussian relay channel. The FD relay still suffers from residual self-interference (RSI) after the…

Information Theory · Computer Science 2017-08-03 Ahmed El Shafie , Ahmed Sultan , Ioannis Krikidis , Naofal Al-Dhahir , Ridha Hamila

We consider the task of decentralized minimization of the sum of smooth strongly convex functions stored across the nodes of a network. For this problem, lower bounds on the number of gradient computations and the number of communication…

Optimization and Control · Mathematics 2020-11-16 Dmitry Kovalev , Adil Salim , Peter Richtárik

Gaussian loss channels are of particular importance since they model realistic optical communication channels. Except for special cases, quantum capacity of Gaussian loss channels is not yet known completely. In this paper, we provide…

Quantum Physics · Physics 2019-03-19 Kyungjoo Noh , Victor V. Albert , Liang Jiang

This paper investigates a new class of non-convex optimization, which provides a unified framework for linear precoding in single/multi-user multiple-input multiple-output (MIMO) channels with arbitrary input distributions. The new…

Signal Processing · Electrical Eng. & Systems 2020-04-08 Juening Jin , Yahong Rosa~Zheng , Wen Chen , Chengshan Xiao

This paper investigates the optimum source transmission strategy to maximize the capacity of a multiple-input single-output (MISO) amplify-and-forward relay channel, assuming source-relay channel mean feedback at the source. The challenge…

Information Theory · Computer Science 2015-03-18 Minhua Ding , Q. T. Zhang

We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…

Computer Vision and Pattern Recognition · Computer Science 2011-12-06 Jan Lellmann , Frank Lenzen , Christoph Schnörr

We study accelerated optimization methods in the Gaussian phase retrieval problem. In this setting, we prove that gradient methods with Polyak or Nesterov momentum have similar implicit regularization to gradient descent. This implicit…

Optimization and Control · Mathematics 2023-11-23 Tyler Maunu , Martin Molina-Fructuoso
‹ Prev 1 3 4 5 6 7 10 Next ›