NDLI: Effects of the LLL Reduction on the Success Probability of the Babai Point and on the Complexity of Sphere Decoding

Content Provider	IEEE Xplore Digital Library
Author	Xiao-Wen Chang Jinming Wen Xiaohu Xie
Copyright Year	1963
Abstract	A common method to estimate an unknown integer parameter vector in a linear model is to solve an integer least squares (ILS) problem. A typical approach to solving an ILS problem is sphere decoding. To make a sphere decoder faster, the well-known LLL reduction is often used as preprocessing. The Babai point produced by the Babai nearest plane algorithm is a suboptimal solution of the ILS problem. First, we prove that the success probability of the Babai point as a lower bound on the success probability of the ILS estimator is sharper than the lower bound given by Hassibi and Boyd [1]. Then, we show rigorously that applying the LLL reduction algorithm will increase the success probability of the Babai point and give some theoretical and numerical test results. We give examples to show that unlike LLL's column permutation strategy, two often used column permutation strategies SQRD and V-BLAST may decrease the success probability of the Babai point. Finally, we show rigorously that applying the LLL reduction algorithm will also reduce the computational complexity of sphere decoders, which is measured approximately by the number of nodes in the search tree in the literature.
Sponsorship	IEEE Information Theory Society
Starting Page	4915
Ending Page	4926
Page Count	12
File Size	3621353
File Format	PDF
ISSN	00189448
Volume Number	59
Issue Number	8
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vectors Complexity theory Least squares approximations Approximation algorithms Maximum likelihood decoding success probability Babai point complexity integer least squares (ILS) problem LLL reduction sphere decoding
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Effects of the LLL reduction on the success probability of the Babai point and on the complexity of sphere decoding

ML Symbol Detection Based on the Shortest Path Algorithm for MIMO Systems

On the sphere-decoding algorithm I. Expected complexity

A low-complexity generalized sphere decoding approach for underdetermined linear communication systems: performance and complexity evaluation

Selection of Design Parameters for Generalized Sphere Decoding Algorithms

Approximate Integer Common Divisor Problem Relates to Implicit Factorization

Iterative Tomographic Solution of Integer Least Squares Problems With Applications to MIMO Detection

Sparsity-Aware Sphere Decoding: Algorithms and Complexity Analysis

Speeding up the Sphere Decoder With $H^{infty }$ and SDP Inspired Lower Bounds

Effects of the LLL Reduction on the Success Probability of the Babai Point and on the Complexity of Sphere Decoding

Similar Documents

Effects of the LLL reduction on the success probability of the Babai point and on the complexity of sphere decoding

ML Symbol Detection Based on the Shortest Path Algorithm for MIMO Systems

On the sphere-decoding algorithm I. Expected complexity

A low-complexity generalized sphere decoding approach for underdetermined linear communication systems: performance and complexity evaluation

Selection of Design Parameters for Generalized Sphere Decoding Algorithms

Approximate Integer Common Divisor Problem Relates to Implicit Factorization

Iterative Tomographic Solution of Integer Least Squares Problems With Applications to MIMO Detection

Sparsity-Aware Sphere Decoding: Algorithms and Complexity Analysis

Speeding up the Sphere Decoder With $H^{infty }$ and SDP Inspired Lower Bounds

Effects of the LLL Reduction on the Success Probability of the Babai Point and on the Complexity of Sphere Decoding