Search

In this paper, performance of an Integrated Sensing and Communication (ISAC) Vehicle-to-Everything (V2X) scenario is evaluated, in which a vehicle simultaneously detects the next vehicle ahead while receiving a communication signal from a RoadSide Unit (RSU) of the infrastructure. Univariate and joint radar and communication performance metrics are evaluated within three different frameworks, namely the Stochastic Geometry (SG), Monte-Carlo (MC), and Ray-Tracing (RT) frameworks. The parameters of the system model are extracted from the RT simulations, and the metrics are compared to assess the accuracy of the SG framework. It is shown that the SG and MC system models are relevant w.r.t. RT simulations for the evaluation of univariate communication and sensing metrics, but larger discrepancies are observed for the joint metrics.

In this paper, performance bounds for the multi-antenna near-field range estimation of extended targets are provided. First, analytic expressions of the ambiguity functions are obtained, emphasising the cooperation between the waveform delay and the near-field phase shift information. The impact of estimating the range of an extended target with a point target model is analysed, showing that a model mismatch leads to severe performance degradation in the near-field region. Secondly, Cramer-Rao bounds are derived. Expressions emphasising the parameters' impact are obtained, the parameters being the carrier frequency, and the central frequency and root-mean-square bandwidth of the waveform. The near-field range information is shown to depend on the root-mean-square value of the propagation delay derivatives, this value scaling with the fourth power of the ratio between the antenna array dimension and the target range.

Radar targets are traditionally modelled as point target reflectors, even in the near-field region. Yet, for radar systems operating at high carrier frequencies and small distances, traditional radar propagation models do not accurately model the scatterer responses. In this paper, a novel electromagnetic-based model is thus developed for the multistatic radar detection of a rectangular plate reflector in the near-field region. This model is applied to an automotive scenario, in which a linear antenna array is spread out at the front of a vehicle, and performs a radar measurement of the distance to the back of the vehicle ahead. Based on the developed received signal model, the maximum likelihood estimator of the range is designed. By exploiting the near-field target model, this estimator is shown to provide a significant gain with respect to traditional range estimators. The impact of the system and scenario parameters, i.e. the carrier frequency, bandwidth and distance to the target, is furthermore evaluated. This analysis shows that the radar resolution in the near-field regime is improved at high carrier frequencies, while saturating to the traditional bandwidth-dependent resolution in the far-field region., Comment: This paper has been submitted to EUSIPCO 2024

This study proposes a novel stochastic geometry framework analyzing power control strategies in spatially correlated network topologies. Heterogeneous networks are studied, with users modeled via the superposition of homogeneous and Poisson cluster processes. First, a new expression approaching the distribution of the number of users per base station is provided. This distribution defines the load associated with each Vorono\"i cell, capturing non-uniformities in user locations and correlation to BSs positions. The power allocation is adjusted based on this load, allowing BSs to enter sleep mode when their activity falls below a defined threshold. Furthermore, the propagation model features millimeter wave transmission characteristics and directional beamforming. Considering these aspects, revisited definitions of coverage probability, spectral efficiency, and energy efficiency are proposed. Tractable expressions for these metrics are derived and validated using Monte-Carlo simulations. Asymptotic expressions are also proposed, providing further understanding on the influence of the system parameters. Our numerical results finally analyze the impact of the sleep control on the performance and display the optimal strategies in terms of energy efficiency., Comment: 15 pages, 9 figures

This paper presents a novel signal processing technique, coined grid hopping, as well as an active multistatic Frequency-Modulated Continuous Wave (FMCW) radar system designed to evaluate its performance. The design of grid hopping is motivated by two existing estimation algorithms. The first one is the indirect algorithm estimating ranges and speeds separately for each received signal, before combining them to obtain location and velocity estimates. The second one is the direct method jointly processing the received signals to directly estimate target location and velocity. While the direct method is known to provide better performance, it is seldom used because of its high computation time. Our grid hopping approach, which relies on interpolation strategies, offers a reduced computation time while its performance stays on par with the direct method. We validate the efficiency of this technique on actual FMCW radar measurements and compare it with other methods., Comment: Presented in ISCS23

In order to evaluate the performance of radar and communication systems in future wireless networks, accurate propagation models are needed to predict efficiently the received powers at each node, and draw correct conclusions. In this paper, we present new radar propagation models based on the electromagnetism theory. The target is modelled as a flat or curved square plate to compute the scattered field and derive accurate radar cross section modellings. With a flat square plate, the model makes the link between the radar equation and the geometrical optics propagation model used in ray-tracing applications. It is then applied to popular automotive scenarios within the stochastic geometry framework to observe the impact of such modelling.

