Wireless communications systems and networks
Transmission and reception with multiple antennas: theoretical foundations
Communications and Information Theory
Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Majorization and matrix-monotone functions in wireless communications
Foundations and Trends in Communications and Information Theory
Link-adaptive distributed coding for multisource cooperation
EURASIP Journal on Advances in Signal Processing
An overview of OpenAirInterface wireless network emulation methodology
ACM SIGMETRICS Performance Evaluation Review
Computers and Electrical Engineering
Bit-Interleaved Coded Modulation
Foundations and Trends in Communications and Information Theory
Fast communication: Best antenna selection for coded SIMO-OFDM
Signal Processing
Coded diversity for cooperative MISO based wireless sensor networks
IEEE Communications Letters
IEEE Transactions on Wireless Communications
Transceiver design based on blockwise uniform channel decomposition for coded MIMO systems
IEEE Transactions on Wireless Communications
Service-outage-based power and rate control for poisson fading channels
IEEE Transactions on Information Theory
Outage behavior of discrete memoryless channels under channel estimation errors
IEEE Transactions on Information Theory
Coded modulation with mismatched power control over block-fading channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Symbol-level adaptive modulation for coded OFDM on block fading channels
IEEE Transactions on Communications
Outage probability of the free-space optical channel with doubly stochastic scintillation
IEEE Transactions on Communications
Throughput maximization over slowly fading channels using quantized and erroneous feedback
IEEE Transactions on Communications
Improving power efficiency of coded OFDM with feedback
IEEE Transactions on Communications
Dynamic power allocation over block-fading channels with delay constraint
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Bit-interleaved coded modulation for hybrid RF/FSO systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Diversity analysis of bit-interleaved coded multiple beamforming
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Analysis and code design of variable time-fraction collaborative communications
IEEE Transactions on Wireless Communications
Outage exponents of block-fading channels with power allocation
IEEE Transactions on Information Theory
Coding for the nonorthogonal amplify-and-forward cooperative channel
IEEE Transactions on Information Theory
Low-density parity-check codes for nonergodic block-fading channels
IEEE Transactions on Information Theory
Diversity analysis of bit-interleaved coded multiple beamforming
IEEE Transactions on Communications
Semi-analytical performance prediction methods for iterative MMSE-IC multiuser MIMO joint decoding
IEEE Transactions on Communications
Analysis and construction of full-diversity joint network-LDPC codes for cooperative communications
EURASIP Journal on Wireless Communications and Networking - Special issue on physical-layer network coding for wireless cooperative networks
Hi-index | 755.14 |
This work considers the achievable performance for coded systems adapted to a multipath block-fading channel model. This is a particularly useful model for analyzing mobile-radio systems which employ techniques such as slow frequency-hopping under stringent time-delay or bandwidth constraints for slowly time-varying channels. In such systems, coded information is transmitted over a small number of fading channels in order to achieve diversity. Bounds on the achievable performance due to coding are derived using information-theoretic techniques. It is shown that high diversity can be achieved using relatively simple codes as long as very high spectral efficiency is not required. Examples of simple block codes and carefully chosen trellis codes are given which yield, in some cases, performances approaching the information-theoretic bounds