Results 231 to 240 of about 12,474 (262)
Some of the next articles are maybe not open access.
Generalized decorrelators for fading channels
Proceedings International Conference on Information Technology: Coding and Computing, 2002An iterative pilot symbol aided detector for random multipath fading channels that does not neglect intersymbol interference (ISI) is studied for a CDMA uplink system with multiple receiver antennas. The algorithm resolves the received signals at each antenna into components corresponding to each path for every user.
openaire +1 more source
On the capacity of generalized-k fading channels
IEEE Transactions on Wireless Communications, 2007This paper investigates the capacity of generalized- K fading channels. This very general model describes accurately composite multipath/shadowing fading channels which are widely encountered in real-world environments. We derive closed-form expressions for three adaptive transmission techniques, namely, i) optimal rate adaptation with constant power ...
Amine Laourine +3 more
openaire +1 more source
Ergodic channel capacity for generalized fading channels
2014 IEEE Wireless Communications and Networking Conference (WCNC), 2014The 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.
Anastasios K. Papazafeiropoulos +1 more
openaire +1 more source
Adaptive coded modulation for fading channels
Proceedings of ICC'97 - International Conference on Communications, 1998We propose a variable-power and variable-rate coded MQAM modulation technique for high-speed data transmission on fading channels. Coding gain is obtained by superimposing trellis codes designed for AWGN channels on the adaptive modulation, and we obtain the same coding gains as these codes exhibit in AWGN.
Andrea J. Goldsmith, Soon-Ghee Chua
openaire +1 more source
Distortion Exponent of Parallel Fading Channels
2006 IEEE International Symposium on Information Theory, 2006We consider the end-to-end distortion achieved by transmitting a continuous amplitude source over M parallel, independent quasi-static fading channels. We analyze the high SNR expected distortion behavior characterized by the distortion exponent. We first give an upper bound for the distortion exponent in terms of the bandwidth ratio between the ...
Deniz Gündüz, Elza Erkip
openaire +1 more source
Target Tracking Over Fading Channels
IEEE Transactions on Communications, 1976The problem of tracking a target in a multitarget environment when the observations are received over a fading channel is considered. The optimal Bayes solution to the tracking problem in such cases involves growing memory and hence is not feasible.
F. S. Chang, Mandyam D. Srinath
openaire +2 more sources
1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167), 2002
We discuss the coding design criteria for some classical fading channel models. If the channel is not stationary, as it happens for example in a mobile-radio communication system where it may fluctuate in time between the extremes of Rayleigh and AWGN, then a code designed to be optimum for a fixed channel model might perform poorly when the channel ...
E. Biglieri, G. Caire, G. Taricco
openaire +1 more source
We discuss the coding design criteria for some classical fading channel models. If the channel is not stationary, as it happens for example in a mobile-radio communication system where it may fluctuate in time between the extremes of Rayleigh and AWGN, then a code designed to be optimum for a fixed channel model might perform poorly when the channel ...
E. Biglieri, G. Caire, G. Taricco
openaire +1 more source
IEEE International Symposium on Information Theory, 2003. Proceedings., 2003
We introduce a simple on-off fading dis- crete memoryless multiple-access channel in which the multiplicative fading for each user is a Bernoulli ran- dom process. We find the capacity of this channel in the case that the receiver does not know the values of the channel gains.
E. Perron, M. Rezaeian, A. Grant
openaire +1 more source
We introduce a simple on-off fading dis- crete memoryless multiple-access channel in which the multiplicative fading for each user is a Bernoulli ran- dom process. We find the capacity of this channel in the case that the receiver does not know the values of the channel gains.
E. Perron, M. Rezaeian, A. Grant
openaire +1 more source
Fade Statistics in Composite Fading Channels
Journal of Electronics & Information Technology, 2011Xiao-dong Wang +2 more
openaire +1 more source
Rayleigh Fading Modeling and Channel Hardening for Reconfigurable Intelligent Surfaces
IEEE Wireless Communications Letters, 2021Emil Bjornson, Luca Sanguinetti
exaly