Related papers: Sum Capacity Bounds and Design of Suboptimal Codes…
The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem that is gaining relevance thanks to emerging applications in wireless communication networks. In this paper, we…
In this paper, we introduce further our recently designed family of L2 orthogonal Space-Time codes for CPM. With their advantage of maintaining both the constant envelope properties of CPM, the diversity of Space-Time codes and moreover…
As the mobile application landscape expands, wireless networks are tasked with supporting various connection profiles, including real-time communications and delay-sensitive traffic. Among many ensuing engineering challenges is the need to…
A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…
The paper investigates the problem of maximizing expected sum throughput in a fading multiple access cognitive radio network when secondary user (SU) transmitters have energy harvesting capability, and perform cooperative spectrum sensing.…
The optimal allocation of time and energy resources is characterized in a Wireless Powered Communication Network (WPCN) with non-Orthogonal Multiple Access (NOMA). We consider two different formulations; in the first one (max-sum), the…
In this paper, we present some contributions from our recent investigation. We address the open issue of interference coordination for sub-28 GHz millimeter-wave communication, by proposing fast-converging coordination algorithms, for dense…
Symmetric fix-free codes are prefix condition codes in which each codeword is required to be a palindrome. Their study is motivated by the topic of joint source-channel coding. Although they have been considered by a few communities they…
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements from an underlying random process, code and transmit those…
We establish the optimal nonergodic sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems. First, the optimal bound is formulated by the performance estimation framework, resulting in an infinite…
A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows to treat in a unified way both a low and a high rate cases. In particular, the earlier known upper bounds are improved, and a…
In this paper, a novel joint design of beamforming and power allocation is proposed for a multi-cell multiuser multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) network. In this network, base stations (BSs) adopt…
In this paper will be presented new approach to entropy coding: family of generalizations of standard numeral systems which are optimal for encoding sequence of equiprobable symbols, into asymmetric numeral systems - optimal for freely…
This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length objectives. Like the most well-known redundancy bounds for…
MIMO systems in the lower part of the millimeter-wave spectrum band (i.e., below 28 GHz) do not exhibit enough directivity and selectively, as their counterparts in higher bands of the spectrum (i.e., above 60 GHz), and thus still suffer…
This paper analyzes general spatially-coupled (SC) systems with multi-dimensional coupling. A continuum approximation is used to derive potential functions that characterize the performance of the SC systems. For any dimension of coupling,…
In this paper we propose the capacity optimization over sensing threshold for sensing-based cognitive radio networks. The objective function of the proposed optimization is to maximize the capacity at the secondary user subject to the…
In this paper, we have investigated the application of non-binary LDPC codes to spatial multiplexing MIMO systems with a large number of low power antennas. We demonstrate that such large MIMO systems incorporating with low-complexity MMSE…
Motivated by the need for fast synchronized operation of power microgrids, we analyze the problem of single and multiple pinning in networked systems. We derive lower and upper bounds on the algebraic connectivity of the network with…
We study the binomial channel and the structure of its capacity-achieving input and output distributions. It is known that the capacity-achieving input distribution is discrete and supported on finitely many points. The best previously…