A Seysen’s Algorithm based Incremental Lattice Reduction

Authors

Q. He, Y. Hu, A. Schmeink,

Abstract

        Lattice reduction (LR)–aided detections have attracted great attention in the symbol detection of multiple‐input–multiple‐output communication, especially for systems with larger scale antennas. Recently, the Lenstra‐Lenstra‐Lovász (LLL)–based incremental LR (ILR) algorithms have been proposed to employ an early termination to jointly conduct the LR and retrieve the symbol based on a partial successive interference cancellation (SIC) detection, which induces a significant performance improvement. In this paper, we propose to apply the Seysen's algorithm (SA) to the ILR. After providing the feasibility analysis, two novel SA involved algorithms are introduced and studied. In particular, a new sorted QR decomposition‐based SA algorithm is proposed and tested as it plays a key role in the SIC detection. Subsequently, a novel SA‐based ILR scheme is further developed and investigated. By simulations, we show that the proposed approach outperforms conventional LLL‐based ILR in various aspects, while only a marginal increment in the complexity, restricted to medium signal‐to‐noise‐ratio regions, is observed.

BibTEX Reference Entry 

@article{HeHuSc19,
	author = {Qinwei He and Yulin Hu and Anke Schmeink},
	title = "A Seysen’s Algorithm based Incremental Lattice Reduction",
	pages = "1-23",
	journal = "Transactions on Emerging Telecommunications Technologies",
	volume = "30",
	number = "7",
	doi = 10.1002/ett.3596,
	month = Mar,
	year = 2019,
	hsb = RWTH-2019-11686,
	}

Downloads

 Download bibtex-file

Sorry, this paper is currently not available for download.