Elements of information theory
Elements of information theory
Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Multiuser Detection
Principles of Digital Transmission: With Wireless Applications
Principles of Digital Transmission: With Wireless Applications
Convex Optimization
Digital Communication: Third Edition
Digital Communication: Third Edition
Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
MIMO transceiver design via majorization theory
Foundations and Trends in Communications and Information Theory
IEEE Transactions on Information Theory
Optimum power and rate allocation for coded V-BLAST
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
BER minimized OFDM systems with channel independent precoders
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Constrained minimum-BER multiuser detection
IEEE Transactions on Signal Processing
Bit loading with BER-constraint for multicarrier systems
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Convexity properties in binary detection problems
IEEE Transactions on Information Theory
Exact pairwise error probability of space-time codes
IEEE Transactions on Information Theory
A recursive algorithm for the exact BER computation of generalized hierarchical QAM constellations
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Stochastic signaling in the presence of channel state information uncertainty
Digital Signal Processing
Hi-index | 754.84 |
Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity properties of error rates of the maximum likelihood detector operating in the AWGN channel are studied and extended to frequency-flat slow-fading channels. Generic conditions are identified under which the symbol error rate (SER) is convex/concave for arbitrary multi-dimensional constellations. In particular, the SER is convex in SNR for any one- and two-dimensional constellation, and also in higher dimensions at high SNR. Pairwise error probability and bit error rate are shown to be convex at high SNR, for arbitrary constellations and bit mapping. Universal bounds for the SER first and second derivatives are obtained, which hold for arbitrary constellations and are tight for some of them. Applications of the results are discussed, which include optimum power allocation in spatial multiplexing systems, optimum power/time sharing to decrease or increase (jamming problem) error rate, an implication for fading channels ("fading is never good in low dimensions") and optimization of a unitary-precoded OFDM system. For example, the error rate bounds of a unitary-precoded OFDM system with QPSK modulation, which reveal the best and worst precoding, are extended to arbitrary constellations, which may also include coding. The reported results also apply to the interference channel under Gaussian approximation, to the bit error rate when it can be expressed or approximated as a nonnegative linear combination of individual symbol error rates, and to coded systems.