The objective of this study is to analyze the statistics of the data rate and of the incident power density (IPD) in user-centric cell-free networks (UCCFNs). To this purpose, our analysis proposes a number of performance metrics derived using stochastic geometry (SG). On the one hand, the first moments and the marginal distribution of the IPD are calculated. On the other hand, bounds on the joint distributions of rate and IPD are provided for two scenarios: when it is relevant to obtain IPD values above a given threshold (for energy harvesting purposes), and when these values should instead remain below the threshold (for public health reasons). In addition to deriving these metrics, this work incorporates features related to UCCFNs which are new in SG models: a power allocation based on collective channel statistics, as well as the presence of potential overlaps between adjacent clusters. Our numerical results illustrate the achievable trade-offs between the rate and IPD performance. For the considered system, these results also highlight the existence of an optimal node density maximizing the joint distributions. (This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.)

The objective of this study is to jointly analyze the data rate and electromagnetic field (EMF) exposure in urban environments. Capitalizing on stochastic geometry (SG), a network level analysis is performed by modelling these environments via Manhattan Poisson line processes (MPLP). Using this framework, a number of performance metrics are derived: first moments, marginal distributions and joint distributions of the data rate and exposure. In addition, the original Manhattan model is generalized to include advanced features: corner diffraction, presence of potential blockages in streets, and users positioned at crossroads. As a second approach, deterministic ray tracing (RT) is utilized to compute the same metrics. The two methods are shown to provide close results on the condition that the model parameters are coherently selected. Furthermore, the numerical results enable to gain insight into several aspects: the role of the propagation mechanisms in the performance metrics, existing trade-offs between the rate and exposure requirements, as well as the impact of the user location (at a crossroad or in a single street). (This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible)

In this paper, multiple metrics are presented in order to jointly evaluate the performance of the radar and communication functions in scenarios involving Dual Function Radar Communication (DFRC) systems using stochastic geometry. These metrics are applied in an automotive scenario involving a two-lane road with vehicles and smart traffic lights, both equipped with DFRC systems. First, the performance achieved with these metrics are validated using Monte-Carlo (MC) simulations. Additionally, optimisation w.r.t. the power of the vehicles and smart traffic lights is performed based on the metrics. Then, the model is extended to include interference cancellation for the radar and/or communication function in all the metrics. Either full interference cancellation is applied, or a new model is proposed for imperfect interference cancellation., Comment: This paper will soon be submitted on IEEE Transactions

Estimation of User Terminals' (UTs') Angle of Arrival (AoA) plays a significant role in the next generation of wireless systems. Due to high demands, energy efficiency concerns, and scarcity of available resources, it is pivotal how these resources are used. Installed antennas and their corresponding hardware at the Base Station (BS) are of these resources. In this paper, we address the problem of antenna selection to minimize Cramer-Rao Lower Bound (CRLB) of a planar antenna array when fewer antennas than total available antennas have to be used for a UT. First, the optimal antenna selection strategy to minimize the expected CRLB is proposed. Then, using this strategy as a preliminary step, we present a two-stage greedy antenna selection method whose goal is to minimize the instantaneous CRLB. The optimal start point of the greedy algorithm is presented alongside some methods to reduce the algorithm's computational complexity. Numerical results confirm the accuracy of proposed solutions. They demonstrate that the proposed antenna selection method only requires a small proportion of the total available antennas to accomplish a significant amount of the total performance, enhancing hardware utilization efficiency. Also, it is shown that the presented algorithm has a high error tolerance.

In this paper, we consider a system model in conjunction with two major technologies in 5G communications, i.e., mobile edge computing and spectrum sharing. An IoT network, which does not have access to any licensed spectrum, carries its computational task offloading activities with help of spectrum sharing. The IoT network cooperates with a licensed spectrum holding network by relaying its data and in return gets access to the licensed spectrum. The licensed spectrum holding network focuses on throughput maximization, whereas, the IoT network tries to maximize task computation rate. We formulate an optimization problem giving importance to both networks' interests. Typical IoT nodes may be energy-constrained, which is considered along with task computation time constraints. Parallel computation is considered while computing IoT nodes' computational tasks at the mobile edge computing server, where the processor is allocated based on IoT nodes' offloading capabilities. The advantage of such processor allocation is shown in the result section. Moreover, we also show how both IoT and licensed spectrum holding networks benefit from the spectrum sharing by caring for each other requirements, which echoes the fact, i.e., Sharing is Caring.

This paper considers a joint transmission scheme (JT) developed for cloud radio access networks (C-RANs). This proposed scheme features cooperative sets of remote radio heads (RRH) defined in a disk around each user location. The nodes belonging to each of these sets perform a weighted maximum ratio transmission to jointly serve the user. The powers allocated to the beamformers are computed at the network baseband unit, taking into account channel gains, as well an equity criterion between the users. In comparison with the existing literature, our model includes a saturation assumption, with all transmissions taking place over the same resource block. A RRH belonging to multiple sets can hence transmit to several users simultaneously. The distributions of the network coverage and spectral efficiency are calculated by means of stochastic geometry (SG), and compared with Monte Carlo simulations. The derived expressions take into account the power allocation, the user and RRH densities, as well as the statistical correlation resulting from the set overlaps.

