991 resultados para Fast Rayleigh Fading
Resumo:
This study considers a dual-hop cognitive inter-vehicular relay-assisted communication system where all
communication links are non-line of sight ones and their fading is modelled by the double Rayleigh fading distribution.
Road-side relays (or access points) implementing the decode-and-forward relaying protocol are employed and one of
them is selected according to a predetermined policy to enable communication between vehicles. The performance of
the considered cognitive cooperative system is investigated for Kth best partial and full relay selection (RS) as well as
for two distinct fading scenarios. In the first scenario, all channels are double Rayleigh distributed. In the second
scenario, only the secondary source to relay and relay to destination channels are considered to be subject to double
Rayleigh fading whereas, channels between the secondary transmitters and the primary user are modelled by the
Rayleigh distribution. Exact and approximate expressions for the outage probability performance for all considered RS
policies and fading scenarios are presented. In addition to the analytical results, complementary computer simulated
performance evaluation results have been obtained by means of Monte Carlo simulations. The perfect match between
these two sets of results has verified the accuracy of the proposed mathematical analysis.
Resumo:
In this paper, we investigate the physical layer secrecy performance of a single-input single-output system that consists of single antenna devices and operates in the presence of a single antenna passive eavesdropper over dissimilar fading channels. In particular, we consider two scenarios in terms of dissimilar fading channel arrangements: the legal/illegal channels are subject to Rayleigh/Rician fading, respectively; and the legal/illegal channels are subject to Rician/Rayleigh fading, respectively. Specifically, analytical expressions for the probability of the existence of a non-zero secrecy capacity and the secrecy outage probability are derived by using statistical characteristics of the signal-to-noise ratio. Numerical results are provided for selected scenarios to illustrate applications of the developed analytical expressions.
Resumo:
Hardware constraints, which motivate receive antenna selection, also require that various antenna elements at the receiver be sounded sequentially to obtain estimates required for selecting the `best' antenna and for coherently demodulating data thereafter. Consequently, the channel state information at different antennas is outdated by different amounts and corrupted by noise. We show that, for this reason, simply selecting the antenna with the highest estimated channel gain is not optimum. Rather, a preferable strategy is to linearly weight the channel estimates of different antennas differently, depending on the training scheme. We derive closed-form expressions for the symbol error probability (SEP) of AS for MPSK and MQAM in time-varying Rayleigh fading channels for arbitrary selection weights, and validate them with simulations. We then characterize explicitly the optimal selection weights that minimize the SEP. We also consider packet reception, in which multiple symbols of a packet are received by the same antenna. New suboptimal, but computationally efficient weighted selection schemes are proposed for reducing the packet error rate. The benefits of weighted selection are also demonstrated using a practical channel code used in third generation cellular systems. Our results show that optimal weighted selection yields a significant performance gain over conventional unweighted selection.
Resumo:
This paper analyzes the error exponents in Bayesian decentralized spectrum sensing, i.e., the detection of occupancy of the primary spectrum by a cognitive radio, with probability of error as the performance metric. At the individual sensors, the error exponents of a Central Limit Theorem (CLT) based detection scheme are analyzed. At the fusion center, a K-out-of-N rule is employed to arrive at the overall decision. It is shown that, in the presence of fading, for a fixed number of sensors, the error exponents with respect to the number of observations at both the individual sensors as well as at the fusion center are zero. This motivates the development of the error exponent with a certain probability as a novel metric that can be used to compare different detection schemes in the presence of fading. The metric is useful, for example, in answering the question of whether to sense for a pilot tone in a narrow band (and suffer Rayleigh fading) or to sense the entire wide-band signal (and suffer log-normal shadowing), in terms of the error exponent performance. The error exponents with a certain probability at both the individual sensors and at the fusion center are derived, with both Rayleigh as well as log-normal shadow fading. Numerical results are used to illustrate and provide a visual feel for the theoretical expressions obtained.
Resumo:
A decode and forward protocol based Trellis Coded Modulation (TCM) scheme for the half-duplex relay channel, in a Rayleigh fading environment, is presented. The proposed scheme can achieve any spectral efficiency greater than or equal to one bit per channel use (bpcu). A near-ML decoder for the suggested TCM scheme is proposed. It is shown that the high Signal to Noise Ratio (SNR) performance of this near-ML decoder approaches the performance of the optimal ML decoder. Based on the derived Pair-wise Error Probability (PEP) bounds, design criteria to maximize the diversity and coding gains are obtained. Simulation results show a large gain in SNR for the proposed TCM scheme over uncoded communication as well as the direct transmission without the relay.
Resumo:
We propose power allocation algorithms for increasing the sum rate of two and three user interference channels. The channels experience fast fading and there is an average power constraint on each transmitter. Our achievable strategies for two and three user interference channels are based on the classification of the interference into very strong, strong and weak interferences. We present numerical results of the power allocation algorithm for two user Gaussian interference channel with Rician fading with mean total power gain of the fade Omega = 3 and Rician factor kappa = 0.5 and compare the sum rate with that obtained from ergodic interference alignment with water-filling. We show that our power allocation algorithm increases the sum rate with a gain of 1.66dB at average transmit SNR of 5dB. For the three user Gaussian interference channel with Rayleigh fading with distribution CN(0, 0.5), we show that our power allocation algorithm improves the sum rate with a gain of 1.5dB at average transmit SNR of 5dB.
Resumo:
This paper considers decentralized spectrum sensing, i.e., detection of occupancy of the primary users' spectrum by a set of Cognitive Radio (CR) nodes, under a Bayesian set-up. The nodes use energy detection to make their individual decisions, which are combined at a Fusion Center (FC) using the K-out-of-N fusion rule. The channel from the primary transmitter to the CR nodes is assumed to undergo fading, while that from the nodes to the FC is assumed to be error-free. In this scenario, a novel concept termed as the Error Exponent with a Confidence Level (EECL) is introduced to evaluate and compare the performance of different detection schemes. Expressions for the EECL under general fading conditions are derived. As a special case, it is shown that the conventional error exponent both at individual sensors, and at the FC is zero. Further, closed-form lower bounds on the EECL are derived under Rayleigh fading and lognormal shadowing. As an example application, it answers the question of whether to use pilot-signal based narrowband sensing, where the signal undergoes Rayleigh fading, or to sense over the entire bandwidth of a wideband signal, where the signal undergoes lognormal shadowing. Theoretical results are validated using Monte Carlo simulations. (C) 2015 Elsevier B.V. All rights reserved.
Resumo:
We study information rates of time-varying flat-fading channels (FFC) modeled as finite-state Markov channels (FSMC). FSMCs have two main applications for FFCs: modeling channel error bursts and decoding at the receiver. Our main finding in the first application is that receiver observation noise can more adversely affect higher-order FSMCs than lower-order FSMCs, resulting in lower capacities. This is despite the fact that the underlying higher-order FFC and its corresponding FSMC are more predictable. Numerical analysis shows that at low to medium SNR conditions (SNR lsim 12 dB) and at medium to fast normalized fading rates (0.01 lsim fDT lsim 0.10), FSMC information rates are non-increasing functions of memory order. We conclude that BERs obtained by low-order FSMC modeling can provide optimistic results. To explain the capacity behavior, we present a methodology that enables analytical comparison of FSMC capacities with different memory orders. We establish sufficient conditions that predict higher/lower capacity of a reduced-order FSMC, compared to its original high-order FSMC counterpart. Finally, we investigate the achievable information rates in FSMC-based receivers for FFCs. We observe that high-order FSMC modeling at the receiver side results in a negligible information rate increase for normalized fading rates fDT lsim 0.01.
Resumo:
This paper investigates the distribution of the condition number of complex Wishart matrices. Two closely related measures are considered: the standard condition number (SCN) and the Demmel condition number (DCN), both of which have important applications in the context of multiple-input multipleoutput (MIMO) communication systems, as well as in various branches of mathematics. We first present a novel generic framework for the SCN distribution which accounts for both central and non-central Wishart matrices of arbitrary dimension. This result is a simple unified expression which involves only a single scalar integral, and therefore allows for fast and efficient computation. For the case of dual Wishart matrices, we derive new exact polynomial expressions for both the SCN and DCN distributions. We also formulate a new closed-form expression for the tail SCN distribution which applies for correlated central Wishart matrices of arbitrary dimension and demonstrates an interesting connection to the maximum eigenvalue moments of Wishart matrices of smaller dimension. Based on our analytical results, we gain valuable insights into the statistical behavior of the channel conditioning for various MIMO fading scenarios, such as uncorrelated/semi-correlated Rayleigh fading and Ricean fading. © 2010 IEEE.
Resumo:
This paper investigates the uplink achievable rates of massive multiple-input multiple-output (MIMO) antenna systems in Ricean fading channels, using maximal-ratio combining (MRC) and zero-forcing (ZF) receivers, assuming perfect and imperfect channel state information (CSI). In contrast to previous relevant works, the fast fading MIMO channel matrix is assumed to have an arbitrary-rank deterministic component as well as a Rayleigh-distributed random component. We derive tractable expressions for the achievable uplink rate in the large-antenna limit, along with approximating results that hold for any finite number of antennas. Based on these analytical results, we obtain the scaling law that the users' transmit power should satisfy, while maintaining a desirable quality of service. In particular, it is found that regardless of the Ricean K-factor, in the case of perfect CSI, the approximations converge to the same constant value as the exact results, as the number of base station antennas, M, grows large, while the transmit power of each user can be scaled down proportionally to 1/M. If CSI is estimated with uncertainty, the same result holds true but only when the Ricean K-factor is non-zero. Otherwise, if the channel experiences Rayleigh fading, we can only cut the transmit power of each user proportionally to 1/√M. In addition, we show that with an increasing Ricean K-factor, the uplink rates will converge to fixed values for both MRC and ZF receivers.
Resumo:
One of the most important factors that affects the performance of energy detection (ED) is the fading channel between the wireless nodes. This article investigates the performance of ED-based spectrum sensing, for cognitive radio (CR), over two-wave with diffuse power (TWDP) fading channels. The TWDP fading model characterizes a variety of fading channels, including well-known canonical fading distributions, such as Rayleigh and Rician, as well as worse than Rayleigh fading conditions modeled by the two-ray fading model. Novel analytic expressions for the average probability of detection over TWDP fading that account for single-user and cooperative spectrum sensing as well as square law selection diversity reception are derived. These expressions are used to analyze the behavior of ED-based spectrum sensing over moderate, severe and extreme fading conditions, and to investigate the use of cooperation and diversity as a means of mitigating the fading effects. Our results indicate that TWDP fading conditions can significantly degrade the sensing performance; however, it is shown that detection performance can be improved when cooperation and diversity are employed. The presented outcomes enable us to identify the limits of ED-based spectrum sensing and quantify the trade-offs between detection performance and energy efficiency for cognitive radio systems deployed within confined environments such as in-vehicular wireless networks.
Resumo:
Wavelet coding is an efficient technique to overcome the multipath fading effects, which are characterized by fluctuations in the intensity of the transmitted signals over wireless channels. Since the wavelet symbols are non-equiprobable, modulation schemes play a significant role in the overall performance of wavelet systems. Thus the development of an efficient design method is crucial to obtain modulation schemes suitable for wavelet systems, principally when these systems employ wavelet encoding matrixes of great dimensions. In this work, it is proposed a design methodology to obtain sub-optimum modulation schemes for wavelet systems over Rayleigh fading channels. In this context, novels signal constellations and quantization schemes are obtained via genetic algorithm and mathematical tools. Numerical results obtained from simulations show that the wavelet-coded systems derived here have very good performance characteristics over fading channels
Resumo:
Random access (RA) protocols are normally used in a satellite networks for initial terminal access and are particularly effective since no coordination is required. On the other hand, contention resolution diversity slotted Aloha (CRDSA), irregular repetition slotted Aloha (IRSA) and coded slotted Aloha (CSA) has shown to be more efficient than classic RA schemes as slotted Aloha, and can be exploited also when short packets transmissions are done over a shared medium. In particular, they relies on burst repetition and on successive interference cancellation (SIC) applied at the receiver. The SIC process can be well described using a bipartite graph representation and exploiting tools used for analyze iterative decoding. The scope of my Master Thesis has been to described the performance of such RA protocols when the Rayleigh fading is taken into account. In this context, each user has the ability to correctly decode a packet also in presence of collision and when SIC is considered this may result in multi-packet reception. Analysis of the SIC procedure under Rayleigh fading has been analytically derived for the asymptotic case (infinite frame length), helping the analysis of both throughput and packet loss rates. An upper bound of the achievable performance has been analytically obtained. It can be show that in particular channel conditions the throughput of the system can be greater than one packets per slot which is the theoretical limit of the Collision Channel case.
Resumo:
The performance of the maximum ratio combining method for the combining of antenna-diversity signals in correlated Rician-fading channels is rigorously studied. The distribution function of the normalized signal-to-noise ratio (SNR) is expanded in terms of a power series and calculated numerically. This power series can easily take into account the signal correlations and antenna gains and can be applied to any number of receiving antennas. An application of the method to dual-antenna diversity systems produces useful distribution curves for the normalized SNR which can be used to find the diversity gain. It is revealed that signal correlation in Rician-fading channels helps to increase the diversity gain rather than to decrease it as in the Rayleigh fading channels. It is also shown that with a relative strong direct signal component, the diversity gain can be much higher than that without a direct signal component.
Resumo:
Two direct sampling correlator-type receivers for differential chaos shift keying (DCSK) communication systems under frequency non-selective fading channels are proposed. These receivers operate based on the same hardware platform with different architectures. In the first scheme, namely sum-delay-sum (SDS) receiver, the sum of all samples in a chip period is correlated with its delayed version. The correlation value obtained in each bit period is then compared with a fixed threshold to decide the binary value of recovered bit at the output. On the other hand, the second scheme, namely delay-sum-sum (DSS) receiver, calculates the correlation value of all samples with its delayed version in a chip period. The sum of correlation values in each bit period is then compared with the threshold to recover the data. The conventional DCSK transmitter, frequency non-selective Rayleigh fading channel, and two proposed receivers are mathematically modelled in discrete-time domain. The authors evaluated the bit error rate performance of the receivers by means of both theoretical analysis and numerical simulation. The performance comparison shows that the two proposed receivers can perform well under the studied channel, where the performances get better when the number of paths increases and the DSS receiver outperforms the SDS one.