arXiv subjects

Marco Di Renzo

Publications and source records attributed to Marco Di Renzo.

298 records · Page 17Linked to original sources

arXiv2014

Outage Probability of Dual-Hop Selective AF With Randomly Distributed and Fixed Interferers

The outage probability performance of a dual-hop amplify-and-forward selective relaying system with global relay selection is analyzed for Nakagami-$m$ fading channels in the presence of multiple interferers at both the relays and the destination. Two different cases are considered. In the first case, the interferers are assumed to have random number and locations. Outage probability using the generalized Gamma approximation (GGA) in the form of one-dimensional integral is derived. In the second case, the interferers are assumed to have fixed number and locations. Exact outage probability in the form of one-dimensional integral is derived. For both cases, closed-form expressions of lower bounds and asymptotic expressions for high signal-to-interference-plus-noise ratio are also provided. Simplified closed-form expressions of outage probability for special cases (e.g., dominant interferences, i.i.d. interferers, Rayleigh distributed signals) are studied. Numerical results are presented to show the accuracy of our analysis by examining the effects of the number and locations of interferers on the outage performances of both AF systems with random and fixed interferers.

cs.NI↗

arXiv2014

Cross-layer Theoretical Analysis of NC-aided Cooperative ARQ Protocols in Correlated Shadowed Environments (Extended Version)

In this paper, we propose a cross-layer analytical model for the study of Network Coding (NC)-based Automatic Repeat reQuest (ARQ) Medium Access Control (MAC) protocols in correlated slow faded (shadowed) environments, where two end nodes are assisted by a cluster of relays to exchange data packets. The goal of our work is threefold: i) to provide general Physical (PHY) layer theoretical expressions for estimating crucial network parameters (i.e., network outage probability and expected size of the active relay set), applicable in two-way communications, ii) to demonstrate how these expressions are incorporated in theoretical models of the upper layers (i.e., MAC), and iii) to study the performance of a recently proposed NC-aided Cooperative ARQ (NCCARQ) MAC protocol under correlated shadowing conditions. Extensive Monte Carlo experiments have been carried out to validate the efficiency of the developed analytical model and to investigate the realistic performance of NCCARQ. Our results indicate that the number of active relays is independent of the shadowing correlation in the wireless links and reveal intriguing trade-offs between throughput and energy efficiency, highlighting the importance of cross-layer approaches for the assessment of cooperative MAC protocols.

cs.NI↗

arXiv2013

Generalised Sphere Decoding for Spatial Modulation

In this paper, Sphere Decoding (SD) algorithms for Spatial Modulation (SM) are developed to reduce the computational complexity of Maximum-Likelihood (ML) detectors. Two SDs specifically designed for SM are proposed and analysed in terms of Bit Error Ratio (BER) and computational complexity. Using Monte Carlo simulations and mathematical analysis, it is shown that by carefully choosing the initial radius the proposed sphere decoder algorithms offer the same BER as ML detection, with a significant reduction in the computational complexity. A tight closed form expression for the BER performance of SM-SD is derived in the paper, along with an algorithm for choosing the initial radius which provides near to optimum performance. Also, it is shown that none of the proposed SDs are always superior to the others, but the best SD to use depends on the target spectral efficiency. The computational complexity trade-off offered by the proposed solutions is studied via analysis and simulation, and is shown to validate our findings. Finally, the performance of SM-SDs are compared to Spatial Multiplexing (SMX) applying ML decoder and applying SD. It is shown that for the same spectral efficiency, SM-SD offers up to 84% reduction in complexity compared to SMX-SD, with up to 1 dB better BER performance than SMX-ML decoder.

cs.IT↗

arXiv2013

Performance of Spatial Modulation using Measured Real-World Channels

In this paper, for the first time real-world channel measurements are used to analyse the performance of spatial modulation (SM), where a full analysis of the average bit error rate performance (ABER) of SM using measured urban correlated and uncorrelated Rayleigh fading channels is provided. The channel measurements are taken from an outdoor urban multiple input multiple output (MIMO) measurement campaign. Moreover, ABER performance results using simulated Rayleigh fading channels are provided and compared with a derived analytical bound for the ABER of SM, and the ABER results for SM using the measured urban channels. The ABER results using the measured urban channels validate the derived analytical bound and the ABER results using the simulated channels. Finally, the ABER of SM is compared with the performance of spatial multiplexing (SMX) using the measured urban channels for small and large scale MIMO. It is shown that SM offers nearly the same or a slightly better performance than SMX for small scale MIMO. However, SM offers large reduction in ABER for large scale MIMO.