In this paper, we investigate the application of continuous sparse signal reconstruction algorithms for the estimation of the ranges and speeds of multiple moving targets using an FMCW radar. Conventionally, to be reconstructed, continuous sparse signals are approximated by a discrete representation. This discretization of the signal's parameter domain leads to mismatches with the actual signal. While increasing the grid density mitigates these errors, it dramatically increases the algorithmic complexity of the reconstruction. To overcome this issue, we propose a fast greedy algorithm for off-the-grid detection of multiple moving targets. This algorithm extends existing continuous greedy algorithms to the framework of factorized sparse representations of the signals. This factorized representation is obtained from simplifications of the radar signal model which, up to a model mismatch, strongly reduces the dimensionality of the problem. Monte-Carlo simulations of a K-band radar system validate the ability of our method to produce more accurate estimations with less computation time than the on-the-grid methods and than methods based on non-factorized representations., Comment: Accepted to ICASSP2021, Toronto, Canada, 6-11 June 2021

This paper considers the competitive resource allocation problem in Multiple-Input Multiple-Output (MIMO) interfering channels, when users maximize their energy efficiency. Considering each transmitter-receiver pair as a selfish player, conditions on the existence and uniqueness of the Nash equilibrium of the underlying noncooperative game are obtained. A decentralized asynchronous algorithm is proven to converge towards this equilibrium under the same conditions. Two frameworks are considered for the analysis of this game. On the one hand, the game is rephrased as a Quasi-Variational Inequality (QVI). On the other hand, the best response of the players is analyzed in light of the contraction mappings. For this problem, the contraction approach is shown to lead to tighter results than the QVI one. When specializing the obtained results to OFDM networks, the obtained conditions appear to significantly outperform state-of-the-art works, and to lead to much simpler decentralized algorithms. Numerical results finally assess the obtained conditions in different settings.

In this paper we propose to bridge the gap between using extremely low resolution 1-bit measurements and estimating targets' parameters, such as their velocities, that exist in a continuum, i.e., by performing Off-the-Grid estimation. To that end, a Continuous version of Orthogonal Matching Pursuit (COMP) is modified in order to leverage the 1-bit measurements coming from a simple Doppler Radar. Using Monte-Carlo simulations, we show that although the resolution of the acquisition is dramatically reduced, velocity estimation of multiple targets can still be achieved and reaches performances beyond classic On-the-Grid methods. Furthermore, we show empirically that adding a random and uniform dithering before the quantization is necessary when estimating more than one target., Comment: Submitted to RadarConf2021

We consider a relay network based on Unmanned Aerial Vehicles (UAV). Terrestrial Base Stations (TBS) and UAV Relay Nodes (RN) are modelled using two Homogeneous Poisson Point Processes (HPPP). UAVs can hover at a fixed position or move following specific displacement schemes. The Coverage Probability (CP) of a typical user equipment (UE) is derived, either when it communicates via a direct link (from the TBS to the UE) or via a relay link (from the TBS to the UE through a UAV RN). Every link can be in Line-of-Sight (LoS) or Non Line-of-Sight (NLoS), and suffers from Rician fading with distance-dependent parameters. This coverage is calculated by means of both stochastic geometry (SG) and Monte-Carlo (MC) simulations. The benefits of the use of UAV as RNs are analysed depending on their altitude, density, and mobility scheme., Comment: 10 pages, 4 figures. Complete technical paper, associated with a submission at the 2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring) (https://events.vtsociety.org/vtc2021-spring/) with DOI https://doi.org/10.1109/VTC2021-Spring51267.2021.9448745 First version published on Arxiv on 13/10/2020, added to IEEE Xplore on 15/06/2021

This work focuses on the reconstruction of sparse signals from their 1-bit measurements. The context is the one of 1-bit compressive sensing where the measurements amount to quantizing (dithered) random projections. Our main contribution shows that, in addition to the measurement process, we can additionally reconstruct the signal with a binarization of the sensing matrix. This binary representation of both the measurements and sensing matrix can dramatically simplify the hardware architecture on embedded systems, enabling cheaper and more power efficient alternatives. Within this framework, given a sensing matrix respecting the restricted isometry property (RIP), we prove that for any sparse signal the quantized projected back-projection (QPBP) algorithm achieves a reconstruction error decaying like O(m-1/2)when the number of measurements m increases. Simulations highlight the practicality of the developed scheme for different sensing scenarios, including random partial Fourier sensing., Comment: ITWIST 2020

We propose a fast greedy algorithm to compute sparse representations of signals from continuous dictionaries that are factorizable, i.e., with atoms that can be separated as a product of sub-atoms. Existing algorithms strongly reduce the computational complexity of the sparse decomposition of signals in discrete factorizable dictionaries. On another flavour, existing greedy algorithms use interpolation strategies from a discretization of continuous dictionaries to perform off-the-grid decomposition. Our algorithm aims to combine the factorization and the interpolation concepts to enable low complexity computation of continuous sparse representation of signals. The efficiency of our algorithm is highlighted by simulations of its application to a radar system., Comment: in Proceedings of iTWIST'20, Paper-ID: 45, Nantes, France, December, 2-4, 2020

This paper considers uplink multiple access (MA) transmissions, where the MA technique is adaptively selected between Non Orthogonal Multiple Access (NOMA) and Orthogonal Multiple Access (OMA). Two types of users, namely Internet of Things (IoT) and enhanced mobile broadband (eMBB) coexist with different metrics to be optimized, energy efficiency (EE) for IoT and spectral efficiency (SE) for eMBB. The corresponding multi-objective power allocation problems aiming at maximizing a weighted sum of EE and SE are solved for both NOMA and OMA. Based on the identification of the best MA strategy, a clustering algorithm is then proposed to maximize the multi-objective metric per cluster as well as NOMA use. The proposed clustering, power allocation and MA selection algorithm is shown to outperform other clustering solutions and non-adaptive MA techniques.

Non Orthogonal Multiple Access (NOMA) is a key technique to satisfy large users densities in future wireless networks. However, NOMA may provide poor performance compared to Orthogonal Multiple Access (OMA) due to inter-user interference. In this paper, we obtain closed-form expressions of the uplink NOMA and OMA throughputs when no Channel State Information at Transmitter (CSIT) is available, and of the average data rates assuming that instantaneous rates should be larger than a minimum threshold when full CSIT is available. Analytical comparisons of OMA and NOMA prove that there is no global dominant strategy valid in all situations. Based on this conclusion, we propose a new multiple-access (MA) strategy called NOMA-Adaptive (NOMA-A) that selects the best MA technique between OMA and NOMA. NOMA-A aims at maximizing the sum throughput in the no CSIT case, and the probability that both users are active in the full CSIT case. NOMA-A is shown to outperform the other strategies in terms of sum throughput and rate., Comment: Submitted to IEEE Transactions on Wireless Communications

Motivated by applications such as on-device collaborative neural network inference, this work investigates edge-facilitated collaborative fog computing - in which edge-devices collaborate with each other and with the edge of the network to complete a processing task - to augment the computing capabilities of individual edge-devices while optimizing the collaboration for energy-efficiency. Collaborative computing is modeled using the Map-Reduce distributed computing framework, consisting in two rounds of computations separated by a communication phase. The computing load is optimally distributed among the edge-devices, taking into account their diversity in term of computing and communications capabilities. In addition, edge-devices local parameters such as CPU clock frequency and RF transmit power are also optimized for energy-efficiency. The corresponding optimization problem can be shown to be convex and optimality conditions can be obtained through Lagrange duality theory. A waterfilling-like interpretation for the size of the computing load assigned to each edge-device is given. Numerical experiments demonstrate the benefits of the proposed optimal collaborative-computing scheme over various other schemes in several respects. Most notably, the proposed scheme exhibits increased probability of successfully dealing with heavier computations and/or smaller latency along with energy-efficiency gains of up to two orders of magnitude. Both improvements come from the scheme ability to optimally leverage edge-devices diversity., Comment: To be submitted to Transactions on Wireless Communications

In the next generation of wireless systems, Massive MIMO offers high angular resolution for localization. By virtue of large number of antennas, the Angle of Arrival (AoA) of User Terminals (UTs) can be estimated with high accuracy. According to Dense Multipath Component (DMC) channel model, local scatters around UTs can create different multipath signals for each antenna at the Base Station (BS). We obtain a deterministic form for the Cramer-Rao Lower Bound (CRLB) in a multi-user scenario when the contribution of the multipath signals is considered. We do this when the multipath signals are independent and identically distributed (i.i.d) with arbitrary distribution. Then, we redefine a localization efficiency function for a multi-user scenario and numerically optimize it with respect to (w.r.t) the number of antennas. We prove when only a subset of the available antennas is used, CRLB can be minimized w.r.t which set of antennas is used. Then, an antenna selection strategy that minimizes CRLB is proposed. As a benchmark, we apply the proposed antenna selection scheme to the MUltiple SIgnal Classification (MUSIC) algorithm and study its efficiency. Numerical results validate the accuracy of our analysis and show significant improvement in efficiency when the proposed antenna selection strategy is employed., Comment: 29 pages, 7 figures

An ultra-wide bandwidth (UWB) remote-powered positioning system for potential use in tracking floating objects inside space stations is presented. It makes use of battery-less tags that are powered-up and addressed through wireless power transfer in the UHF band and embed an energy efficient pulse generator in the 3-5 GHz UWB band. The system has been mounted on the ESA Mars Rover prototype to demonstrate its functionality and performance. Experimental results show the feasibility of centimeter-level localization accuracy at distances larger than 10 meters, with the capability of determining the position of multiple tags using a 2W-ERP power source in the UHF RFID frequency band., Comment: Published in: 2019 IEEE International Conference on RFID Technology and Applications (RFID-TA)

We investigate the problem of sparse target detection from widely distributed multistatic \textit{Frequency Modulated Continuous Wave} (FMCW) radar systems (using chirp modulation). Unlike previous strategies (\emph{e.g.}, developed for FMCW or distributed multistatic radars), we propose a generic framework that scales well in terms of computational complexity for high-resolution space-velocity grid. Our approach assumes that \emph{(i)} the target signal is sparse in a discrete space-velocity domain, hence allowing for non-static target detection, and \emph{(ii)} the resulting multiple baseband radar signals share a common support. By simplifying the representation of the FMCW radar signals, we propose a versatile scheme balancing complexity and detection accuracy. In particular, we design a low-complexity, factorized alternative for the Matching Pursuit algorithm leveraging this simplified model, as well as an iterative methodology to compensate for the errors caused by the model simplifications. Extensive Monte-Carlo simulations of a K-band radar system show that our method achieves a fast estimation of moving target's parameters on dense grids, with controllable accuracy, and reaching state-of-the-art performances compared to previous sparsity-driven approaches., Comment: in Proceedings of IEEE CAMSAP 2019, Le Gosier, France, December, 15-18, 2019, 4 pages, 4 figures

This letter analyzes the performances of a simple reconstruction method, namely the Projected Back-Projection (PBP), for estimating the direction of a sparse signal from its phase-only (or amplitude-less) complex Gaussian random measurements, i.e., an extension of one-bit compressive sensing to the complex field. To study the performances of this algorithm, we show that complex Gaussian random matrices respect, with high probability, a variant of the Restricted Isometry Property (RIP) relating to the l1 -norm of the sparse signal measurements to their l2 -norm. This property allows us to upper-bound the reconstruction error of PBP in the presence of phase noise. Monte Carlo simulations are performed to highlight the performance of our approach in this phase-only acquisition model when compared to error achieved by PBP in classical compressive sensing., Comment: 4 pages, 2 figures

In this paper, we propose an online power allocation scheme to maximize the time averaged sum rate for multiple downlink receivers with energy harvesting transmitter. The transmitter employs non-orthogonal multiple access (NOMA) and/or orthogonal multiple access (OMA) to transmit data to multiple users. Additionally, we consider the scenario where each individual user has a quality of service constraint on its required instantaneous rate. The decisions of total transmit power and power allocation for different users in a given time slot are obtained with the help of Lyapunov optimization technique. The proposed schemes do not require any statistical information of the channel states and the harvested energy. The proposed power allocation schemes entail in small complexity based power allocation decisions. Therefore, the proposed schemes can provide solutions in real time and are more suited for online power allocation problems where the system state parameters (e.g. channel state, harvested energy etc) change quickly. The performances of the proposed schemes are demonstrated with the help of simulation results.

A sum inverse energy efficiency (SIEE) minimization problem is solved. Compared with conventional sum energy efficiency (EE) maximization problems, minimizing SIEE achieves a better fairness. The paper begins by proposing a framework for solving sum-fraction minimization (SFMin) problems, then uses a novel transform to solve the SIEE minimization problem in a multiple base station (BS) system. After the reformulation into a multi-convex problem, the alternating direction method of multipliers (ADMM) is used to further simplify the problem. Numerical results confirm the efficiency of the transform and the fairness improvement of the SIEE minimization. Simulation results show that the algorithm convergences fast and the ADMM method is efficient.

In this paper, we consider hybrid beamforming designs for multiuser massive multiple-input multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) systems. Aiming at maximizing the weighted spectral efficiency, we propose one alternating maximization framework where the analog precoding is optimized by Riemannian manifold optimization. If the digital precoding is optimized by a locally optimal algorithm, we obtain a locally optimal alternating maximization algorithm. In contrast, if we use a weighted minimum mean square error (MMSE)-based iterative algorithm for digital precoding, we obtain a suboptimal alternating maximization algorithm with reduced complexity in each iteration. By characterizing the upper bound of the weighted arithmetic and geometric means of mean square errors (MSEs), it is shown that the two alternating maximization algorithms have similar performance when the user specific weights do not have big differences. Verified by numerical results, the performance gap between the two alternating maximization algorithms becomes large when the ratio of the maximal and minimal weights among users is very large. Moreover, we also propose a low-complexity closed-form method without iterations. It employs matrix decomposition for the analog beamforming and weighted MMSE for the digital beamforming. Although it is not supposed to maximize the weighted spectral efficiency, it exhibits small performance deterioration compared to the two iterative alternating maximization algorithms and it qualifies as a good initialization for iterative algorithms, saving thereby iterations., Comment: 34 pages, 7 figures

