Francisco A. Monteiro

Dr. Francisco A. Monteiro

orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
1 September 2020 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
Onel Luis Alcaraz LópezOnel Luis Alcaraz López
Onel Luis Alcaraz López
FMFrancisco A. Monteiro
Francisco A. Monteiro
HAHirley Alves
Hirley Alves
RZRui Zhang
Rui Zhang
MLMatti Latva-Aho
Matti Latva-Aho
Wireless energy transfer (WET) is a green enabler of low-power Internet of Things (IoT). Therein, traditional optimization schemes relying on full channel state information (CSI) are often too costly to implement due to excessive energy consumption and high processing complexity. This letter proposes a simple, yet effective, energy beamforming scheme that allows a multi-antenna power beacon (PB) to fairly power a set of IoT devices by only relying on the first-order statistics of the channels. In addition to low complexity, the proposed scheme performs favorably as compared to benchmarking schemes and its performance improves as the number of PB’s antennas increases. Finally, it is shown that further performance improvement can be achieved through proper angular rotations of the PB.

13 November 2015 in IEEE Signal Processing Letters
Verified
Journal Article
Open access
FRFrancisco Rosario
Francisco Rosario
FMFrancisco A. Monteiro
Francisco A. Monteiro
ARAntónio Rodrigues
António Rodrigues
In this letter, methods and corresponding complexities for fast matrix inversion updates in the context of massive multiple-input multiple-output (MIMO) are studied. In particular, we propose an on-the-fly method to recompute the zero forcing (ZF) filter when a user is added or removed from the system. Additionally, we evaluate the recalculation of the inverse matrix after a new channel estimation is obtained for a given user. Results are evaluated numerically in terms of bit error rate (BER) using the Neumann series approximation as the initial inverse matrix. It is concluded that, with fewer operations, the performance after an update remains close to the initial one.

18 January 2023 in IEEE Access
Verified
Journal Article
Open access
SSSara Santos
Sara Santos
FMFrancisco A. Monteiro
Francisco A. Monteiro
BCBruno C. Coutinho
Bruno C. Coutinho
YOYasser Omar
Yasser Omar
A fully-quantum network implies the creation of quantum entanglement between a given source node and some other destination node, with a number of quantum repeaters in between. This paper tackles the problem of quantum entanglement distribution by solving the routing problem over an infrastructure based on quantum repeaters and with a finite number of pairs of entangled qubits available in each link. The network model considers that link purification is available such that a nested purification protocol can be applied at each link to generate entangled qubits with higher fidelity than the original ones. A low-complexity multi-objective routing algorithm to find the shortest path between any two given nodes is proposed and assessed for random networks, using a fairly general path extension mechanism that can fit a large family of particular technological requirements. Different types of quantum protocols require different levels of fidelity for the entangled qubit pairs. For that reason, the proposed algorithm identifies the shortest path between two nodes that assures an end-to-end fidelity above a specified threshold. The minimum requirements for the end-to-end entanglement fidelity depend on the whole extension of the paths, and cannot be looked at as a local property of each link. Moreover, one needs to keep track not only of the shortest path, but also of longer paths holding more entangled qubits than the shorter paths in order to satisfy the fidelity criterion. Thus, standard single parameter shortest-path algorithms do not necessarily converge to the optimal solution. The problem of finding the best path in a network subject to multiple criteria (known as multi-objective routing) is, in general, an NP-hard problem due to the rapid growth of the number of stored paths. This work proposes a metric that identifies and discards paths that are objectively worse than others. By doing so, the time complexity of the proposed algorithm scales near-to-linearly with respect to the number of nodes in the network, showing that the shortest path problem in quantum networks can be solved with a complexity very close to the one of the classical counterparts. That is analytically proved for the case where all the links of a path have the same fidelity (homogeneous model). The algorithm is also adapted to a particular type of path extension, where different links along a path can be purified to different degrees, asserting its flexibility and near-to-linearity even when heterogeneous fidelities along the sections of a path are considered.

