arXiv subjects

Antonio Pascual-Iserte

Publications and source records attributed to Antonio Pascual-Iserte.

At least 19 recordsLinked to original sources

arXiv2026

RIS-assisted Multiuser MISO Transmission and the Impact of Imperfect Channel Estimation

This paper proposes the joint design of reconfigurable intelligent surfaces (RIS) and zero-forcing (ZF) precoding for the downlink (DL) multiuser multiple-input single-output (MU-MISO) setup in millimeter-wave (mmWave) bands, where ZF is particularly attractive due to its ability to suppress inter-user interference by exploiting the large antenna arrays and sparse directional channels characteristic of mmWave systems. This ensures efficient spatial multiplexing with manageable complexity, making ZF a practical and in modern 5G/6G deployments. However, a careful design is necessary to overcome potential rank deficiency in the channel matrix. For the MU-MISO case, rank deficiency may arise if users exhibit significantly different channel gains or if, being in far-field, they are aligned with the position of the transmitter. On the other hand, the deployment of a RIS introduces artificial scattering which can shape the radio environment to address those situations. We explore the joint design under perfect channel knowledge, assess the impact of imperfect channel estimation on the bit error rate (BER) and propose a robust design of pilot transmissions that equalizes multiuser interference across users in the presence of channel errors in the precoder design. This evaluation shows the advantages of optimized RIS-aided ZF MU-MISO communication for the DL of wireless systems.

eess.SP↗

arXiv2026

Design of RIS-aided mMTC+ Networks for Rate Maximization under the Finite Blocklength Regime with Imperfect Channel Knowledge

Within the context of massive machine-type communications+, reconfigurable intelligent surfaces (RISs) represent a promising technology to boost system performance in scenarios with poor channel conditions. Considering single-antenna sensors transmitting short data packets to a multiple-antenna collector node, we introduce and design an RIS to maximize the weighted sum rate (WSR) of the system working in the finite blocklength regime. Due to the large number of reflecting elements and their passive nature, channel estimation errors may occur. In this letter, we then propose a robust RIS optimization to combat such a detrimental issue. Based on concave bounds and approximations, the nonconvex WSR problem for the RIS response is addressed via successive convex optimization (SCO). Numerical experiments validate the performance and complexity of the SCO solutions.

eess.SP↗

arXiv2026

Robust Design of Reconfigurable Intelligent Surfaces for Parameter Estimation in MTC

This paper introduces a reconfigurable intelligent surface (RIS) to support parameter estimation in machine-type communications (MTC). We focus on a network where single-antenna sensors transmit spatially correlated measurements to a multiple-antenna collector node (CN) via non-orthogonal multiple access. We propose an estimation scheme based on the minimum mean square error (MMSE) criterion. We also integrate successive interference cancelation (SIC) at the receiver to mitigate communication failures in noisy and interference-prone channels under the finite blocklength (FBL) regime. Moreover, recognizing the importance of channel state information (CSI), we explore various methodologies for its acquisition at the CN. We statistically design the RIS configuration and SIC decoding order to minimize estimation error while accounting for channel temporal variations and short packet lengths. To mirror practical systems, we incorporate the detrimental effects of FBL communication and imperfect CSI errors in our analysis. Simulations demonstrate that larger reflecting surfaces lead to smaller MSEs and underscore the importance of selecting an appropriate decoding order for accuracy and ultimate performance.

eess.SP↗

arXiv2024

Rate Optimization for RIS-Aided mMTC Networks in the Finite Blocklength Regime

Reconfigurable intelligent surfaces (RISs) have become a promising candidate for the development of future mobile systems. In the context of massive machine-type communications (mMTC), a RIS can be used to support the transmission from a group of sensors to a collector node. Due to the short data packets, we focus on the design of the RIS for maximizing the weighted sum and minimum rates in the finite blocklength regime. Under the assumption of non-orthogonal multiple access, successive interference cancelation is considered as a decoding scheme to mitigate interference. Accordingly, we formulate the optimizations as non-convex problems and propose two sub-optimal solutions based on gradient ascent (GA) and sequential optimization (SO) with semi-definite relaxation (SDR). In the GA, we distinguish between Euclidean and Riemannian gradients. For the SO, we derive a concave lower bound for the throughput and maximize it sequentially applying SDR. Numerical results show that the SO can outperform the GA and that strategies relying on the optimization of the classical Shannon capacity might be inadequate for mMTC networks.

eess.SP↗

arXiv2024