cs.IT↗

arXiv2013

Average Rate of Downlink Heterogeneous Cellular Networks over Generalized Fading Channels - A Stochastic Geometry Approach

In this paper, we introduce an analytical framework to compute the average rate of downlink heterogeneous cellular networks. The framework leverages recent application of stochastic geometry to other-cell interference modeling and analysis. The heterogeneous cellular network is modeled as the superposition of many tiers of Base Stations (BSs) having different transmit power, density, path-loss exponent, fading parameters and distribution, and unequal biasing for flexible tier association. A long-term averaged maximum biased-received-power tier association is considered. The positions of the BSs in each tier are modeled as points of an independent Poisson Point Process (PPP). Under these assumptions, we introduce a new analytical methodology to evaluate the average rate, which avoids the computation of the Coverage Probability (Pcov) and needs only the Moment Generating Function (MGF) of the aggregate interference at the probe mobile terminal. The distinguishable characteristic of our analytical methodology consists in providing a tractable and numerically efficient framework that is applicable to general fading distributions, including composite fading channels with small- and mid-scale fluctuations. In addition, our method can efficiently handle correlated Log-Normal shadowing with little increase of the computational complexity. The proposed MGF-based approach needs the computation of either a single or a two-fold numerical integral, thus reducing the complexity of Pcov-based frameworks, which require, for general fading distributions, the computation of a four-fold integral.

cs.IT↗

arXiv2013

Error Performance and Diversity Analysis of Multi-Source Multi-Relay Wireless Networks with Binary Network Coding and Cooperative MRC

In this paper, we contribute to the theoretical understanding, the design, and the performance evaluation of multi-source multi-relay network-coded cooperative diversity protocols. These protocols are useful to counteract the spectral inefficiency of repetition-based cooperation. We provide a general analytical framework for analysis and design of wireless networks using the Demodulate-and-Forward (DemF) protocol with binary Network Coding (NC) at the relays and Cooperative Maximal Ratio Combining (C-MRC) at the destination. Our system model encompasses an arbitrary number of relays which offer two cooperation levels: i) full-cooperative relays, which postpone the transmission of their own data frames to help the transmission of the sources via DemF relaying and binary NC; and ii) partial-cooperative relays, which exploit NC to transmit their own data frames along with the packets received from the sources. The relays can apply NC on different subsets of sources, which is shown to provide the sources with unequal diversity orders. Guidelines to choose the packets to be combined, i.e., the network code, to achieve the desired diversity order are given. Our study shows that partial-cooperative relays provide no contribution to the diversity order of the sources. Theoretical findings and design guidelines are validated through extensive Monte Carlo simulations.

cs.IT↗

arXiv2012

On the Diversity Order and Coding Gain of Multi-Source Multi-Relay Cooperative Wireless Networks with Binary Network Coding

In this paper, a multi-source multi-relay cooperative wireless network with binary modulation and binary network coding is studied. The system model encompasses: i) a demodulate-and-forward protocol at the relays, where the received packets are forwarded regardless of their reliability; and ii) a maximum-likelihood optimum demodulator at the destination, which accounts for possible demodulations errors at the relays. An asymptotically-tight and closed-form expression of the end-to-end error probability is derived, which clearly showcases diversity order and coding gain of each source. Unlike other papers available in the literature, the proposed framework has three main distinguishable features: i) it is useful for general network topologies and arbitrary binary encoding vectors; ii) it shows how network code and two-hop forwarding protocol affect diversity order and coding gain; and ii) it accounts for realistic fading channels and demodulation errors at the relays. The framework provides three main conclusions: i) each source achieves a diversity order equal to the separation vector of the network code; ii) the coding gain of each source decreases with the number of mixed packets at the relays; and iii) if the destination cannot take into account demodulation errors at the relays, it loses approximately half of the diversity order.

