An upper bound on the average number of iterations of the LLL algorithm
Theoretical Computer Science - Special issue on number theory, combinatorics and applications to computer science
Lattice basis reduction: improved practical algorithms and solving subset sum problems
Mathematical Programming: Series A and B
Algorithmics for Hard Problems
Algorithmics for Hard Problems
Fundamentals of wireless communication
Fundamentals of wireless communication
Multigroup decodable STBCs from Clifford algebras
IEEE Transactions on Information Theory
On fast-decodable space-time block codes
IEEE Transactions on Information Theory
Space-time codes from structured lattices
IEEE Transactions on Information Theory
Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel
IEEE Transactions on Information Theory
D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols
IEEE Transactions on Information Theory
On the densest MIMO lattices from cyclic division algebras
IEEE Transactions on Information Theory
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On the complexity of sphere decoding in digital communications
IEEE Transactions on Signal Processing
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
The hardness of the closest vector problem with preprocessing
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
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Full-diversity, high-rate space-time block codes from division algebras
IEEE Transactions on Information Theory
Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels
IEEE Transactions on Information Theory
Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding
IEEE Transactions on Information Theory
The golden code: a 2×2 full-rate space-time code with nonvanishing determinants
IEEE Transactions on Information Theory
STBC-schemes with nonvanishing determinant for certain number of transmit antennas
IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
IEEE Transactions on Information Theory
A unified framework for tree search decoding: rediscovering the sequential decoder
IEEE Transactions on Information Theory
Approximately universal codes over slow-fading channels
IEEE Transactions on Information Theory
The MIMO ARQ Channel: Diversity–Multiplexing–Delay Tradeoff
IEEE Transactions on Information Theory
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
IEEE Transactions on Information Theory
Perfect Space–Time Block Codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel
IEEE Transactions on Information Theory
Diversity and Multiplexing Tradeoff in General Fading Channels
IEEE Transactions on Information Theory
Diversity–Multiplexing Tradeoff in MIMO Channels With Partial CSIT
IEEE Transactions on Information Theory
Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme
IEEE Transactions on Information Theory
Perfect Space–Time Codes for Any Number of Antennas
IEEE Transactions on Information Theory
LLL Reduction Achieves the Receive Diversity in MIMO Decoding
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Fading relay channels: performance limits and space-time signal design
IEEE Journal on Selected Areas in Communications
Augmented lattice reduction for MIMO decoding
IEEE Transactions on Wireless Communications
| Hi-index | 754.84 |
This paper identifies the first general, explicit, and nonrandom MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT), without employing a computationally expensive maximum-likelihood (ML) receiver. Specifically, the work establishes the DMT optimality of a class of regularized lattice decoders, and more importantly the DMT optimality of their lattice-reduction (LR)-aided linear counterparts. The results hold for all channel statistics, for all channel dimensions, and most interestingly, irrespective of the particular lattice-code applied. As a special case, it is established that the LLL-based LR-aided linear implementation of the MMSE-GDFE lattice decoder facilitates DMT optimal decoding of any lattice code at a worst-case complexity that grows at most linearly in the data rate. This represents a fundamental reduction in the decoding complexity when compared to ML decoding whose complexity is generally exponential in the rate. The results' generality lends them applicable to a plethora of pertinent communication scenarios such as quasi-static MIMO, MIMO-OFDM, ISI, cooperative-relaying, and MIMO-ARQ channels, in all of which the DMT optimality of the LR-aided linear decoder is guaranteed. The adopted approach yields insight, and motivates further study, into joint transceiver designs with an improved SNR gap to ML decoding.