623 research outputs found

    Level Crossing Rate and Average Fade Duration of the Multihop Rayleigh Fading Channel

    Full text link
    We present a novel analytical framework for the evaluation of important second order statistical parameters, as the level crossing rate (LCR) and the average fade duration (AFD) of the amplify-and-forward multihop Rayleigh fading channel. More specifically, motivated by the fact that this channel is a cascaded one, which can be modelled as the product of N fading amplitudes, we derive novel analytical expressions for the average LCR and AFD of the product of N Rayleigh fading envelopes, or of the recently so-called N*Rayleigh channel. Furthermore, we derive simple and efficient closed-form approximations to the aforementioned parameters, using the multivariate Laplace approximation theorem. It is shown that our general results reduce to the specific dual-hop case, previously published. Numerical and computer simulation examples verify the accuracy of the presented mathematical analysis and show the tightness of the proposed approximations

    On the Second Order Statistics of the Multihop Rayleigh Fading Channel

    Full text link
    Second order statistics provides a dynamic representation of a fading channel and plays an important role in the evaluation and design of the wireless communication systems. In this paper, we present a novel analytical framework for the evaluation of important second order statistical parameters, as the level crossing rate (LCR) and the average fade duration (AFD) of the amplify-and-forward multihop Rayleigh fading channel. More specifically, motivated by the fact that this channel is a cascaded one and can be modeled as the product of N fading amplitudes, we derive novel analytical expressions for the average LCR and the AFD of the product of N Rayleigh fading envelopes (or of the recently so-called N*Rayleigh channel). Furthermore, we derive simple and efficient closed-form approximations to the aforementioned parameters, using the multivariate Laplace approximation theorem. It is shown that our general results reduce to the corresponding ones of the specific dual-hop case, previously published. Numerical and computer simulation examples verify the accuracy of the presented mathematical analysis and show the tightness of the proposed approximations

    Dual-hop transmissions with fixed-gain relays over Generalized-Gamma fading channels

    Get PDF
    In this paper, a study on the end-to-end performance of dual-hop wireless communication systems equipped with fixed-gain relays and operating over Generalized-Gamma (GG) fading channels is presented. A novel closed form expression for the moments of the end-to-end signal-to-noise ratio (SNR) is derived. The average bit error probability for coherent and non-coherent modulation schemes as well as the end-to-end outage probability of the considered system are also studied. Extensive numerically evaluated and computer simulations results are presented that verify the accuracy of the proposed mathematical analysis.\u

    Decentralized Dynamic Hop Selection and Power Control in Cognitive Multi-hop Relay Systems

    Full text link
    In this paper, we consider a cognitive multi-hop relay secondary user (SU) system sharing the spectrum with some primary users (PU). The transmit power as well as the hop selection of the cognitive relays can be dynamically adapted according to the local (and causal) knowledge of the instantaneous channel state information (CSI) in the multi-hop SU system. We shall determine a low complexity, decentralized algorithm to maximize the average end-to-end throughput of the SU system with dynamic spatial reuse. The problem is challenging due to the decentralized requirement as well as the causality constraint on the knowledge of CSI. Furthermore, the problem belongs to the class of stochastic Network Utility Maximization (NUM) problems which is quite challenging. We exploit the time-scale difference between the PU activity and the CSI fluctuations and decompose the problem into a master problem and subproblems. We derive an asymptotically optimal low complexity solution using divide-and-conquer and illustrate that significant performance gain can be obtained through dynamic hop selection and power control. The worst case complexity and memory requirement of the proposed algorithm is O(M^2) and O(M^3) respectively, where MM is the number of SUs
    • …
    corecore