Gustavo Kasper Facenda

Gustavo Kasper Facenda

Auto-generated profile, based on publicly available information

Gustavo Kasper Facenda

Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
10 August 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
GFGustavo Kasper Facenda
Gustavo Kasper Facenda
DSDanilo Silva
Danilo Silva
This article investigates the massive random access Gaussian channel with a focus on small payloads. For this problem, grant-based schemes have been regarded as inefficient due to the necessity of large feedbacks and the use of inefficient scheduling request methods. This articles attempts to answer whether grant-based schemes can be competitive against state-ot-art grantless schemes and worthy of further investigation. In order to compare these schemes fairly, a novel model is proposed, and, under this model, a novel grant-based scheme is proposed. The scheme uses Ordentlich and Polyanskiy's grantless method to transmit small coordination indices in order to perform the scheduling request, which allows both the request from the users to be efficient and the feedback to be small. We also present improvements to the Ordentlich and Polyanskiy's scheme, allowing it to transmit information through the choice of sub-block, as well as to handle collisions of the same message, significantly improving the method for very small messages. Simulation results show that, if a small feedback is allowed, the proposed scheme performs closely to the state-of-art while using simpler coding schemes, suggesting that novel grant-based schemes should not be dismissed as a potential solution to the massive random access problem.

8 March 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
GFGustavo Kasper Facenda
Gustavo Kasper Facenda
MKM. Nikhil Krishnan
M. Nikhil Krishnan
EDElad Domanovitz
Elad Domanovitz
SFSilas Fong
Silas Fong
AKAshish Khisti
Ashish Khisti
JAJohn Apostolopoulos
John Apostolopoulos
This paper investigates adaptive streaming codes over a three-node relayed network. In this setting, a source node transmits a sequence of message packets to a destination with help of a relay. The source-to-relay and relay-to-destination links are unreliable and introduce at most N 1 and N 2 packet erasures, respectively. The destination node must recover each message packet within a strict delay constraint T . The paper presents a new construction of streaming codes for all feasible parameters { N 1 , N 2 , T }. Our work improves upon the construction in Fong et al. by adapting the relaying strategy based on the erasure patterns from source to relay. Specifically, the code employs the notion of symbol estimates, which allows the relay to forward information about symbols before it can decode that symbol, and variable-rate encoding, which decreases the rate used to encode a packet as more erasures affect that packet. The codes proposed in this paper achieve rates higher than the ones proposed by Fong et al. whenever N 2 > N 1 , and achieve the same rate when N 2 ≤ N 1 , in which case the rate is optimal. The paper also presents an upper bound on the achievable rate that takes into account erasures in both links in order to bound the rate in the second link. The upper bound is shown to be tighter than a trivial bound that considers only the erasures in the second link.

17 March 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
GFGustavo Kasper Facenda
Gustavo Kasper Facenda
AKAshish Khisti
Ashish Khisti
WTWai-Tian Tan
Wai-Tian Tan
JAJohn Apostolopoulos
John Apostolopoulos
This paper studies packet repetition strategies over erasure channels with memory and a long feedback delay. The problem is initially formulated as a communications problem where a source wishes to transmit one message packet to a destination while minimizing both the delay and the number of transmissions. At each time instant, the sender is provided a delayed acknowledgement feedback about past attempts, and must decide whether to attempt a new transmission or not. This problem is then re-formulated as an episodic reinforcement learning problem, where an agent attempts to learn the optimal transmission policy, provided delayed feedback about past transmission attempts. The agent is helped by a channel estimator, which attempts to capture the channel memory and use that to predict probabilities of erasures in a future window. This channel estimator is also data-driven and learns the channel model without any a priori channel knowledge. The paper presents a lower bound on the achievable trade-off between delay and number of transmissions for any channel modeled as a Markov process. Experimental results show that the combination of the proposed channel estimator and the agent can noticeably outperform naive strategies for channels with memory, and achieves results close to the lower bound.