8 December 2022 in IEEE Communications Letters
Verified
Journal Article
Closed access
ICIoannis Chatzigeorgiou
Ioannis Chatzigeorgiou
FMFrancisco A. Monteiro
Francisco A. Monteiro
Guessing random additive noise decoding (GRAND) is a noise-centric decoding method, which is suitable for low-latency communications, as it supports error correction codes that generate short codewords. GRAND estimates transmitted codewords by guessing the error patterns that altered them during transmission. The guessing process requires the testing of error patterns that are arranged in increasing order of Hamming weight. This approach is fitting for binary transmission over additive white Gaussian noise channels. This letter considers transmission of coded and modulated data over block fading channels and proposes a more computationally efficient variant of GRAND, which leverages information on the modulation scheme and the fading channel. In the core of the proposed variant, referred to as symbol-level GRAND, is an expression that approximately computes the probability of occurrence of an error pattern and determines the order with which error patterns are tested. Analysis and simulation results demonstrate that symbol-level GRAND produces estimates of the transmitted codewords faster than the original GRAND at the cost of a small increase in memory requirements.

23 October 2023 in IEEE Access
Verified
Journal Article
Open access
DCDiogo Cruz
Diogo Cruz
FMFrancisco A. Monteiro
Francisco A. Monteiro
BCBruno C. Coutinho
Bruno C. Coutinho
Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. Practical quantum error correction codes, such as stabilizer codes, are generally structured to suit a specific use, and present rigid code lengths and code rates. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime, for any chosen code length when the code rate is sufficiently high. A recently proposed strategy for decoding classical codes called GRAND (guessing random additive noise decoding) opened doors to efficiently decode classical random linear codes (RLCs) performing near the maximum rate of the finite blocklength regime. By using noise statistics, GRAND is a noise-centric efficient universal decoder for classical codes, provided that a simple code membership test exists. These conditions are particularly suitable for quantum systems, and therefore the paper extends these concepts to quantum random linear codes (QRLCs), which were known to be possible to construct but whose decoding was not yet feasible. By combining QRLCs and a newly proposed quantum-GRAND, this work shows it is possible to decode QECCs that are easy to adapt to changing conditions. The paper starts by assessing the minimum number of gates in the coding circuit needed to reach the QRLCs’ asymptotic performance, and subsequently proposes a quantum-GRAND algorithm that makes use of quantum noise statistics, not only to build an adaptive code membership test, but also to efficiently implement syndrome decoding.

21 June 2021 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
FMFrancisco A. Monteiro
Francisco A. Monteiro
Onel Luis Alcaraz LópezOnel Luis Alcaraz López
Onel Luis Alcaraz López
HAHirley Alves
Hirley Alves
Wireless energy transfer (WET) is a promising solution to enable massive machine-type communications (mMTC) with low-complexity and low-powered wireless devices. Given the energy restrictions of the devices, instant channel state information at the transmitter (CSIT) is not expected to be available in practical WET-enabled mMTC. However, because it is common that the terminals appear spatially clustered, some degree of spatial correlation between their channels to the base station (BS) is expected to occur. The paper considers a massive antenna array at the BS for WET that only has access to i) the first and second order statistics of the Rician channel component of the multiple-input multiple-output (MIMO) channel and also to ii) the line-of-sight MIMO component. The optimal precoding scheme that maximizes the total energy available to the single-antenna devices is derived considering a continuous alphabet for the precoders, permitting any modulated or deterministic waveform. This may lead to some devices in the clusters being assigned a low fraction of the total available power in the cluster, creating a rather uneven situation among them. Consequently, a fairness criterion is introduced, imposing a minimum amount of power allocated to the terminals. A piece-wise linear harvesting circuit is considered at the terminals, with both saturation and a minimum sensitivity, and a constrained version of the precoder is also proposed by solving a non-linear programming problem. A paramount benefit of the constrained precoder is the encompassment of fairness in the power allocation to the different clusters. Moreover, given the polynomial complexity increase of the proposed unconstrained precoder, and the observed linear gain of the system's available sum-power with an increasing number of antennas at the ULA, the use of massive antenna arrays is desirable.