Showing 1–13 of 13 results for author: Cocco, G

On the Error Exponent Distribution of Code Ensembles over Classical-Quantum Channels

Authors: Giuseppe Cocco, Javier Rodríguez Fonollosa

Abstract: We show that the probability distribution of the error exponent in i.i.d. code ensembles over classical-quantum (CQ) channels with arbitrary output states accumulates above a threshold that is strictly larger than the CQ random coding exponent (RCE) at low rates, while coinciding with it at rates close to the mutual information of the channel. This result, combined with the work by Dalai [1] and t… ▽ More We show that the probability distribution of the error exponent in i.i.d. code ensembles over classical-quantum (CQ) channels with arbitrary output states accumulates above a threshold that is strictly larger than the CQ random coding exponent (RCE) at low rates, while coinciding with it at rates close to the mutual information of the channel. This result, combined with the work by Dalai [1] and the recent ones by Renes [2] and Li and Yang [3], implies that the ensemble distribution of error exponents concentrates around the CQ RCE in the high rate regime. Moreover, in the same rate regime the threshold we derive coincides with the ensemble-average of the exponent, that is, the typical random coding (TRC) exponent [4]. △ Less

Submitted 9 July, 2025; originally announced July 2025.

Comments: A shortened version of this manuscript has been accepted at the IEEE Information Theory Workshop 2025 (IEEE ITW 2025), Sep. 29 - Oct., Sydney, Australia

A Refinement of Expurgation

Authors: Giuseppe Cocco, Albert Guillén i Fàbregas, Josep Font-Segura

Abstract: We show that for a wide range of channels and code ensembles with pairwise-independent codewords, with probability tending to 1 with the code length, expurgating an arbitrarily small fraction of codewords from a randomly selected code results in a code attaining the expurgated exponent. We show that for a wide range of channels and code ensembles with pairwise-independent codewords, with probability tending to 1 with the code length, expurgating an arbitrarily small fraction of codewords from a randomly selected code results in a code attaining the expurgated exponent. △ Less

Submitted 19 April, 2024; v1 submitted 22 July, 2023; originally announced July 2023.

Remote Monitoring of Two-State Markov Sources via Random Access Channels: an Information Freshness vs. State Estimation Entropy Perspective

Authors: Giuseppe Cocco, Andrea Munari, Gianluigi Liva

Abstract: We study a system in which two-state Markov sources send status updates to a common receiver over a slotted ALOHA random access channel. We characterize the performance of the system in terms of state estimation entropy (SEE), which measures the uncertainty at the receiver about the sources' state. Two channel access strategies are considered: a reactive policy that depends on the source behaviour… ▽ More We study a system in which two-state Markov sources send status updates to a common receiver over a slotted ALOHA random access channel. We characterize the performance of the system in terms of state estimation entropy (SEE), which measures the uncertainty at the receiver about the sources' state. Two channel access strategies are considered: a reactive policy that depends on the source behaviour and a random one that is independent of it. We prove that the considered policies can be studied using two different hidden Markov models and show through a density evolution analysis that the reactive strategy outperforms the random one in terms of SEE while the opposite is true for age of information. Furthermore, we characterize the probability of error in the state estimation at the receiver, considering a maximum a posteriori and a low-complexity (decode & hold) estimator. Our study provides useful insights on the design trade-offs that emerge when different performance metrics are adopted. Moreover, we show how the source statistics significantly impact the system performance. △ Less

Submitted 15 December, 2023; v1 submitted 8 March, 2023; originally announced March 2023.

Typical Error Exponents: A Dual Domain Derivation

Authors: Giuseppe Cocco, Albert Guillén i Fàbregas, Josep Font-Segura