In this work, a heterogeneous set of wireless devices sharing a common access point collaborates to perform a set of tasks. Using the Map-Reduce distributed computing framework, the tasks are optimally distributed amongst the nodes with the objective of minimizing the total energy consumption of the nodes while satisfying a latency constraint. The derived optimal collaborative-computing scheme takes into account both the computing capabilities of the nodes and the strength of their communication links. Numerical simulations illustrate the benefits of the proposed optimal collaborative-computing scheme over a blind collaborative-computing scheme and the non-collaborative scenario, both in term of energy savings and achievable latency. The proposed optimal scheme also exhibits the interesting feature of allowing to trade energy for latency, and vice versa., Comment: 5 pages, 5 figures, submitted to SPAWC19

In this paper, we further expand on the work in [1] that focused on the localization of targets in a 2D space using 1-bit dithered measurements coming from a 2 receiving antennae radar. Our aim is to further reduce the hardware requirements and bit-rate, by dropping one of the baseband IQ channel from each receiving antenna. To that end, the structure of the received signals is exploited to recover the positions of multiple targets. Simulations are performed to highlight the accuracy and limitations of the proposed scheme under severe bit-rate reduction., Comment: in Proceedings of iTWIST'18, Paper-ID: 29, Marseille, France, November, 21-23, 2018

