Fundamentals of Convolutional Coding
Fundamentals of Convolutional Coding
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Quarternary Signal Sets for Digital Communications with Nonuniform Sources
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Detection of binary Markov sources over channels with additive Markov noise
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
Exact pairwise error probability of space-time codes
IEEE Transactions on Information Theory
High-rate codes that are linear in space and time
IEEE Transactions on Information Theory
Remarks on space-time codes including a new lower bound and an improved code
IEEE Transactions on Information Theory
On the joint source-channel coding error exponent for discrete memoryless systems
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Alamouti code with quadrature partial response signaling
IEEE Transactions on Wireless Communications
Quadrature partial response signaling based on Alamouti code
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
| Hi-index | 0.00 |
We study the maximum a posteriori (MAP) decoding of memoryless non-uniform sources over multiple-antenna channels. Our model is general enough to include space-time coding, BLAST architectures, and single-transmit multireceive antenna systems which employ any type of channel coding. We derive a closed-form expression for the codeword pairwise error probability (PEP) of general multi-antenna codes using moment generating function and Laplace transform arguments. We then consider space-time orthogonal block (STOB) coding and prove that, similar to the maximum likelihood (ML) decoding case, detection of symbols is decoupled in MAP decoding. We also derive the symbol PEP in closed-form for STOB codes. We apply these results in several scenarios. First, we design a binary antipodal signaling scheme which minimizes the system bit error rate (BER) under STOB coding. At a BER of 10-6, this constellation has a channel signal-to-noise ratio (CSNR) gain of 4.7 dB over conventional BPSK signaling for a binary non-uniform source with p0 Δ P(0) = 0.9. We next design space-time linear dispersion (LD) codes which are optimized for the source distribution under the criterion of minimizing the union upper bound on the frame error rate (FER). Two codes are given here: one outperforms V-BLAST by 3.5 dB and Alamouti's code by 12.3 dB at an FER of 10-2 for a binary source with p0 = 0.9, and the other outperforms V-BLAST by 4.2 dB at an FER of 10-3 for a uniform source. These codes also outperform the LD codes of [13] constructed under a different criteria. Finally, the problem of bit-to-signal mapping is studied. It is shown that for a binary source with p0 = 0.9, 64-QAM signaling, and SER = 10-3, a gain of 3.7 dB can be achieved using a better-than-Gray mapping. For a system with one transmit and two receive antennas that uses trellis coding with 16-QAM signaling, a 1.8 dB gain over quasi-Gray mapping and ML decoding is observed when MAP decoding is used for binary sources with p0 = 0.9.