Entropy-Based Sensing Schemes for Energy Efficiency in Massive MTC

Machine-type communications (MTC) are crucial in the evolution of mobile communication systems. Within this context, we distinguish the so-called massive MTC (mMTC), where a large number of devices coexist in the same geographical area. In the case of sensors, a high correlation in the collected information is expected. In this letter, we evaluate the impact of correlation on the entropy of a set of quantized Gaussian sources. This model allows us to express the sensed data with the data correlation matrix. Given the nature of mMTC, these matrices may be well approximated as rank deficient. Accordingly, we exploit this singularity to design a technique for switching off several sensors that maximizes the entropy under power-related constraints. The discrete optimization problem is transformed into a convex formulation that can be solved numerically.

eess.SP↗

arXiv2024

Sensor Selection and Distributed Quantization for Energy Efficiency in Massive MTC

This paper presents an estimation approach within the framework of uplink massive machine-type communications (mMTC) that considers the energy limitations of the devices. We focus on a scenario where a group of sensors observe a set of parameters and send the measured information to a collector node (CN). The CN is responsible for estimating the original observations, which are spatially correlated and corrupted by measurement and quantization noise. Given the use of Gaussian sources, the minimum mean squared error (MSE) estimation is employed and, when considering temporal evolution, the use of Kalman filters is studied. Based on that, we propose a device selection strategy to reduce the number of active sensors and a quantization scheme with adjustable number of bits to minimize the overall payload. The set of selected sensors and quantization levels are, thus, designed to minimize the MSE. For a more realistic analysis, communication errors are also included by averaging the MSE over the error decoding probabilities. We evaluate the performance of our strategy in a practical mMTC system with synthetic and real databases. Simulation results show that the optimization of the payload and the set of active devices can reduce the power consumption without compromising the estimation accuracy.

eess.SP↗

arXiv2024

Approximations of the Aggregated Interference Statistics for Outage Analysis in Massive MTC

This paper presents several analytic closed-form approximations of the aggregated interference statistics within the framework of uplink massive machine-type communications (mMTC), taking into account the random activity of the sensors. Given its discrete nature and the large number of devices involved, a continuous approximation based on the Gram--Charlier series expansion of a truncated Gaussian kernel is proposed. We use this approximation to derive an analytic closed-form expression for the outage probability, corresponding to the event of the signal-to-interference-and-noise ratio being below a detection threshold. This metric is useful since it can be used for evaluating the performance of mMTC systems. We analyze, as an illustrative application of the previous approximation, a scenario with several multi-antenna collector nodes, each equipped with a set of predefined spatial beams. We consider two setups, namely single- and multiple-resource, in reference to the number of resources that are allocated to each beam. A graph-based approach that minimizes the average outage probability, and that is based on the statistics approximation, is used as allocation strategy. Finally, we describe an access protocol where the resource identifiers are broadcast (distributed) through the beams. Numerical simulations prove the accuracy of the approximations and the benefits of the allocation strategy.

eess.SP↗

arXiv2024

User Grouping and Resource Allocation in Multiuser MIMO Systems under SWIPT

This paper considers a broadcast multiple-input multiple-output (MIMO) network with multiple users and simultaneous wireless information and power transfer (SWIPT). In this scenario, it is assumed that some users are able to harvest power from radio frequency (RF) signals to recharge batteries through wireless power transfer from the transmitter, while others are served simultaneously with data transmission. The criterion driving the optimization and design of the system is based on the weighted sum rate for the users being served with data. At the same time, constraints stating minimum per-user harvested powers are included in the optimization problem. This paper derives the structure of the optimal transmit covariance matrices in the case where both types of users are present simultaneously in the network, particularizing the results to the cases where either only harvesting nodes or only information users are to be served. The tradeoff between the achieved weighted sum rate and the powers harvested by the user terminals is analyzed and evaluated using the rate-power (R-P) region. Finally, we propose a two-stage user grouping mechanism that decides which users should be scheduled to receive information and which users should be configured to harvest energy from the RF signals in each particular scheduling period, this being one of the main contributions of this paper.

eess.SP↗

arXiv2024

A Tractable Closed-Form Approximation of the Ergodic Rate in Poisson Cellular Networks