In this paper, we investigate a trade-off between the number of radar observations (or measurements) and their resolution in the context of radar range estimation. To this end, we introduce a novel estimation scheme that can deal with strongly quantized received signals, going as low as 1-bit per signal sample. We leverage for this a dithered quantized compressive sensing framework that can be applied to classic radar processing and hardware. This allows us to remove ambiguous scenarios prohibiting correct range estimation from (undithered) quantized base-band radar signal. Two range estimation algorithms are studied: Projected Back Projection (PBP) and Quantized Iterative Hard Thresholding (QIHT). The effectiveness of the reconstruction methods combined with the dithering strategy is shown through Monte Carlo simulations. Furthermore we show that: (i), in dithered quantization, the accuracy of target range estimation improves when the bit-rate (i.e., the total number of measured bits) increases, whereas the accuracy of other undithered schemes saturate in this case; and (ii), for fixed, low bit-rate scenarios, severely quantized dithered schemes exhibit better performances than their full resolution counterparts. These observations are confirmed using real measurements obtained in a controlled environment, demonstrating the feasibility of the method in real ranging applications., Comment: Submitted to RadarConf2019 as an invited paper

Driven by the Internet of Things vision, recent years have seen the rise of new horizons for the wireless ecosystem in which a very large number of mobile low power devices interact to run sophisticated applications. The main hindrance to the massive deployment of low power nodes is most probably the prohibitive maintenance cost of battery replacement and the ecotoxicity of the battery production/end-of-life. An emerging research direction to avoid battery replacement is the combination of radio frequency energy harvesting and mobile computing (MC). In this paper, we propose the use of simultaneous information and power transfer (SWIPT) to control the distributed computation process while delivering power to perform the computation tasks requested. A real-time MC system is considered, meaning that the trade-off between the information rate and the energy harvested must be carefully chosen to guarantee that the CPU may perform tasks of given complexity before receiving a new control signal. In order to provide a system-level perspective on the performance of SWIPT-MC networks, we propose a mathematical framework based on stochastic geometry to characterise the rate-energy trade-off of the system. The resulting achievable performance region is then put in relation with the CPU energy consumption to investigate the operating conditions of real-time computing systems. Finally, numerical results illustrate the joint effect of the network densification and the propagation environment on the optimisation of the CPU usage.

We present a novel scheme allowing for 2D target localization using highly quantized 1-bit measurements from a Frequency Modulated Continuous Wave (FMCW) radar with two receiving antennas. Quantization of radar signals introduces localization artifacts, we remove this limitation by inserting a dithering on the unquantized observations. We then adapt the projected back projection algorithm to estimate both the range and angle of targets from the dithered quantized radar observations, with provably decaying reconstruction error when the number of observations increases. Simulations are performed to highlight the accuracy of the dithered scheme in noiseless conditions when compared to the non-dithered and full 32-bit resolution under severe bit-rate reduction. Finally, measurements are performed using a radar sensor to demonstrate the effectiveness and performances of the proposed quantized dithered scheme in real conditions., Comment: 10 pages, 15 figures

Simultaneous information and power transfer (SWIPT) is characterised by the ambiguous role of multi-user interference. In short, the beneficial effect of multi-user interference on RF energy harvesting is obtained at the price of a reduced link capacity, thus originating nontrivial trade-offs between the achievable information rate and the harvestable energy. Arguably, in indoor environments, this trade-off might be affected by the propagation loss due to blockage objects like walls. Hence, a couple of fundamental questions arise. How much must the network elements be densified to counteract the blockage attenuation? Is blockage always detrimental on the achievable rate-energy trade-off? In this paper, we analyse the performance of an indoor multiple-input multiple-output (MIMO) SWIPT-enabled network in the attempt to shed a light of those questions. The effects of the obstacles are examined with the help of a stochastic approach in which energy transmitters (also referred to as power heads) are located by using a Poisson Point Process and walls are generated through a Manhattan Poisson Line Process. The stochastic behaviour of the signal attenuation and the multi-user interference is studied to obtain the Joint Complementary Cumulative Distribution Function (J-CCDF) of information rate and harvested power. Theoretical results are validated through Monte Carlo simulations. Eventually, the rate-energy trade-off is presented as a function of the frequency of walls to emphasise the cross-dependences between the deployment of the network elements and the topology of the venue.