Abstract: This paper shows that the probability that the error exponent of a given code randomly generated from a pairwise independent ensemble being smaller than a lower bound on the typical random-coding exponent tends to zero as the codeword length tends to infinity. This lower bound is known to be tight for i.i.d. ensembles over the binary symmetric channel and for constant-composition codes over memory… ▽ More This paper shows that the probability that the error exponent of a given code randomly generated from a pairwise independent ensemble being smaller than a lower bound on the typical random-coding exponent tends to zero as the codeword length tends to infinity. This lower bound is known to be tight for i.i.d. ensembles over the binary symmetric channel and for constant-composition codes over memoryless channels. Our results recover both as special cases and remain valid for arbitrary alphabets, arbitrary channels -- for example finite-state channels with memory -- and arbitrary pairwise-independent ensembles. We specialize our results to the i.i.d., constant-composition and cost-constrained ensembles over discrete memoryless channels and to ensembles over finite-state channels. △ Less

Submitted 1 April, 2022; v1 submitted 29 March, 2022; originally announced March 2022.

Comments: 31 pages, 1 figure

Concentration Properties of Random Codes

Authors: Lan V. Truong, Giuseppe Cocco, Josep Font-Segura, Albert Guillén i Fàbregas

Abstract: This paper studies the concentration properties of random codes. Specifically, we show that, for discrete memoryless channels, the error exponent of a randomly generated code with pairwise-independent codewords converges in probability to its expectation -- the typical error exponent. For high rates, the result is a consequence of the fact that the random-coding error exponent and the sphere-packi… ▽ More This paper studies the concentration properties of random codes. Specifically, we show that, for discrete memoryless channels, the error exponent of a randomly generated code with pairwise-independent codewords converges in probability to its expectation -- the typical error exponent. For high rates, the result is a consequence of the fact that the random-coding error exponent and the sphere-packing error exponent coincide. For low rates, instead, the convergence is based on the fact that the union bound accurately characterizes the probability of error. The paper also zooms into the behavior at asymptotically low rates and shows that the error exponent converges in distribution to a Gaussian-like distribution. Finally, we present several results on the convergence of the error probability and error exponent for generic ensembles and channels. △ Less

Submitted 15 March, 2022; originally announced March 2022.

Comments: 98 pages

Drone-aided Localization in LoRa IoT Networks

Authors: Victor Delafontaine, Fabrizio Schiano, Giuseppe Cocco, Alexandru Rusu, Dario Floreano

Abstract: Besides being part of the Internet of Things (IoT), drones can play a relevant role in it as enablers. The 3D mobility of UAVs can be exploited to improve node localization in IoT networks for, e.g., search and rescue or goods localization and tracking. One of the widespread IoT communication technologies is Long Range Wide Area Network (LoRaWAN), which allows achieving long communication distance… ▽ More Besides being part of the Internet of Things (IoT), drones can play a relevant role in it as enablers. The 3D mobility of UAVs can be exploited to improve node localization in IoT networks for, e.g., search and rescue or goods localization and tracking. One of the widespread IoT communication technologies is Long Range Wide Area Network (LoRaWAN), which allows achieving long communication distances with low power. In this work, we present a drone-aided localization system for LoRa networks in which a UAV is used to improve the estimation of a node's location initially provided by the network. We characterize the relevant parameters of the communication system and use them to develop and test a search algorithm in a realistic simulated scenario. We then move to the full implementation of a real system in which a drone is seamlessly integrated into Swisscom's LoRa network. The drone coordinates with the network with a two-way exchange of information which results in an accurate and fully autonomous localization system. The results obtained in our field tests show a ten-fold improvement in localization precision with respect to the estimation provided by the fixed network. Up to our knowledge, this is the first time a UAV is successfully integrated in a LoRa network to improve its localization accuracy. △ Less

Submitted 8 April, 2020; originally announced April 2020.

Comments: Accepted at the IEEE International Conference on Robotics and Automation (ICRA) 2020

Caching in Heterogeneous Networks with Per-File Rate Constraints

Authors: Estefanía Recayte, Giuseppe Cocco

