NDLI: Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding

Content Provider	IEEE Xplore Digital Library
Author	Liu, S. Ling, C. Stehle, D.
Copyright Year	1963
Abstract	Despite its reduced complexity, lattice reduction-aided decoding exhibits a widening gap to maximum-likelihood (ML) performance as the dimension increases. To improve its performance, this paper presents randomized lattice decoding based on Klein's sampling technique, which is a randomized version of Babai's nearest plane algorithm [i.e., successive interference cancelation (SIC)] and samples lattice points from a Gaussian-like distribution over the lattice. To find the closest lattice point, Klein's algorithm is used to sample some lattice points and the closest among those samples is chosen. Lattice reduction increases the probability of finding the closest lattice point, and only needs to be run once during preprocessing. Further, the sampling can operate very efficiently in parallel. The technical contribution of this paper is twofold: we analyze and optimize the decoding radius of sampling decoding resulting in better error performance than Klein's original algorithm, and propose a very efficient implementation of random rounding. Of particular interest is that a fixed gain in the decoding radius compared to Babai's decoding can be achieved at polynomial complexity. The proposed decoder is useful for moderate dimensions where sphere decoding becomes computationally intensive, while lattice reduction-aided decoding starts to suffer considerable loss. Simulation results demonstrate near-ML performance is achieved by a moderate number of samples, even if the dimension is as high as 32.
Sponsorship	IEEE Information Theory Society
Starting Page	5933
Ending Page	5945
Page Count	13
File Size	1260994
File Format	PDF
ISSN	00189448
Volume Number	57
Issue Number	9
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-09-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	Lattices Silicon carbide Complexity theory Maximum likelihood decoding MIMO Encoding randomized algorithms Bounded distance decoding lattice decoding lattice reduction
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

Derandomized sampling algorithm for lattice decoding

A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming

Decoding by Sampling — Part II: Derandomization and Soft-Output Decoding

Encoding and Decoding Binary Product Lattices

Augmented Lattice Reduction for MIMO Decoding

Achieving a Vanishing SNR Gap to Exact Lattice Decoding at a Subexponential Complexity

The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions

A bounded-distance decoding algorithm for lattices obtained from a generalized code formula

Faster Recursions in Sphere Decoding

Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding

Similar Documents

Derandomized sampling algorithm for lattice decoding

A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming

Decoding by Sampling — Part II: Derandomization and Soft-Output Decoding

Encoding and Decoding Binary Product Lattices

Augmented Lattice Reduction for MIMO Decoding

Achieving a Vanishing SNR Gap to Exact Lattice Decoding at a Subexponential Complexity

The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions

A bounded-distance decoding algorithm for lattices obtained from a generalized code formula

Faster Recursions in Sphere Decoding

Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding