Decoding by Sampling - Part II: Derandomization and Soft-output Decoding
arXiv:1305.5762 · doi:10.1109/TCOMM.2013.101813.130500
Abstract
In this paper, a derandomized algorithm for sampling decoding is proposed to achieve near-optimal performance in lattice decoding. By setting a probability threshold to sample candidates, the whole sampling procedure becomes deterministic, which brings considerable performance improvement and complexity reduction over to the randomized sampling. Moreover, the upper bound on the sample size K, which corresponds to near-maximum likelihood (ML) performance, is derived. We also find that the proposed algorithm can be used as an efficient tool to implement soft-output decoding in multiple-input multiple-output (MIMO) systems. An upper bound of the sphere radius R in list sphere decoding (LSD) is derived. Based on it, we demonstrate that the derandomized sampling algorithm is capable of achieving near-maximum a posteriori (MAP) performance. Simulation results show that near-optimum performance can be achieved by a moderate size K in both lattice decoding and soft-output decoding.
arXiv commentsubmitted to IEEE Transaction on Communications 2013
References in corpus (4)
- On the Proximity Factors of Lattice Reduction-Aided Decoding
- DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models
- Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding
- Decoding by Embedding: Correct Decoding Radius and DMT Optimality
Cited by in corpus (5)
- Markov Chain Monte Carlo Algorithms for Lattice Gaussian Sampling
- Sphere Decoding Revisited
- Deterministic Sampling Decoding: Where Sphere Decoding Meets Lattice Gaussian Distribution
- Markov chain Monte Carlo Methods For Lattice Gaussian Sampling: Lattice Reduction and Decoding Optimization
- Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling