Complexity Study of Lattice Reduction for MIMO Detection
- Resource Type
- Conference
- Authors
- Sandell, Magnus; Lillie, Andy; McNamara, Darren; Ponnampalam, Vishakan; Milford, David
- Source
- 2007 IEEE Wireless Communications and Networking Conference Wireless Communications and Networking Conference, 2007.WCNC 2007. IEEE. :1088-1092 Mar, 2007
- Subject
- Communication, Networking and Broadcast Technologies
Computing and Processing
Lattices
MIMO
Detectors
Receiving antennas
Transmitting antennas
Sorting
Narrowband
Maximum likelihood detection
Bit error rate
OFDM
- Language
- ISSN
- 1525-3511
1558-2612
This paper analyses lattice reduction for MIMO decoding and investigates how different parameters affect the complexity. Lattice reduction is a promising technique and a common approach to implementing it is to use the LLL algorithm. In this paper we show how the complexity of the LLL algorithm depends on such parameters as the number of antennas, SNR, channel correlation and channel matrix column sorting. Both real- and complex-valued versions are considered and complexity-performance trade-offs are also studied.