Guido Carlo Ferrante

Guido Carlo Ferrante

Auto-generated profile, based on publicly available information

Guido Carlo Ferrante

Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 February 2019 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
RDRahul Devassy
Rahul Devassy
GDGiuseppe Durisi
Giuseppe Durisi
GFGuido Carlo Ferrante
Guido Carlo Ferrante
OSOsvaldo Simeone
Osvaldo Simeone
EUElif Uysal
Elif Uysal

27 April 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
MLMai T. P. Le
Mai T. P. Le
GFGuido Carlo Ferrante
Guido Carlo Ferrante
TQTony Q. S. Quek
Tony Q. S. Quek
MBMaria Gabriella Di Benedetto
Maria Gabriella Di Benedetto
Spectral efficiency of low-density spreading nonorthogonal multiple access channels in the presence of fading is derived for linear detection with independent decoding as well as optimum decoding. The large system limit, where both the number of users and number of signal dimensions grow with fixed ratio, called load, is considered. In the case of optimum decoding, it is found that low-density spreading underperforms dense spreading for all loads. Conversely, linear detection is characterized by different behaviors in the underloaded vs. overloaded regimes. In particular, it is shown that spectral efficiency changes smoothly as load increases. However, in the overloaded regime, the spectral efficiency of low-density spreading is higher than that of dense spreading.

7 June 2021 in IEEE Access
Verified
Journal Article
Open access
Giuseppe CasoGiuseppe Caso
Giuseppe Caso
Özgü AlayÖzgü Alay
Özgü Alay
GFGuido Carlo Ferrante
Guido Carlo Ferrante
Luca De NardisLuca De Nardis
Luca De Nardis
MBMaria Gabriella Di Benedetto
Maria Gabriella Di Benedetto
Anna BrunstromAnna Brunstrom
Anna Brunstrom
User-centric radio access technology (RAT) selection is a key communication paradigm, given the increased number of available RATs and increased cognitive capabilities at the user end. When considered against traditional network-centric approaches, user-centric RAT selection results in reduced network-side management load, and leads to lower operational costs for RATs, as well as improved quality of service (QoS) and quality of experience (QoE) for users. The complex between-users interactions involved in RAT selection require, however, specific analyses, toward developing reliable and efficient schemes. Two theoretical frameworks are most often applied to user-centric RAT selection analysis, i.e., game theory (GT) and multi-agent learning (MAL). As a consequence, several GT models and MAL algorithms have been recently proposed to solve the problem at hand. A comprehensive discussion of such models and algorithms is, however, currently missing. Moreover, novel issues introduced by next-generation communication systems also need to be addressed. This paper proposes to fill the above gaps by providing a unified reference for both ongoing research and future research directions in the field. In particular, the review addresses the most common GT and MAL models and algorithms, and scenario settings adopted in user-centric RAT selection in terms of utility function and network topology. Regarding GT, the review focuses on non-cooperative models, because of their widespread use in RAT selection; as for MAL, a large number of algorithms are described, ranging from game-theoretic to reinforcement learning (RL) schemes, and also including most recent approaches, such as deep RL (DRL) and multi-armed bandit (MAB). Models and algorithms are analyzed by comparatively reviewing relevant literature. Finally, open challenges are discussed, in light of ongoing research and standardization activities.

12 April 2017 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
GFGuido Carlo Ferrante
Guido Carlo Ferrante
TQTony Q. S. Quek
Tony Q. S. Quek
MWMoe Z. Win
Moe Z. Win
Millimeter wave (mmWave) communications use large transmission bandwidth and experience severe propagation conditions. This forces the communication system to operate in the so-called wideband regime, where signals must be increasingly “peaky” in order to attain a large fraction of the peak unconstrained wideband capacity. This paper investigates the capacity of the noncoherent channels as a function of bandwidth for signals with average and peak power constraints operating in the millimeter spectrum. Upper and lower bounds on capacity are provided, and the impact of features peculiar to mmWave channels is investigated. Numerical results for a scenario based on recent experimental campaigns are provided. It is shown that the rate achievable by a typical user in a mmWave cell with “non-peaky” signaling can be bounded away from the peak unconstrained wideband capacity. This suggests to reconsider the role of signaling “peakedness” in future mmWave communications.

22 September 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
GFGuido Carlo Ferrante
Guido Carlo Ferrante
Novel bounds on the left- and right-tail probability of the Binomial distribution are presented. Specifically, bounds on the left-tail probability $\text {P}\!\left [{S_{n}\leqslant an}\right]$ with $a\in (0,p)$ and the right-tail probability $\text {P}\!\left [{S_{n}\geqslant an}\right]$ with $a\in (p,1)$ , where $S_{n}$ follows the Binomial law with parameters $n\geqslant 1$ and $p\in (0,1)$ , are derived. The bounds are tighter than the best known closed-form expressions. The presented upper and lower bounds on the right-tail match an asymptotic expansion of $\log \text {P}\!\left [{S_{n}\geqslant na}\right]$ up to, and including, the $\log n$ term. In particular, the ratio between the upper and lower bounds is $1/(1-c/n)$ , where $c$ is independent of $n$ . Similar results are presented for the left-tail probability. Applications to finite blocklength source and channel coding are presented.

25 October 2016 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
GFGuido Carlo Ferrante
Guido Carlo Ferrante
GGGiovanni Geraci
Giovanni Geraci
TQTony Q. S. Quek
Tony Q. S. Quek
MWMoe Z. Win
Moe Z. Win
When paired with traditional channel estimation and detection, massive MIMO is severely affected by pilot contamination. While sticking to the traditional structure of the training phase where orthogonal pilot sequences are reused in different cells, we propose a group-blind detector that takes into account the presence of pilot contamination. Our detector uses the excess antennas to partially remove interference during the data transmission phase. We derive asymptotic expressions for the SINR gain and the achievable rate in the massive regime, i.e., when the number of antennas tends to infinity while keeping the number of users per cell fixed. Implementing the group-blind detector requires an estimate of the aggregate out-of-cell channel covariance. We propose a simple scheme, referred to as method of silences, to obtain such estimate. Numerical results confirm our analysis in practical scenarios, and show cases where the method of silences achieves a large fraction of the promised SINR gain over conventional detectors.