In this paper, we consider a fog computing system consisting of a multi-antenna access point (AP), an ultra-low power (ULP) single antenna device and a fog server. The ULP device is assumed to be capable of both energy harvesting (EH) and information decoding (ID) using a time-switching simultaneous wireless information and power transfer (SWIPT) scheme. The ULP device deploys the harvested energy for ID and either local computing or offloading the computations to the fog server depending on which strategy is most energy efficient. In this scenario, we optimize the time slots devoted to EH, ID and local computation as well as the time slot and power required for the offloading to minimize the energy cost of the ULP device. Numerical results are provided to study the effectiveness of the optimized fog computing system and the relevant challenges.

This paper proposes a novel joint channel estimation and beamforming approach for multicell wideband massive multiple input multiple output (MIMO) systems. With the proposed channel estimation and beamforming approach, we determine the number of cells $N_c$ that can utilize the same time and frequency resource while mitigating the effect of pilot contamination. The proposed approach exploits the multipath characteristics of wideband channels. Specifically, when the channel has a maximum of $L$ multipath taps, \textcolor{red}{it is shown that $N_c\leq L$ cells can estimate the channels of their user equipments (UEs) and perform beamforming while mitigating the effect of pilot contamination.} In a typical long term evolution (LTE) channel environment having delay spread $T_d=4.69\mu$ second and channel bandwidth $B=2.5$MHz, we have found that $L=18$ cells can use this band. In practice, $T_d$ is constant for a particular environment and carrier frequency, and hence $L$ increases as the bandwidth increases. All the analytical expressions have been validated, and the superiority of the proposed design over the existing ones is demonstrated using extensive numerical simulations both for correlated and uncorrelated channels. The proposed channel estimation and beamforming design is linear and simple to implement., Comment: IEEE