Abstract: We study the problem of caching optimization in heterogeneous networks with mutual interference and per-file rate constraints from an energy efficiency perspective. A setup is considered in which two cache-enabled transmitter nodes and a coordinator node serve two users. We analyse and compare two approaches: (i) a cooperative approach where each of the transmitters might serve either of the use… ▽ More We study the problem of caching optimization in heterogeneous networks with mutual interference and per-file rate constraints from an energy efficiency perspective. A setup is considered in which two cache-enabled transmitter nodes and a coordinator node serve two users. We analyse and compare two approaches: (i) a cooperative approach where each of the transmitters might serve either of the users and (ii) a non-cooperative approach in which each transmitter serves only the respective user. We formulate the cache allocation optimization problem so that the overall system power consumption is minimized while the use of the link from the master node to the end users is spared whenever possible. We also propose a low-complexity optimization algorithm and show that it outperforms the considered benchmark strategies. Our results indicate that significant gains both in terms of power saving and sparing of master node's resources can be obtained when full cooperation between the transmitters is in place. Interestingly, we show that in some cases storing the most popular files is not the best solution from a power efficiency perspective. △ Less

Submitted 15 October, 2018; originally announced October 2018.

The Sum-Rate-Distortion Region of Correlated Gauss-Markov Sources

Authors: Giuseppe Cocco, Laura Toni

Abstract: Efficient low-delay video encoders are of fundamental importance to provide timely feedback in remotely controlled platforms such as drones. In order to fully understand the theoretical limits of low-delay video encoders, we consider an ideal differential predictive coded modulation (DPCM) encoder and provide the explicit derivation of the sum-rate-distortion region for a generic number of success… ▽ More Efficient low-delay video encoders are of fundamental importance to provide timely feedback in remotely controlled platforms such as drones. In order to fully understand the theoretical limits of low-delay video encoders, we consider an ideal differential predictive coded modulation (DPCM) encoder and provide the explicit derivation of the sum-rate-distortion region for a generic number of successive correlated Gauss-Markov sources along the line of the work by Ma and Ishwar. Furthermore, we provide an upper bound on the minimum distortion achievable in case an arbitrary number of sources are not available at the decoder. △ Less

Submitted 14 November, 2018; v1 submitted 10 April, 2018; originally announced April 2018.

Comments: 11 pages

Forward Link Interference Mitigation in Mobile Interactive Satellite Systems

Authors: Pol Henarejos, Miguel Ángel Vázquez, Giuseppe Cocco, Ana I. Pérez-Neira

Abstract: We present the results of the performance evaluation of polarization-time coding and soft interference cancellation in multi-beam satellite systems affected by co-channel interference in realistic setups. The standard of Broadband Global Area Network service (BGAN) has been considered as reference for the physical layer and realistic interference and channel models have been adopted. The work has… ▽ More We present the results of the performance evaluation of polarization-time coding and soft interference cancellation in multi-beam satellite systems affected by co-channel interference in realistic setups. The standard of Broadband Global Area Network service (BGAN) has been considered as reference for the physical layer and realistic interference and channel models have been adopted. The work has been carried out in the framework of the Next Generation Waveform for Increased Spectral Efficiency (NGWISE) project founded by the European Space Agency (ESA). △ Less

Submitted 20 March, 2018; originally announced March 2018.

Throughput and Delay Analysis in Video Streaming over Block-Fading Channels

Authors: Giuseppe Cocco, Deniz Gündüz, Christian Ibars

Abstract: We study video streaming over a slow fading wireless channel. In a streaming application video packets are required to be decoded and displayed in the order they are transmitted as the transmission goes on. This results in per-packet delay constraints, and the resulting channel can be modeled as a physically degraded fading broadcast channel with as many virtual users as the number of packets. In… ▽ More We study video streaming over a slow fading wireless channel. In a streaming application video packets are required to be decoded and displayed in the order they are transmitted as the transmission goes on. This results in per-packet delay constraints, and the resulting channel can be modeled as a physically degraded fading broadcast channel with as many virtual users as the number of packets. In this paper we study two important quality of user experience (QoE) metrics, namely throughput and inter-decoding delay. We introduce several transmission schemes, and compare their throughput and maximum inter-decoding delay performances. We also introduce a genie-aided scheme, which provides theoretical bounds on the achievable performance. We observe that adapting the transmission rate at the packet level, i.e., periodically dropping a subset of the packets, leads to a good tradeoff between the throughput and the maximum inter-decoding delay. We also show that an approach based on initial buffering leads to an asymptotically vanishing packet loss rate at the expense of a relatively large initial delay. For this scheme we derive a condition on the buffering time that leads to throughput maximization. △ Less

