Related papers: Capacity of Complexity-Constrained Noise-Free CDMA
The minimum average signal-to-noise ratio (SNR) per bit required for error-free transmission over a fading channel is derived, and is shown to be equal to that of the additive white Gaussian noise (AWGN) channel, which is $-1.6$ dB.…
The fundamental diversity-multiplexing tradeoff (DMT) of the quasi-static fading, symmetric $2$-user MIMO interference channel (IC) with channel state information at the transmitters (CSIT) and a short term average power constraint is…
In conventional wireless systems, unless a contiguous frequency band with width at least equal to the required bandwidth is obtained, multimedia communication can not be effected with the desired Quality of Service. We propose here a novel…
As an application of generalised statistical mechanics, it is studied a possible route toward a consistent generalised information theory in terms of a family of non-extensive, non-parametric entropies $H^\pm_D(P)$. Unlike other proposals…
We study downlink beamforming in a single-cell network with a multi-antenna base station (BS) serving cache-enabled users. For a given common rate of the files in the system, we first formulate the minimum transmit power with beamforming at…
Communication over a noisy quantum channel introduces errors in the transmission that must be corrected. A fundamental bound on quantum error correction is the quantum capacity, which quantifies the amount of quantum data that can be…
This paper considers a sequential estimation and sensor scheduling problem in the presence of multiple communication channels. As opposed to the classical remote estimation problem that involves one perfect (noiseless) channel and one…
We consider transmission over a general memoryless channel, with bounded decoding complexity per bit under message passing decoding. We show that the achievable rate is bounded below capacity if there is a finite success in the decoding in…
The problem of identifying the channel with the highest capacity among several discrete memoryless channels (DMCs) is considered. The problem is cast as a pure-exploration multi-armed bandit problem, which follows the practical use of…
Future wireless networks are envisioned to employ multiple-input multiple-output (MIMO) transmissions with large array sizes, and therefore, the adoption of complexity-scalable transceiver becomes important. In this paper, we propose a…
This paper focuses on the cross-layer issue of joint multiuser detection and resource allocation for energy efficiency in wireless CDMA networks. In particular, assuming that a linear multiuser detector is adopted in the uplink receiver,…
This paper presents the characterization of power control in WCDMA systems. We know that CDMA is an interference limited system. It is shown that the unbalance scheme is reliable and successful for both 2-way and 3-way soft handover.…
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…
In Shannon information theory the capacity of a memoryless communication channel cannot be increased by the use of feedback. In quantum information theory the no-cloning theorem means that noiseless copying and feedback of quantum…
This work introduces capacity limits for molecular timing (MT) channels, where information is modulated in the release timing of small information particles, and decoded from the time of arrivals at the receiver. It is shown that the random…
Identification in quantum communication enables receivers to verify the presence of a message without decoding its entire content. While identification capacity has been explored for classical and finite-dimensional quantum channels, its…
Based on the theory of the Federal Communications Commission, the spectrum available on cognitive radio networks is limit and the non-optimal use of the spectrum necessitates the need for a telecommunications model, so that this pattern can…
In extension of the bit commitment task and following work initiated by Crepeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It…
Channel simulation is to simulate a noisy channel using noiseless channels with unlimited shared randomness. This can be interpreted as the reverse problem to Shannon's noisy coding theorem. In contrast to previous works, our approach…
We consider all-optical network evolution from a quantum perspective. We show that a use of optimal quantum receivers allows an estimated $55\%$ decrease in energy consumption of all-optical amplifiers in network configurations that are…