12 October 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
GFGustavo Kasper Facenda
Gustavo Kasper Facenda
EDElad Domanovitz
Elad Domanovitz
AKAshish Khisti
Ashish Khisti
WTWai-Tian Tan
Wai-Tian Tan
JAJohn Apostolopoulos
John Apostolopoulos
Many emerging multimedia streaming applications involve multiple users communicating under strict latency constraints. In this paper we study streaming codes for a network involving two source nodes, one relay node and a destination node. In this paper’s setting, each source node transmits a stream of messages, through the relay, to a destination, who is required to decode the messages under a strict delay constraint. For the case of a single source node, a class of streaming codes has been proposed by Fong et al., using the concept of delay-spectrum. The current paper presents a novel framework, which constructs streaming codes for a relayed multi-user setting by sequentially constructing the codes for each link. This requires a characterization of the set of all achievable delay spectra for a given rate, blocklength and number of erasures, beyond the specific choice considered by Fong et al. This characterization is presented in the paper for systematic codes. Using this novel framework, the first proposed scheme involves greedily selecting the rate on the link from relay to destination and using properties of the delay-spectrum to find feasible streaming codes that satisfy the required delay constraints. A closed form expression for the achievable rate region is provided, and conditions for when the proposed scheme is optimal are established by a natural outer bound. The second proposed scheme builds upon this approach, but uses a numerical optimization-based approach to improve the achievable rate region over the first scheme. Experimental results show that the proposed schemes achieve significant improvements over baseline schemes based on single-user codes.

1 May 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
GFGustavo Kasper Facenda
Gustavo Kasper Facenda
AKAshish Khisti
Ashish Khisti
WTWai-Tian Tan
Wai-Tian Tan
JAJohn Apostolopoulos
John Apostolopoulos
This paper studies the transmission of a stream of data packets through a multi-hop multi-link communication network. The source generate sequential source packets and transmits them through a network to a destination. Each intermediary node is allowed to perform any processing operation in order to successfully forward the message to the destination. Each link connecting two nodes is subject to an adversarial packet erasure channel, where the number of erasures is limited. The destination must recover each source packet within a delay deadline, otherwise that packet is considered lost. The particular case when each hop consists of only one link has been studied by Domanovitz et. al in [1]. We extend this work to the multi-link scenario by multiplexing multiple copies of streaming codes in [1] and optimizing the rate using a linear programming framework. We also demonstrate how our framework can be naturally extended when there is a different propagation delay on each link. Numerical results demonstrate that our proposed approach provides significant improvements over baseline schemes.We further demonstrate that our proposed scheme also provides improved audio quality over baseline schemes in experiments involving Gilbert-Elliott channels.

17 January 2022 in arXiv
Verified
Preprint
Open access
PDF file
GFGustavo Kasper Facenda
Gustavo Kasper Facenda
EDElad Domanovitz
Elad Domanovitz
AKAshish Khisti
Ashish Khisti
WTWai-Tian Tan
Wai-Tian Tan
JAJohn Apostolopoulos
John Apostolopoulos
This paper investigates the performance of streaming codes in low-latency applications over a multi-link three-node relayed network. The source wishes to transmit a sequence of messages to the destination through a relay. Each message must be reconstructed after a fixed decoding delay. The special case with one link connecting each node has been studied by Fong et. al [1], and a multi-hop multi-link setting has been studied by Domanovitz et. al [2]. The topology with three nodes and multiple links is studied in this paper. Each link is subject to a different number of erasures due to different channel conditions. An information-theoretic upper bound is derived, and an achievable scheme is presented. The proposed scheme judiciously allocates rates for each link based on the concept of delay spectrum. The achievable scheme is compared to two baseline schemes and the scheme proposed in [2]. Experimental results show that this scheme achieves higher rates than the other schemes, and can achieve the upper bound even in non-trivial scenarios. The scheme is further extended to handle different propagation delays in each link, something not previously considered in the literature. Simulations over statistical channels show that the proposed scheme can outperform the simpler baseline under practical models.