LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Low-complexity lattice reduction algorithm for MIMO detectors with tree searching

Photo by lureofadventure from unsplash

In this paper, we propose a low-complexity lattice reduction (LR) algorithm for multiple-input multiple-output (MIMO) detectors with tree searching. Whereas conventional approaches are based exclusively on channel characteristics, we focus… Click to show full abstract

In this paper, we propose a low-complexity lattice reduction (LR) algorithm for multiple-input multiple-output (MIMO) detectors with tree searching. Whereas conventional approaches are based exclusively on channel characteristics, we focus on joint optimisation by employing an early termination criterion in the context of MIMO detection. In this regard, incremental LR (ILR) was previously proposed. However, the ILR is limited to LR-aided successive interference cancellation (SIC) detectors which have considerable bit-error-rate (BER) performance degradation compared to optimal detectors. Hence, in this paper, we extend the conventional ILR to be applicable to the LR-aided detectors with near-optimal performance. Furthermore, we perform the hypothetical analysis and several novel modifications to handle the obstacles for the application of the ILR to LR-aided detectors other than the LR-aided SIC detectors. The simulation results demonstrate that the computational complexity is considerably reduced, with BER performance degradation of 10−5.

Keywords: complexity; mimo detectors; low complexity; reduction algorithm; complexity lattice; lattice reduction

Journal Title: EURASIP Journal on Wireless Communications and Networking
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.