Submitted 9 October, 2015; originally announced October 2015.

Comments: 28 pages, 11 figures, to appear in IEEE Transactions on Communications

Seek and Decode: Random Access with Physical-Layer Network Coding and Multiuser Detection

Authors: Giuseppe Cocco, Stephan Pfletschinger, Monica Navarro

Abstract: We present a novel cross layer approach to random access (RA) that combines physical-layer network coding (PLNC) with multiuser detection (MUD). PLNC and MUD are applied jointly at the physical level in order to extract any linear combination of messages experiencing a collision. The set of combinations extracted from a whole frame is then processed by the receiver to recover the original packets.… ▽ More We present a novel cross layer approach to random access (RA) that combines physical-layer network coding (PLNC) with multiuser detection (MUD). PLNC and MUD are applied jointly at the physical level in order to extract any linear combination of messages experiencing a collision. The set of combinations extracted from a whole frame is then processed by the receiver to recover the original packets. A simple pre-coding stage at the transmitting terminals allows the receiver to further increase system diversity. We derive an analytical bound on the system throughput and present simulation results for the decoding at the physical level as well as several performance measures at frame level in block fading channels, namely throughput, packet loss rate and energy efficiency. The results we present are promising and suggest that a cross layer approach leveraging on the joint use of PLNC and MUD can significantly improve the performance of RA systems. △ Less

Submitted 18 June, 2014; originally announced June 2014.

A Network-Coded Diversity Protocol for Collision Recovery in Slotted ALOHA Networks

Authors: Giuseppe Cocco, Nader Alagha, Christian Ibars, Stefano Cioni

Abstract: We propose a collision recovery scheme for symbol-synchronous slotted ALOHA (SA) based on physical layer network coding over extended Galois Fields. Information is extracted from colliding bursts allowing to achieve higher maximum throughput with respect to previously proposed collision recovery schemes. An energy analysis is also performed, and it is shown that, by adjusting the transmission prob… ▽ More We propose a collision recovery scheme for symbol-synchronous slotted ALOHA (SA) based on physical layer network coding over extended Galois Fields. Information is extracted from colliding bursts allowing to achieve higher maximum throughput with respect to previously proposed collision recovery schemes. An energy analysis is also performed, and it is shown that, by adjusting the transmission probability, high energy efficiency can be achieved. The paper also addresses several practical aspects, namely frequency, phase, and amplitude estimation, as well as partial symbol asynchronism. A performance evaluation is carried out using the proposed algorithms, revealing remarkable performance in terms of normalized throughput. △ Less

Submitted 8 May, 2012; originally announced May 2012.

Comments: Submitted to IEEE Journal on Selected Areas in Communications

Streaming Transmitter over Block-Fading Channels with Delay Constraint

Authors: Giuseppe Cocco, Deniz Gündüz, Christian Ibars

Abstract: Data streaming transmission over a block fading channel is studied. It is assumed that the transmitter receives a new message at each channel block at a constant rate, which is fixed by an underlying application, and tries to deliver the arriving messages by a common deadline. Various transmission schemes are proposed and compared with an informed transmitter upper bound in terms of the average de… ▽ More Data streaming transmission over a block fading channel is studied. It is assumed that the transmitter receives a new message at each channel block at a constant rate, which is fixed by an underlying application, and tries to deliver the arriving messages by a common deadline. Various transmission schemes are proposed and compared with an informed transmitter upper bound in terms of the average decoded rate. It is shown that in the single receiver case the adaptive joint encoding (aJE) scheme is asymptotically optimal, in that it achieves the ergodic capacity as the transmission deadline goes to infinity; and it closely follows the performance of the informed transmitter upper bound in the case of finite transmission deadline. On the other hand, in the presence of multiple receivers with different signal-to-noise ratios (SNR), memoryless transmission (MT), time sharing (TS) and superposition transmission (ST) schemes are shown to be more robust than the joint encoding (JE) scheme as they have gradual performance loss with decreasing SNR. △ Less

Submitted 19 September, 2012; v1 submitted 13 March, 2012; originally announced March 2012.

Comments: Submitted to IEEE Transactions on Wireless Communications