Matrix analysis
Graphical models for machine learning and digital communication
Graphical models for machine learning and digital communication
On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas
Wireless Personal Communications: An International Journal
IEEE Transactions on Information Theory
Combined array processing and space-time coding
IEEE Transactions on Information Theory
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
Performance limits of coded diversity methods for transmitter antenna arrays
IEEE Transactions on Information Theory
On the theory of space-time codes for PSK modulation
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
A rank criterion for QAM space-time codes
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
A space-time coding modem for high-data-rate wireless communications
IEEE Journal on Selected Areas in Communications
Space-time block coding for wireless communications: performance results
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We consider the design of phase shift keyed space-time coded modulation for two antenna systems based on linear codes over rings. Design rules for constructing full diversity systematic space-time codes based on underlying existing algebraic codes were first presented by Hammons and El Gamal in 2000. We reformulate and simplify these design rules, resulting in the condition that the characteristic polynomial of the parity generation matrix must be irreducible. We further extend the results to non-systematic codes. These results yield a recursive construction based on the Schur determinant formula. The resulting block codes are guranteed to provide full diversity advantage. In addition, the code construction is such that the corresponding parity check matrix is sparse, enabling the use of the powerful Sum-Product algorithm for decoding.