English
Related papers

Related papers: On Capacity Computation for the Two-User Binary Mu…

200 papers

We develop upper bounds on code size for an independent and identically distributed deletion and insertion channels for a given code length and target frame error probability. The bounds are obtained as a variation of a general converse…

Information Theory · Computer Science 2026-04-14 Ruslan Morozov , Tolga Mete Duman

This paper focuses on the problem of separately modulating and jointly estimating two independent continuous-valued parameters sent over a Gaussian multiple-access channel (MAC) under the mean square error (MSE) criterion. To this end, we…

Information Theory · Computer Science 2016-09-28 Ayse Unsal , Raymond Knopp , Neri Merhav

The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless…

Information Theory · Computer Science 2023-06-13 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

This paper considers coordinated linear precoding for rate optimization in downlink multicell, multiuser orthogonal frequency- division multiple access networks. We focus on two different design criteria. In the first, the weighted sum-rate…

Information Theory · Computer Science 2015-06-17 Mirza Golam Kibria , Hidekazu Murata

This paper provides a survey of the state-of-the-art information theoretic analysis for overlay multi-user (more than two pairs) cognitive networks and reports new capacity results. In an overlay scenario, cognitive / secondary users share…

Information Theory · Computer Science 2015-10-26 Diana Maamari , Daniela Tuninetti , Natasha Devroye

We optimize the throughput of a single cell multiuser orthogonal frequency division multiplexing system with proportional data rate fairness among the users. The concept is to support mobile users with different levels of service. The…

Information Theory · Computer Science 2016-04-08 Mirza Golam Kibria , Shan Lin

Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers in the presence of an eavesdropper. Achievable rates are…

Information Theory · Computer Science 2020-08-04 Hassan ZivariFard , Matthieu Bloch , Aria Nosratinia

In a recent work, a capacity-achieving scheme for the common-message two-user MIMO broadcast channel, based on single-stream coding and decoding, was described. This was obtained via a novel joint unitary triangularization which is applied…

Information Theory · Computer Science 2011-06-01 Anatoly Khina , Ayal Hitron , Uri Erez

We consider the N-user broadcast erasure channel with public feedback and side information. Before the beginning of transmission, each receiver knows a function of the messages of some of the other receivers. This situation arises naturally…

Information Theory · Computer Science 2014-06-16 A. Papadopoulos , L. Georgiadis

This letter studies joint transmit beamforming and antenna selection at a secondary base station (BS) with multiple primary users (PUs) in an underlay cognitive radio multiple-input single-output broadcast channel. The objective is to…

Information Theory · Computer Science 2017-03-02 Van-Dinh Nguyen , Chuyen T. Nguyen , Hieu V. Nguyen , Oh-Soon Shin

Efficient methods to provide sub-optimal solutions to non-convex optimization problems with knowledge of the solution's sub-optimality would facilitate the widespread application of nonlinear optimal control algorithms. To that end,…

Optimization and Control · Mathematics 2023-04-10 Prithvi Akella , Aaron D. Ames

This paper presents non-binary polar codes for the two-user multiple-access channel (MAC). The bit error rate (BER) performances of the non-binary polar codes with different kernel factors have been investigated in detail to select a proper…

Information Theory · Computer Science 2021-11-09 Guan-Chen Liu , Qi-Yue Yu

In this paper, we present a novel way for solving the main problem of designing the capacity approaching irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC). The proposed method is much simpler, faster,…

Information Theory · Computer Science 2021-03-02 H. Tavakoli , M. Ahmadian Attari , M. R. Peyghami

Motivated by a greedy approach for generating {\it{information stable}} processes, we prove a universal maximum likelihood (ML) upper bound on the capacities of discrete information stable channels, including the binary erasure channel…

Information Theory · Computer Science 2018-05-21 Tongxin Li

The problem of three-user multiple-access channel (MAC) with noiseless feedback is investigated. A new coding strategy is presented. The coding scheme builds upon the natural extension of the Cover-Leung (CL) scheme; and uses quasi-linear…

Information Theory · Computer Science 2017-02-21 Mohsen Heidari , Farhad Shirani , S. Sandeep Pradhan

We develop a new method for showing the optimality of the Gaussian distribution in multiterminal information theory problems. As an application of this method we show that Marton's inner bound achieves the capacity of the vector Gaussian…

Information Theory · Computer Science 2012-02-02 Yanlin Geng , Chandra Nair

In this paper we investigate the sub-channel assignment and power control to maximize the total sum rate in the uplink of two-cell network. It is assumed that there are some sub-channels in each cell which should be allocated among some…

Signal Processing · Electrical Eng. & Systems 2019-07-09 Ata Khalili , Soroush Akhlaghi

The capacity of multiple-input multiple-output additive white Gaussian noise channels is investigated under peak amplitude constraints on the norm of the input vector. New insights on the capacity-achieving input distribution are presented.…

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

Recent outer bounds on the capacity region of Gaussian interference channels are generalized to $m$-user channels with $m>2$ and asymmetric powers and crosstalk coefficients. The bounds are again shown to give the sum-rate capacity for…

Information Theory · Computer Science 2008-01-16 Xiaohu Shang , Gerhard Kramer , Biao Chen

This paper addresses join wireless and computing resource allocation in mobile edge computing (MEC) systems with several access points and with the possibility that users connect to many access points, and utilize the computation capability…

Information Theory · Computer Science 2021-11-29 M. Zeng
‹ Prev 1 8 9 10 Next ›