The employment of stochastic geometry for the analysis and design of ultra dense networks (UDNs) has provided significant insights into network densification. In addition to the characterization of the network performance and behavior, these tools can also be exploited toward solving complex optimization problems that could maximize the capacity benefits arising in UDNs. However, this is preconditioned on the existence of tractable closed form expressions for the considered figures of merit. In this course, the present paper introduces an accurate approximation for the moment generating function (MGF) of the aggregate other-cell interference created by base stations whose positions follow a Poisson point process of given spatial density. Given the pivotal role of the MGF of the aggregate interference in stochastic geometry and the tractability of the derived MGF, the latter can be employed to substantially simplify ensuing stochastic geometry analyses. Subsequently, the present paper employs the introduced MGF to provide closed form expressions for the downlink ergodic capacity for the interference limited case, and validates the accuracy of these expressions by the use of extensive Monte Carlo simulations. The derived expressions depend on the density of users and base stations, setting out a densification road map for network operators and designers of significant value.

eess.SP↗

arXiv2024

Robust Precoding for Multi-User Visible Light Communications with Quantized Channel Information

In this paper, we address the design of multi-user multiple-input single-output (MU-MISO) precoders for indoor visible light communication (VLC) systems. The goal is to minimize the transmitted optical power per light emitting diode (LED) under imperfect channel state information (CSI) at the transmitter side. Robust precoders for imperfect CSI available in the literature include noisy and outdated channel estimation cases. However, to the best of our knowledge, no work has considered adding robustness against channel quantization. In this paper, we fill this gap by addressing the case of imperfect CSI due to the quantization of VLC channels. We model the quantization errors in the CSI through polyhedric uncertainty regions. For polyhedric uncertainty regions and positive real channels, as is the case of VLC channels, we show that the robust precoder against channel quantization errors that minimizes the transmitted optical power while guaranteeing a target signal to noise plus interference ratio (SNIR) per user is the solution of a second order cone programming (SOCP) problem. Finally, we evaluate its performance under different quantization levels through numerical simulations.

eess.SP↗

arXiv2024

Analysis of Blocking in mmWave Cellular Systems: Application to Relay Positioning

Within the framework of 5G, blockage effects occurring in the mmWave band are critical. Previous works describe the effects of blockages in isolated and multiple links for simple blocking objects, modeled with mathematical tools such as stochastic geometry and random shape theory. Our study uses these tools to characterize a scenario with $N$ links, including the possible correlation among them in terms of blocking for several models of blocking objects. We include numerical evaluations highlighting that assuming independence among the links' blocking elements is a too-brief simplification and does not accurately describe the real scenario. This paper also applies the formulation developed for the case of $N$ links to optimize the relay positioning in mmWave cells for coverage enhancement, that is, to minimize the communication failure probability. We also show that both link budget and blockages affect the optimum positioning of the relays as they are both essential for successful transmission.

eess.SP↗

arXiv2024

Analysis of Blocking in mmWave Cellular Systems: Characterization of the LOS and NLOS Intervals in Urban Scenarios

In the millimeter waves (mmWave) bands considered for 5G and beyond, the use of very high frequencies results in the interruption of communication whenever there is no line of sight between the transmitter and the receiver. Blockages have been modeled in the literature so far using tools such as stochastic geometry and random shape theory. Using these tools, in this paper, we characterize the lengths of the segments in line-of-sight (LOS) and in non-line-of-sight (NLOS) statistically in an urban scenario where buildings (with random positions, lengths, and heights) are deployed in parallel directions configuring streets.

eess.SP↗

arXiv2024

Effect of Correlated Building Blockages on the Ergodic Capacity of mmWave Systems in Urban Scenarios

The mmWave bands, considered to support the forthcoming generation of mobile communications technologies, have a well-known vulnerability to blockages. Recent works in the literature analyze the blockage probability considering independence or correlation among the blocking elements of the different links. In this letter, we characterize the effect of blockages and their correlation on the ergodic capacity. We carry out the analysis for urban scenarios, where the considered blocking elements are buildings that are primarily parallel to the streets. We also present numerical simulations based on actual building features of the city of Chicago to validate the obtained expressions.

eess.SP↗

arXiv2024

LOS/NLOS Estimators for mmWave Cellular Systems With Blockages

Designers of millimeter wave (mmWave) cellular systems need to evaluate line-of-sight (LOS) maps to provide good service to users in urban scenarios. In this letter, we derive estimators to obtain LOS maps in scenarios with potential blocking elements. Applying previous stochastic geometry results, we formulate the optimal Bayesian estimator of the LOS map using a limited number of actual measurements at different locations. The computational cost of the optimal estimator is derived and is proven to be exponential in the number of available data points. An approximation is discussed, which brings the computational complexity from exponential to quasi-linear and allows the implementation of a practical estimator. Finally, we compare numerically the optimal estimator and the approximation with other estimators from the literature and also with an original heuristic estimator with good performance and low computational cost. For the comparison, both synthetic layouts and a real layout of Chicago have been used.

