Marco Luise
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Marco Luise has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
- Giacomo Bacci
Dipartimento Ingegneria dell'Informazione Università di Pisa 56122 Pisa Italy
8 shared publications - Harold Vincent Poor
Princeton University
6 shared publications - Riccardo De Gaudenzi
European Space Agency
6 shared publications - Giacomo Bacci
Dip. Ingegneria dellInformazione, University of Pisa, Pisa, Italy
5 shared publications - Luca Sanguinetti
Dipartimento di Ingegneria dellInformazione, University of Pisa, Pisa, Italy
5 shared publications - Giacomo Bacci
MBI srl, Pisa, Italy
3 shared publications
Latest Publications
- 1 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (5) , 11069-11087
Applicability of CF-MIMO Precoding to a Formation of Arrays (FoA) for Mobile Satellite Communications
Modern mobile satellite networks rely on advanced onboard antenna systems, used in both large geostationary Earth orbit (GEO) satellites and smaller low Earth orbit (LEO) satellites in mega-constellations. Current research is exploring coordinated formations or swarms of small satellites with simple antennas to create a large, distributed mega-antenna in space. These systems enable advanced network configurations using massive multiple input multiple output (M-MIMO) technologies, with the ultimate goal of extending the cell-free massive MIMO (CF-MIMO) approach, proposed for terrestrial networks in beyond-5G (B5G) and 6G, to wide-area satellite networks. This paper focuses on satellite CF-MIMO, considering two antenna configurations: i) formation of arrays (FoA), with a large, closely spaced antenna at S-band in GEO (single FoA with regional or continent-wide coverage, with hundreds of satellites with spacing up to $\text{10}\,\text{km}$) or LEO (constellation of few closely spaced satellites); ii) (mega)constellation of LEO satellites in different orbital planes, with spacing up to $\text{100}\,\text{km}$. In such scenarios, we assess the applicability and the relative performance of CF-MIMO technology to a wide-area satellite network through extensive simulation, also including critical system issues such as array geometry, power normalization, synchronization and radio resource management (RRM). We show that system throughput is maximized by minimizing satellite spacing and employing regular FoA geometries. For both GEO and LEO cases, the potential gains offered by minimum mean square error (MMSE) precoding are contingent upon tight satellite synchronization and minimal inter-satellite spacing. Furthermore, adopting an effective RRM algorithm is crucial for achieving optimal performance under both uniform and non-uniform traffic distributions.
- 1 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (5) , 11069-11087
Applicability of CF-MIMO Precoding to a Formation of Arrays (FoA) for Mobile Satellite Communications
Modern mobile satellite networks rely on advanced onboard antenna systems, used in both large geostationary Earth orbit (GEO) satellites and smaller low Earth orbit (LEO) satellites in mega-constellations. Current research is exploring coordinated formations or swarms of small satellites with simple antennas to create a large, distributed mega-antenna in space. These systems enable advanced network configurations using massive multiple input multiple output (M-MIMO) technologies, with the ultimate goal of extending the cell-free massive MIMO (CF-MIMO) approach, proposed for terrestrial networks in beyond-5G (B5G) and 6G, to wide-area satellite networks. This paper focuses on satellite CF-MIMO, considering two antenna configurations: i) formation of arrays (FoA), with a large, closely spaced antenna at S-band in GEO (single FoA with regional or continent-wide coverage, with hundreds of satellites with spacing up to $\text{10}\,\text{km}$) or LEO (constellation of few closely spaced satellites); ii) (mega)constellation of LEO satellites in different orbital planes, with spacing up to $\text{100}\,\text{km}$. In such scenarios, we assess the applicability and the relative performance of CF-MIMO technology to a wide-area satellite network through extensive simulation, also including critical system issues such as array geometry, power normalization, synchronization and radio resource management (RRM). We show that system throughput is maximized by minimizing satellite spacing and employing regular FoA geometries. For both GEO and LEO cases, the potential gains offered by minimum mean square error (MMSE) precoding are contingent upon tight satellite synchronization and minimal inter-satellite spacing. Furthermore, adopting an effective RRM algorithm is crucial for achieving optimal performance under both uniform and non-uniform traffic distributions.
- Open Access
- 8 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 60 (3) , 3348-3367
Optimizing a Formation-of-Arrays (FoA) Satellite Antenna System for Very High-Throughput Communications
Formation of arrays (FoA) distributed antenna technology has recently been proposed to provide 5G-like mobile satellites services in the context of the integration of non terrestrial with terrestrial networks – the overall system goal being a sufficiently high throughput in terms of bit rate per unit area on the ground. This large distributed array configuration (resulting from the formation of many satellites each carrying its own small antenna) must be carefully engineered to provide the desired benefits. In this paper, we tackle some fundamental issues related to FoA design, namely, frequency selectivity , power generation , and optimal formation configuration . Concerning frequency selectivity, we evaluate the intrinsic FoA frequency response assuming a wideband signal, and suggest how to mitigate possible impairments from a communication system perspective. Regarding power generation, we show how to decouple the functions of antenna and solar arrays to come to a power-efficient satellite configuration and design. Finally, in terms of formation optimization, we investigate a formation thinning approach with random placement of satellites on a grid, leading to a significant reduction of secondary beams in the emission of the FoA as well as fully satisfying the constraints placed by optimum power generation.
- 8 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 60 (3) , 3348-3367
Open AccessOptimizing a Formation-of-Arrays (FoA) Satellite Antenna System for Very High-Throughput Communications
Formation of arrays (FoA) distributed antenna technology has recently been proposed to provide 5G-like mobile satellites services in the context of the integration of non terrestrial with terrestrial networks – the overall system goal being a sufficiently high throughput in terms of bit rate per unit area on the ground. This large distributed array configuration (resulting from the formation of many satellites each carrying its own small antenna) must be carefully engineered to provide the desired benefits. In this paper, we tackle some fundamental issues related to FoA design, namely, frequency selectivity , power generation , and optimal formation configuration . Concerning frequency selectivity, we evaluate the intrinsic FoA frequency response assuming a wideband signal, and suggest how to mitigate possible impairments from a communication system perspective. Regarding power generation, we show how to decouple the functions of antenna and solar arrays to come to a power-efficient satellite configuration and design. Finally, in terms of formation optimization, we investigate a formation thinning approach with random placement of satellites on a grid, leading to a significant reduction of secondary beams in the emission of the FoA as well as fully satisfying the constraints placed by optimum power generation.
- Open Access
Towards Programmable Network Dynamics: A Chemistry-Inspired Abstraction for Hardware Design
Chemical algorithms are statistical algorithms described and represented as chemical reaction networks. They are particularly attractive for traffic shaping and general control of network dynamics; they are analytically tractable, they reinforce a strict state-to-dynamics relationship, they have configurable stability properties, and they are directly implemented in state-space using a high-level (graphical) representation. In this paper, we present a direct implementation of chemical algorithms on FPGA hardware. Besides substantially improving performance, we have achieved hardware-level programmability and re-configurability of these algorithms at runtime (not interrupting servicing) and in realtime (with sub-second latency). This opens an interesting perspective for expanding the currently limited scope of software defined networking and network virtualisation solutions, to include programmable control of network dynamics.
Open AccessTowards Programmable Network Dynamics: A Chemistry-Inspired Abstraction for Hardware Design
Chemical algorithms are statistical algorithms described and represented as chemical reaction networks. They are particularly attractive for traffic shaping and general control of network dynamics; they are analytically tractable, they reinforce a strict state-to-dynamics relationship, they have configurable stability properties, and they are directly implemented in state-space using a high-level (graphical) representation. In this paper, we present a direct implementation of chemical algorithms on FPGA hardware. Besides substantially improving performance, we have achieved hardware-level programmability and re-configurability of these algorithms at runtime (not interrupting servicing) and in realtime (with sub-second latency). This opens an interesting perspective for expanding the currently limited scope of software defined networking and network virtualisation solutions, to include programmable control of network dynamics.
- 1 October 2015
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 83 (1) , 93-111
An Approach to T&E of Military SDR Platforms and Waveforms: the LANCERS Lab
- 1 October 2015
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 83 (1) , 93-111
An Approach to T&E of Military SDR Platforms and Waveforms: the LANCERS Lab
- 15 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Magazine
- Vol. 32 (4) , 132-137
Understanding Game Theory via Wireless Power Control [Lecture Notes]
In this lecture note, we introduce the basic concepts of game theory (GT), a branch of mathematics traditionally studied and applied in the areas of economics, political science, and biology, which has emerged in the last 15 years as an effective framework for communications, networking, and signal processing (SP). The real catalyst has been all of the blooming issues related to distributed networks in which the nodes can be modeled as players in a game competing for system resources. Some relevant notions of GT are introduced by elaborating on a simple application in the context of wireless communications, notably the power control in an interference channel (IC) with two transmitters and two receivers.
- 15 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Magazine
- Vol. 32 (4) , 132-137
Understanding Game Theory via Wireless Power Control [Lecture Notes]
In this lecture note, we introduce the basic concepts of game theory (GT), a branch of mathematics traditionally studied and applied in the areas of economics, political science, and biology, which has emerged in the last 15 years as an effective framework for communications, networking, and signal processing (SP). The real catalyst has been all of the blooming issues related to distributed networks in which the nodes can be modeled as players in a game competing for system resources. Some relevant notions of GT are introduced by elaborating on a simple application in the context of wireless communications, notably the power control in an interference channel (IC) with two transmitters and two receivers.
- Open Access
- 17 June 2014
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2014 (1) , 93
Signal processing techniques for anywhere, anytime positioning
- 17 June 2014
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2014 (1) , 93
Open AccessSignal processing techniques for anywhere, anytime positioning
- Open Access
Upper-Bounding the Capacity of Relay Communications - Part II
This paper focuses on the capacity of peer-to-peer relay communications wherein the transmitter are assisted by an arbitrary number of parallel relays, i.e. there is no link and cooperation between the relays themselves. We detail the mathematical model of different relaying strategies including cutset and amplify and forward strategies. The cutset upper bound capacity is presented as a reference to compare another realistic strategy. We present its outer region capacity which is lower than that in the existing literature. We show that a multiple parallel relayed network achieves its maximum capacity by virtue of only one relay or by virtue of all relays together. Adding a relay may even decrease the overall capacity or may do not change it. We exemplify various outer region capacities of the addressed strategies with two different case studies. The results exhibit that in low signal-to-noise ratio (SNR) environments the cutset outperforms the amplify and forward strategy and this is contrary in high SNR environments.
Open AccessUpper-Bounding the Capacity of Relay Communications - Part II
This paper focuses on the capacity of peer-to-peer relay communications wherein the transmitter are assisted by an arbitrary number of parallel relays, i.e. there is no link and cooperation between the relays themselves. We detail the mathematical model of different relaying strategies including cutset and amplify and forward strategies. The cutset upper bound capacity is presented as a reference to compare another realistic strategy. We present its outer region capacity which is lower than that in the existing literature. We show that a multiple parallel relayed network achieves its maximum capacity by virtue of only one relay or by virtue of all relays together. Adding a relay may even decrease the overall capacity or may do not change it. We exemplify various outer region capacities of the addressed strategies with two different case studies. The results exhibit that in low signal-to-noise ratio (SNR) environments the cutset outperforms the amplify and forward strategy and this is contrary in high SNR environments.
- Open Access
A Chemistry-Inspired Framework for Achieving Consensus in Wireless Sensor Networks
The aim of this paper is to show how simple interaction mechanisms, inspired by chemical systems, can provide the basic tools to design and analyze a mathematical model for achieving consensus in wireless sensor networks, characterized by balanced directed graphs. The convergence and stability of the model are first proven by using new mathematical tools, which are borrowed directly from chemical theory, and then validated by means of simulation results, for different network topologies and number of sensors. The underlying chemical theory is also used to derive simple interaction rules that may account for practical issues, such as the estimation of the number of neighbors and the robustness against perturbations. Finally, the proposed chemical solution is validated under real-world conditions by means of a four-node hardware implementation where the exchange of information among nodes takes place in a distributed manner (with no need for any admission control and synchronism procedure), simply relying on the transmission of a pulse whose rate is proportional to the state of each sensor.
Open AccessA Chemistry-Inspired Framework for Achieving Consensus in Wireless Sensor Networks
The aim of this paper is to show how simple interaction mechanisms, inspired by chemical systems, can provide the basic tools to design and analyze a mathematical model for achieving consensus in wireless sensor networks, characterized by balanced directed graphs. The convergence and stability of the model are first proven by using new mathematical tools, which are borrowed directly from chemical theory, and then validated by means of simulation results, for different network topologies and number of sensors. The underlying chemical theory is also used to derive simple interaction rules that may account for practical issues, such as the estimation of the number of neighbors and the robustness against perturbations. Finally, the proposed chemical solution is validated under real-world conditions by means of a four-node hardware implementation where the exchange of information among nodes takes place in a distributed manner (with no need for any admission control and synchronism procedure), simply relying on the transmission of a pulse whose rate is proportional to the state of each sensor.
- Open Access
Energy-Efficient Power Control for Contention-Based Synchronization in OFDMA Systems with Discrete Powers and Limited Feedback
This work derives a distributed and iterative algorithm by which mobile terminals can selfishly control their transmit powers during the synchronization procedure specified by the IEEE 802.16m and the 3GPP-LTE standards for orthogonal frequency-division multiple-access technologies. The proposed solution aims at maximizing the energy efficiency of the network and is derived on the basis of a finite noncooperative game in which the players have discrete action sets of transmit powers. The set of Nash equilibria of the game is investigated, and a distributed power control algorithm is proposed to achieve synchronization in an energy-efficient manner under the assumption that the feedback from the base station is limited. Numerical results show that the proposed solution improves the energy efficiency as well as the timing estimation accuracy of the network compared to existing alternatives, while requiring a reasonable amount of information to be exchanged on the return channel.
Open AccessEnergy-Efficient Power Control for Contention-Based Synchronization in OFDMA Systems with Discrete Powers and Limited Feedback
This work derives a distributed and iterative algorithm by which mobile terminals can selfishly control their transmit powers during the synchronization procedure specified by the IEEE 802.16m and the 3GPP-LTE standards for orthogonal frequency-division multiple-access technologies. The proposed solution aims at maximizing the energy efficiency of the network and is derived on the basis of a finite noncooperative game in which the players have discrete action sets of transmit powers. The set of Nash equilibria of the game is investigated, and a distributed power control algorithm is proposed to achieve synchronization in an energy-efficient manner under the assumption that the feedback from the base station is limited. Numerical results show that the proposed solution improves the energy efficiency as well as the timing estimation accuracy of the network compared to existing alternatives, while requiring a reasonable amount of information to be exchanged on the return channel.