Matrix analysis
Lattice basis reduction: improved practical algorithms and solving subset sum problems
Mathematical Programming: Series A and B
On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas
Wireless Personal Communications: An International Journal
Convex Optimization
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Bit-interleaved coded modulation
IEEE Transactions on Information Theory
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory
Diagonal algebraic space-time block codes
IEEE Transactions on Information Theory
A construction of a space-time code based on number theory
IEEE Transactions on Information Theory
High-rate codes that are linear in space and time
IEEE Transactions on Information Theory
Closest point search in lattices
IEEE Transactions on Information Theory
Super-orthogonal space-time trellis codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Linear threaded algebraic space-time constellations
IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
The golden code: a 2×2 full-rate space-time code with nonvanishing determinants
IEEE Transactions on Information Theory
High-rate concatenated space-time block code M-TCM designs
IEEE Transactions on Information Theory
A simple transmit diversity technique for 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
Iterative sphere detectors based on the schnorr-euchner enumeration
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
The multistrata space-time codes proposed by Wachsmann et al. were intended then to fix the drawback of orthogonal space-time block codes which is the relatively low spectral efficiency. However, these codes lack two things: 1) their performance is worse than codes designed using number theory like the Golden code. 2) The advantages of their structure were never exploited in reducing the detection complexity. In this paper, it is shown how the multistrata structure can potentially reduce the detection complexity of the sphere decoder in the uncoded case. The reduction in complexity is achieved in both the preprocessing and the search steps of the sphere decoder. Spacetime block codes having such a multistrata structure were found via optimization. Simulation results show that the obtained code has sufficiently high minimum determinant with a very small performance penalty compared to the best known 2 × 2 spacetime block code in literature, the Golden code. Also a simple means of generating bit log-likelihood ratios in a bit-interleaved coded modulation scenario is presented.