This paper proposes a novel and simple orthogonal faster than Nyquist (OFTN) data transmission and detection approach for a single input multiple output (SIMO) system. It is assumed that the signal having a bandwidth $B$ is transmitted through a wireless channel with $L$ multipath components. Under this assumption, the current paper provides a novel and simple OFTN transmission and symbol-by-symbol detection approach that exploits the multiplexing gain obtained by the multipath characteristic of wideband wireless channels. It is shown that the proposed design can achieve a higher transmission rate than the existing one (i.e., orthogonal frequency division multiplexing (OFDM)). Furthermore, the achievable rate gap between the proposed approach and that of the OFDM increases as the number of receiver antennas increases for a fixed value of $L$. This implies that the performance gain of the proposed approach can be very significant for a large-scale multi-antenna wireless system. The superiority of the proposed approach is shown theoretically and confirmed via numerical simulations. {Specifically, we have found {upper-bound average} rates of 15 bps/Hz and 28 bps/Hz with the OFDM and proposed approaches, respectively, in a Rayleigh fading channel with 32 receive antennas and signal to noise ratio (SNR) of 15.3 dB. The extension of the proposed approach for different system setups and associated research problems is also discussed., Comment: IEEE Transactions on Wireless Communications

In this paper, we consider a time-switching (TS) co-located simultaneous wireless information and power transfer (SWIPT) system consisting of multiple multi-antenna access points which serve multiple single antenna users. In this scenario, we propose a multi-objective optimization (MOO) framework to design jointly the Pareto optimal beamforming vector and the TS ratio for each receiver. The objective is to maximize the utility vector including the achieved data rates and the harvested energies of all users simultaneously. This problem is a non-convex rank-constrained MOO problem which is relaxed and transformed into a non-convex semidefinite program (SDP) based on the weighted Chebycheff method. The majorization-minimization algorithm is utilized to solve the nonconvex SDP and the optimal solution is proved to satisfy the rank constraint. We also study the problem of optimizing the beamforming vectors in a fixed TS ratio scenario with the same approach. Numerical results are provided for two coordinated access points with MISO configuration. The results illustrate the trade-off between harvested energy and information data rate objectives and show the effect of optimizing the precoding strategy and TS ratio on this trade-off.

In parameter estimation, assumptions about the model are typically considered which allow us to build optimal estimation methods under many statistical senses. However, it is usually the case where such models are inaccurately known or not capturing the complexity of the observed phenomenon. A natural question arises to whether we can find fundamental estimation bounds under model mismatches. This paper derives a general bound on the mean square error (MSE) following the Ziv-Zakai methodology for the widely used additive Gaussian model. The general result accounts for erroneous functionals, hyperparameters, and distributions differing from the Gaussian. The result is then particularized to gain some insight into specific problems and some illustrative examples demonstrate the predictive capabilities of the bound., Comment: Submitted for publication in the IEEE Transactions on Signal Processing

This paper proposes novel joint channel estimation and beamforming approach for multicell wideband massive multiple input multiple output (MIMO) systems. Using our channel estimation and beamforming approach, we determine the number of cells $N_c$ that can utilize the same time and frequency resource while mitigating the effect of pilot contamination. The proposed approach exploits the multipath characteristics of wideband channels. Specifically, when the channel has $L$ multipath taps, it is shown that $N_c\leq L$ cells can reliably estimate the channels of their user equipments (UEs) and perform beamforming while mitigating the effect of pilot contamination. For example, in a long term evolution (LTE) channel environment having delay spread $T_d=4.69\mu$ second and channel bandwidth $B=2.5$MHz, we have found that $L=18$ cells can use this band. In practice, $T_d$ is constant for a particular environment and carrier frequency, and hence $L$ increases as the bandwidth increases. The proposed channel estimation and beamforming design is linear, simple to implement and significantly outperforms the existing designs, and is validated by extensive simulations., Comment: IEEE Globecom 2015 (Accepted)

This paper studies an energy efficient design of precoders for point-to-point multiple-input-multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems. Differently from traditional approaches, the optimal power allocation strategy is studied by modelling the circuit power as a rate-dependent function. We show that if the circuit power is a constant plus an increasing and convex function of the transmission rate, the problem of minimizing the consumed energy per bit received can be reformulated as a convex fractional program and solved by means of a bisection algorithm. The impact of the some system parameters is investigated either analytically or by means of computational results.

This paper considers wide-band spectrum sensing and optimization for cognitive radio (CR) networks with noise variance uncertainty. It is assumed that the considered wide-band contains one or more white sub-bands. Under this assumption, we consider throughput maximization of the CR network while appropriately protecting the primary network. We address this problem as follows. First, we propose novel ratio based test statistics for detecting the edges of each sub-band. Second, we employ simple energy comparison approach to choose one reference white sub-band. Third, we propose novel generalized energy detector (GED) for examining each of the remaining sub-bands by exploiting the noise information of the reference white sub-band. Finally, we optimize the sensing time ($T_o$) to maximize the CR network throughput using the detection and false alarm probabilities of the GED. The proposed GED does not suffer from signal to noise ratio (SNR) wall and outperforms the existing signal detectors. Moreover, the relationship between the proposed GED and conventional energy detector (CED) is quantified analytically. We show that the optimal $T_o$ depends on the noise variance information. In particular, with $10$TV bands, SNR=$-20$dB and $2$s frame duration, we found that the optimal $T_o$ is $28.5$ms ($50.6$ms) with perfect (imperfect) noise variance scenario., Comment: Submitted to IEEE Transactions on Communications (Revised version)

This paper considers hybrid beamforming (HB) for downlink multiuser massive multiple input multiple output (MIMO) systems with frequency selective channels. For this system, first we determine the required number of radio frequency (RF) chains and phase shifters (PSs) such that the proposed HB achieves the same performance as that of the digital beamforming (DB) which utilizes $N$ (number of transmitter antennas) RF chains. We show that the performance of the DB can be achieved with our HB just by utilizing $r_t$ RF chains and $2r_t(N-r_t + 1)$ PSs, where $r_t \leq N$ is the rank of the combined digital precoder matrices of all sub-carriers. Second, we provide a simple and novel approach to reduce the number of PSs with only a negligible performance degradation. Numerical results reveal that only $20-40$ PSs per RF chain are sufficient for practically relevant parameter settings. Finally, for the scenario where the deployed number of RF chains $(N_a)$ is less than $r_t$, we propose a simple user scheduling algorithm to select the best set of users in each sub-carrier. Simulation results validate theoretical expressions, and demonstrate the superiority of the proposed HB design over the existing HB designs in both flat fading and frequency selective channels., Comment: IEEE Transactions on Wireless Communications (Minor Revision)

In this paper, we consider a system in which multiple users communicate with a destination with the help of multiple half-duplex relays. Based on the compute-and-forward scheme, each relay, instead of decoding the users' messages, decodes an integer-valued linear combination that relates the transmitted messages. Then, it forwards the linear combination towards the destination. Given these linear combinations, the destination may or may not recover the transmitted messages since the linear combinations are not always full rank. Therefore, we propose an algorithm where we optimize the precoding factor at the users such that the probability that the equations are full rank is increased and that the transmission rate is maximized. We show, through some numerical examples, the effectiveness of our algorithm and the advantage of performing precoding allocation at the users. Also, we show that this scheme can outperform standard relaying techniques in certain regimes.

We consider two transceivers, the first with perfect clock and the second with imperfect clock. We investigate the joint estimation of the delay between the transceivers and the offset and the drift of the imperfect clock. We propose a protocol for the synchronization of the clocks. We derive some empirical estimators for the delay, the offset and the drift, and compute the Cramer-Rao lower bounds and the joint maximum likelihood estimator of the delay and the drift. We study the impact of the protocol parameters and the time-of-arrival estimation variance on the achieved performances. We validate some theoretical results by simulation., Comment: Accepted and published in the IEEE ICC 2014 conference