eess.SP↗

arXiv2020

Stochastic Geometry Analysis and Design of Wireless Powered MTC Networks

Machine-type-communications (MTC) are being crucial in the development of next generation mobile networks. Given that MTC devices are usually battery constrained, wireless power transfer (WPT) and energy harvesting (EH) have emerged as feasible options to enlarge the lifetime of the devices, leading to wireless powered networks. In that sense, we consider a setup where groups of sensors are served by a base station (BS), which is responsible for the WPT. Additionally, EH is used to collect energy from the wireless signals transmitted by other sensors. To characterize the energy obtained from both procedures, we model the sporadic activity of sensors as Bernoulli random variables and their positions with repulsive Matérn cluster processes. This way, the random activity and spatial distribution of sensors are introduced in the analysis of the energy statistics. This analysis can be useful for system design aspects such as energy allocation schemes or optimization of idle-active periods, among others. As an example of use of the developed analysis, we include the design of a WPT scheme under a proportional fair policy.

eess.SP↗

arXiv2016

Analysis of Downlink and Uplink Decoupling in Dense Cellular Networks

Decoupling uplink (UL) and downlink (DL) is a new architectural paradigm where DL and UL are not constrained to be associated to the same base station (BS). Building upon this paradigm, the goal of the present paper is to provide lower, albeit tight bounds for the ergodic UL capacity of a decoupled cellular network. The analysis is performed for a scenario consisting of a macro BS and a set of small cells (SCs) whose positions are selected randomly according to a Poisson point process of a given spatial density. Based on this analysis simple bounds in closed form expressions are defined. The devised bounds are employed to compare the performance of the decoupled case versus a set of benchmark cases, namely the coupled case, and the situations of having either a single macro BS or only SCs. This comparison provides valuable insights regarding the behavior and performance of such networks, providing simpler expressions for the ergodic UL capacity as a function of the distances to the macro BS and the density of SCs. These expressions constitute a simple guide to the minimum degree of densification that guarantees the Quality of Service (QoS) objectives of the network, thus, providing a valuable tool to the network operator of significant practical and commercial value.

cs.IT↗

arXiv2016

Joint Optimization of Power and Data Transfer in Multiuser MIMO Systems

We present an approach to solve the nonconvex optimization problem that arises when designing the transmit covariance matrices in multiuser multiple-input multiple-output (MIMO) broadcast networks implementing simultaneous wireless information and power transfer (SWIPT). The MIMO SWIPT problem is formulated as a general multi-objective optimization problem, in which data rates and harvested powers are optimized simultaneously. Two different approaches are applied to reformulate the (nonconvex) multi-objective problem. In the first approach, the transmitter can control the specific amount of power to be harvested by power transfer whereas in the second approach the transmitter can only control the proportion of power to be harvested among the different harvesting users. The computational complexity will also be different, with higher computational resources required in the first approach. In order to solve the resulting formulations, we propose to use the majorization-minimization (MM) approach. The idea behind this approach is to obtain a convex function that approximates the nonconvex objective and, then, solve a series of convex subproblems that will converge to a locally optimal solution of the general nonconvex multi-objective problem. The solution obtained from the MM approach is compared to the classical block-diagonalization (BD) strategy, typically used to solve the nonconvex multiuser MIMO network by forcing no interference among users. Simulation results show that the proposed approach improves over the BD approach both the system sum rate and the power harvested by users. Additionally, the computational times needed for convergence of the proposed methods are much lower than the ones required for classical gradient-based approaches.

cs.IT↗

arXiv2015

A Stochastic Approach for Resource Allocation with Backhaul and Energy Harvesting Constraints

We propose a novel stochastic radio resource allocation strategy that achieves long-term fairness considering backhaul and air-interface capacity limitations. The base station is considered to be only powered with a finite battery that is recharged by an energy harvesting source. Such energy harvesting is also taken into account in the proposed resource allocation strategy. This technical scenario can be found in remote rural areas where the backhaul connection is very limited and the base stations are fed with solar panels of reduced size. Our results show that the proposed scheme achieves higher fairness among the users and, in some cases, a higher sum-rate compared with the well-known proportional fair scheduler.

cs.IT↗