The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
To alleviate the adverse effect of the multipath fading, we need to estimate the required fading margin for the link budget analysis. Compared with the Monte Carlo simulations, the theoretical analysis can estimate the system performance more rapidly and precisely. This paper studies the outage performance for selection combining based on the generalized correlated Weibull distribution with arbitrary...
The ergodic channel capacity (ECC) of single-branch receivers is studied under the scenarios described by means of α-η-μ, α-к-μ, and α-λ-μ-η generalized fading channels. Novel expressions are derived, which are the most general in this scientific area. Moreover, it is shown that, for any given fading condition, the α-μ ECC divides the fading plane in two regions of capacity, appearing as either lower...
Exact error rate analysis for pre-detection equal gain combining over arbitrarily correlated fading branches has proven elusive. Even specialized correlation models result in complex error rate expressions with multiple nested infinite series or integrals. For this reason, asymptotic analysis is a useful tool due to the simplicity of the error rate expressions it produces. However, one major shortcoming...
Previous works on space-time-frequency (STF) codes have focused on frequency-selective but independent fading channels for MIMO-OFDM systems. However, insufficient antenna space, mobile scenarios, and multipath in practice cause correlation in the spatial, temporal, and frequency domains. This paper studies the effect of STF coding on the performance of MIMO-OFDM systems with general spatial, temporal,...
This paper studies a spectrum sharing cognitive radio (CR) network coexisting with a primary network. In particular, the channel state information (CSI) between the secondary transmitter (STx) and the primary receiver (PRx) is assumed to be outdated due to channel feedback latency. We assume that the secondary user (SU) shall satisfy a given delay quality-of-service (QoS) constraint as well as the...
This paper is concerned with the study of confidential communication through independent and identically distributed (i.i.d.) and evenly correlated Rayleigh fading channels, where a single antenna transmitter communicates with the corresponding receiver in the presence of an eavesdropper. Both the receiver and eavesdropper are equipped with multiple antennas and employ diversity combining receptions...
In this work, we derive a new upper bound on the achievable rate of stationary Rayleigh flat-fading channels with i.i.d. input symbols. The novelty lies in the fact that this bound is not restricted to peak power constrained input symbols like known bounds, e.g., in [1] or [2]. Therefore, the derived upper bound can also be used to evaluate the achievable rate with i.i.d. proper Gaussian input symbols,...
In this paper, we consider cooperative networks comprising multiple simultaneous transmitting source-destination pairs. Specifically, we propose two relay assignment schemes whereby one relay is assigned to one pair at any given time. It is assumed that the number of relays equals or exceeds the number of pairs. This assumption is practical because in future wireless networks, any node in the network...
Distortion exponent has been proposed as performance measure to characterize how fast the average distortion decays to zero when the SNR increases to infinity. The distortion exponent for multiple description coding (MDC) has only been investigated for two descriptions and symmetric SNR. In this paper, we consider the case of any number of descriptions and asymmetric SNR. We derive an achievable distortion...
We consider general multi-antenna fading channels with coarsely quantized outputs, where the channel is unknown to the transmitter and receiver. This analysis is of interest in the context of sensor network communication where low power and low cost are key requirements (e.g. standard IEEE 802.15.4 applications). This is also motivated by highly energy constrained communications devices where sampling...
We investigate the secrecy capacity of an ergodic fading wiretap channel in which the main channel is correlated with the eavesdropper channel. In this study, the full Channel State Information (CSI) is assumed, and thus the transmitter knows the channel gains of the legitimate receiver and the eavesdropper. By analyzing the resulting secrecy capacity we quantify the loss of the secrecy capacity due...
In this paper, a capacity bound for jointly correlated MIMO channel is investigated assuming full knowledge of the channel state information (CSI) at the receiver and statistical CSI at the transmitter. An eigenmode transmission strategy using statistical transmitter CSI is presented, and a closed-form capacity bound for eigenmode-based systems is derived. A relationship between the capacity upper...
This paper addresses adaptive channel estimation for time-varying mobile wireless channels with nonstationary statistics. We presents a reduced complexity adaptive channel estimator based on a set membership filtering approach known as the Optimal Bounding Ellipsoid (OBE) algorithm. To exploit time and frequency domain correlation properties of the channel in an efficient low-complexity way, we allow...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.