Computer Science – Information Theory
Scientific paper
2009-01-27
Computer Science
Information Theory
5 pages, submitted to ISIT 09
Scientific paper
Currently for the nt x nr MIMO channel, any explicitly constructed space-time (ST) designs that achieve optimality with respect to the diversity multiplexing tradeoff (DMT) are known to do so only when decoded using maximum likelihood (ML) decoding, which may incur prohibitive decoding complexity. In this paper we prove that MMSE regularized lattice decoding, as well as the computationally efficient lattice reduction (LR) aided MMSE decoder, allows for efficient and DMT optimal decoding of any approximately universal lattice-based code. The result identifies for the first time an explicitly constructed encoder and a computationally efficient decoder that achieve DMT optimality for all multiplexing gains and all channel dimensions. The results hold irrespective of the fading statistics.
Elia Petros
Jalden Joakim
No associations
LandOfFree
LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-362239