cs.IT↗

arXiv2012

Diversity, Coding, and Multiplexing Trade-Off of Network-Coded Cooperative Wireless Networks

In this paper, we study the performance of network-coded cooperative diversity systems with practical communication constraints. More specifically, we investigate the interplay between diversity, coding, and multiplexing gain when the relay nodes do not act as dedicated repeaters, which only forward data packets transmitted by the sources, but they attempt to pursue their own interest by forwarding packets which contain a network-coded version of received and their own data. We provide a very accurate analysis of the Average Bit Error Probability (ABEP) for two network topologies with three and four nodes, when practical communication constraints, i.e., erroneous decoding at the relays and fading over all the wireless links, are taken into account. Furthermore, diversity and coding gain are studied, and advantages and disadvantages of cooperation and binary Network Coding (NC) are highlighted. Our results show that the throughput increase introduced by NC is offset by a loss of diversity and coding gain. It is shown that there is neither a coding nor a diversity gain for the source node when the relays forward a network-coded version of received and their own data. Compared to other results available in the literature, the conclusion is that binary NC seems to be more useful when the relay nodes act only on behalf of the source nodes, and do not mix their own packets to the received ones. Analytical derivation and findings are substantiated through extensive Monte Carlo simulations.

cs.IT↗

arXiv2012

Space Shift Keying (SSK-) MIMO with Practical Channel Estimates

In this paper, we study the performance of space modulation for Multiple-Input-Multiple-Output (MIMO) wireless systems with imperfect channel knowledge at the receiver. We focus our attention on two transmission technologies, which are the building blocks of space modulation: i) Space Shift Keying (SSK) modulation; and ii) Time-Orthogonal-Signal-Design (TOSD-) SSK modulation, which is an improved version of SSK modulation providing transmit-diversity. We develop a single-integral closed-form analytical framework to compute the Average Bit Error Probability (ABEP) of a mismatched detector for both SSK and TOSD-SSK modulations. The framework exploits the theory of quadratic-forms in conditional complex Gaussian Random Variables (RVs) along with the Gil-Pelaez inversion theorem. The analytical model is very general and can be used for arbitrary transmit- and receive-antennas, fading distributions, fading spatial correlations, and training pilots. The analytical derivation is substantiated through Monte Carlo simulations, and it is shown, over independent and identically distributed (i.i.d.) Rayleigh fading channels, that SSK modulation is as robust as single-antenna systems to imperfect channel knowledge, and that TOSD-SSK modulation is more robust to channel estimation errors than the Alamouti scheme. Furthermore, it is pointed out that only few training pilots are needed to get reliable enough channel estimates for data detection, and that transmit- and receive-diversity of SSK and TOSD-SSK modulations are preserved even with imperfect channel knowledge.

cs.IT↗

arXiv2011

On the Performance of Space Shift Keying (SSK) Modulation with Imperfect Channel Knowledge

In this paper, we study the sensitivity and robustness of Space Shift Keying (SSK) modulation to imperfect channel knowledge at the receiver. Unlike the common widespread belief, we show that SSK modulation is more robust to imperfect channel knowledge than other state-of-the-art transmission technologies, and only few training pilots are needed to get reliable enough channel estimates for data detection. More precisely, we focus our attention on the so-called Time-Orthogonal-Signal-Design (TOSD-) SSK modulation scheme, which is an improved version of SSK modulation offering transmit-diversity gains, and provide the following contributions: i) we develop a closed-form analytical framework to compute the Average Bit Error Probability (ABEP) of a mismatched detector for TOSD-SSK modulation, which can be used for arbitrary transmit-antenna, receive-antenna, channel fading, and training pilots; ii) we perform a comparative study of the performance of TOSD-SSK modulation and the Alamouti code under the same imperfect channel knowledge, and show that TOSD-SSK modulation is more robust to channel estimation errors; iii) we point out that only few pilot pulses are required to get performance very close to the perfect channel knowledge lower-bound; and iv) we verify that transmit- and receive-diversity gains of TOSD-SSK modulation are preserved even for a mismatched receiver.

cs.PF↗