Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)
DOI: 10.1109/itw.2003.1216764
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: -We consider the lattice-reduction-aided detection scheme for 2×2 channels recently proposed by Yao and Wornell [11]. Using an equivalent real-valued substitute MIMO channel model their lattice reduction algorithm can be replaced by the well-known LLL algorithm, which enables the application to MIMO systems with arbitrary numbers of dimensions. We show how lattice reduction can also be favourably applied in systems that use precoding and give simulation results that underline the usefulness of this approach. I… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
224
0
2

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 278 publications
(227 citation statements)
references
References 9 publications
1
224
0
2
Order By: Relevance
“…To reduce this complexity LR-aided detectors were proposed in [6], [7]. LR-aided detectors try to reduce the basis of the lattice Hx and find another basis with better properties for detection [13].…”
Section: Lr-aided Mimo Detector Designmentioning
confidence: 99%
See 1 more Smart Citation
“…To reduce this complexity LR-aided detectors were proposed in [6], [7]. LR-aided detectors try to reduce the basis of the lattice Hx and find another basis with better properties for detection [13].…”
Section: Lr-aided Mimo Detector Designmentioning
confidence: 99%
“…On the other hand, linear detectors such as Zero Forcing (ZF) detection is simple to implement, while it suffers from significant performance degradation compared to the ML. Recently, Lattice Reduction (LR) aided detectors were proposed for MIMO systems, that are capable of achieving a sub-optimal performance close to ML with much less complexity [6], [7]. Several algorithms have been proposed in the literature for performing Lattice Reduction such as the Lenstra, Lanstra, and Lovasz (LLL) algorithm [8], the Korkine-Zolotareff (KZ) algorithm [9] and the Element-based Lattice Reduction (ELR) algorithm [10].…”
Section: Introductionmentioning
confidence: 99%
“…The data stream is first de-multiplexed into N t data substreams, mapped onto rectangular QAM symbols, and then transmitted over the N t antennas simultaneously over a frequency-flat fading channel. For any given time instant, the received vector y c = y are represented as drawn from a subset of complex-integers after some proper scaling and shifting [4,11], while the w c is modeled as a zero-mean white Gaussian random vector with covariance matrix σ 2 w I Nr . For subsequent notational convenience, an equivalent realvalued model y = Hx + w is introduced, where…”
Section: A System Descriptionmentioning
confidence: 99%
“…With the new lattice basisB T and z = T −1 c. The idea of LR-aided MIMO detection is to first detect the coordinate vector z in the new basisB and then transform the resultẑ back to the original basis B viaĉ = Tẑ. With the help of many existing LR algorithms, the new basisB can be designed to be near-orthogonal, which significantly improves the reliability of many low-complexity suboptimal detectors [3,4,13].…”
Section: B Lr-aided Mimo Detectionmentioning
confidence: 99%
“…On the other hand, linear detectors, such as the Zero Forcing (ZF) detector, are simple to implement, which is at the expense of a significant performance degradation compared to the ML detector. Hence, Lattice Reduction (LR) aided detectors have been proposed for MIMO systems in order to achieve a near-ML performance with significantly lower complexity [9,10]. Several algorithms have been proposed in the literature for performing Lattice Reduction such as the Lenstra, Lanstra, and Lovasz (LLL) algorithm [11], the Korkine-Zolotareff (KZ) algorithm [12] and the Element-based Lattice Reduction (ELR) algorithm [13].…”
Section: Introductionmentioning
confidence: 99%