pith. sign in

arxiv: 1907.09119 · v1 · pith:YJJEUCDNnew · submitted 2019-07-22 · 💻 cs.IT · math.IT

Deterministic Sampling Decoding: Where Sphere Decoding Meets Lattice Gaussian Distribution

Zheng Wang , Cong Ling , Shi Jin This is my paper

Pith reviewed 2026-05-24 18:21 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords sphere decodinglattice Gaussian distributionFincke-Pohst algorithmMIMO detectionbounded distance decodingpruning sizeregularization termequivalent sphere decoding
0
0 comments X

The pith

Sphere decoding recovers the Fincke-Pohst algorithm by setting radius D to σ√(2lnK), bounding node visits below nK.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper links sphere decoding to lattice Gaussian sampling by expressing the Euclidean sphere radius through an initial pruning size K, a standard deviation σ, and a regularization term. This parameterization yields an equivalent sphere decoding algorithm that matches the classic Fincke-Pohst method exactly while delivering an explicit upper bound of fewer than nK visited nodes when σ is held fixed. A regularized variant further improves the performance-complexity trade-off by incorporating Klein sampling probabilities, and a candidate-protection rule extends both methods from maximum-likelihood to bounded-distance decoding for small K. MIMO detection simulations illustrate that the resulting trade-off depends only on the choice of K.

Core claim

By characterizing the sphere radius D via the lattice Gaussian distribution parameters K, σ and ρ_σ,y(Λ), the equivalent sphere decoding algorithm is identical to the classic Fincke-Pohst enumeration yet admits a complexity bound |S| < nK; the regularized sphere decoding algorithm, which employs Klein's sampling probability, achieves a superior trade-off, and the candidate-protection criterion generalizes both algorithms to bounded-distance decoding.

What carries the argument

Equivalent sphere decoding (ESD) that sets D = σ√(2lnK) and recovers Fincke-Pohst enumeration with a node-visit bound controlled by K.

If this is right

  • Complexity measured by visited nodes is strictly upper-bounded by nK for fixed σ.
  • The performance-complexity trade-off becomes a function of the single parameter K.
  • Regularized SD improves the trade-off relative to ESD by exploiting the regularization terms.
  • Candidate protection extends the methods from ML decoding to bounded-distance decoding when K is small.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same radius parameterization could be tested on other lattice problems such as integer least-squares beyond MIMO.
  • Fixing σ may enable direct comparison of SD variants across different lattice dimensions without re-tuning radius heuristics.
  • The candidate-protection rule might be combined with other sampling distributions to further control error floors.

Load-bearing premise

The sphere radius can be rewritten in terms of K, σ and the regularization term so that the classic enumeration is recovered and the node-visit count stays strictly below nK for suitable fixed σ.

What would settle it

An explicit lattice, query vector y and fixed σ for which the ESD algorithm visits more than nK nodes on some instance.

Figures

Figures reproduced from arXiv: 1907.09119 by Cong Ling, Shi Jin, Zheng Wang.

Figure 1
Figure 1. Figure 1: Illustration of a two-dimensional lattice Gaussian [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Illustration of the proposed regularized sphere dec [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Average number of decoding candidates |L| versus number of K for various uncoded MIMO systems using 64-QAM at SNR per bit = 17dB. node at decoding layer i can be written as p(x j i )=    e − 1 2σ2 i ((j−1)/2+d) 2 /ρσi,xei (Z) when j is odd, e − 1 2σ2 i ( j 2 −d) 2 /ρσi,xei (Z) when j is even, (87) where 1 2 ≥ d = |x 1 i − xei | ≥ 0. Therefore, the summation probability of the first 2N candidate nodes wi… view at source ↗
Figure 6
Figure 6. Figure 6: Complexity comparison in flops for the uncoded MIMO sy [PITH_FULL_IMAGE:figures/full_fig_p013_6.png] view at source ↗
Figure 5
Figure 5. Figure 5: Bit error rate versus average SNR per bit for the uncod [PITH_FULL_IMAGE:figures/full_fig_p013_5.png] view at source ↗
read the original abstract

In this paper, the paradigm of sphere decoding (SD) based on lattice Gaussian distribution is studied, where the sphere radius $D>0$ in the sense of Euclidean distance is characterized by the initial pruning size $K>1$, the standard deviation $\sigma>0$ and a regularization term $\rho_{\sigma,\mathbf{y}}(\Lambda)>0$ ($\Lambda$ denotes the lattice, $\mathbf{y}$ is the query point). In this way, extra freedom is obtained for analytical diagnosis of both the decoding performance and complexity. Based on it, the equivalent SD (ESD) algorithm is firstly proposed, and we show it is exactly the same with the classic Fincke-Pohst SD but characterizes the sphere radius with $D=\sigma\sqrt{2\ln K}$. By fixing $\sigma$ properly, we show that the complexity of ESD measured by the number of visited nodes is upper bounded by $|S|<nK$, thus resulting in a tractable decoding trade-off solely determined by $K$. In order to further exploit the decoding potential, the regularized SD (RSD) algorithm based on Klein's sampling probability is proposed, which achieves a better decoding trade-off than the equivalent SD by fully utilizing the regularization terms. Moreover, besides the designed criterion of pruning threshold, another decoding criterion named as candidate protection is proposed to solve the decoding problems in the cases of small $K$, which generalizes both the regularized SD and equivalent SD from maximum likelihood (ML) decoding to bounded distance decoding (BDD). Finally, simulation results based on MIMO detection are presented to confirm the tractable decoding trade-off of the proposed lattice Gaussian distribution-based SD algorithms.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 2 minor

Summary. The paper studies sphere decoding through the lens of the lattice Gaussian distribution. It claims that the sphere radius D can be expressed via an initial pruning size K, standard deviation σ and regularization term ρ_σ,y(Λ), yielding an equivalent sphere decoding (ESD) algorithm that is identical to classic Fincke-Pohst enumeration but with the explicit radius D=σ√(2lnK). By suitable choice of σ the number of visited nodes is asserted to satisfy the uniform bound |S|<nK. The manuscript further introduces regularized SD (RSD) that exploits Klein sampling probabilities and a candidate-protection rule that extends both algorithms from ML to bounded-distance decoding; MIMO detection simulations are presented to illustrate the resulting K-parameterized complexity-performance trade-off.

Significance. If the claimed exact equivalence to Fincke-Pohst and the instance-independent node-visit bound |S|<nK can be established rigorously, the work would supply a deterministic, K-only complexity characterization for sphere decoding that is currently unavailable in the literature. The explicit link between lattice-Gaussian regularization and pruning radius also opens a route to analytic trade-off curves that could be useful for MIMO detector design. The candidate-protection generalization to BDD is a secondary but potentially useful contribution.

major comments (3)
  1. [Abstract] Abstract (paragraph on ESD): the statement that ESD 'is exactly the same with the classic Fincke-Pohst SD but characterizes the sphere radius with D=σ√(2lnK)' omits the regularization term ρ_σ,y(Λ) that is introduced two sentences earlier. Because ρ_σ,y(Λ) is y- and lattice-dependent, it is unclear whether substituting D=σ√(2lnK) recovers the classic enumeration for every received vector or only approximately when ρ≈1.
  2. [Abstract] Abstract (complexity claim): the assertion that 'by fixing σ properly' the visited-node count satisfies |S|<nK is presented without derivation steps or error analysis. The skeptic note correctly flags that an instance-dependent ρ prevents a single fixed σ from guaranteeing the bound uniformly across all y; the manuscript must therefore supply an explicit argument showing how σ is chosen independently of y while still preserving both the exact FP equivalence and the strict inequality |S|<nK.
  3. [RSD introduction] The transition from ESD to RSD (section introducing Klein sampling) relies on the same radius characterization; any gap in the ESD equivalence proof therefore propagates directly to the claimed improvement of RSD over ESD.
minor comments (2)
  1. [Abstract] Notation: the symbol ρ_σ,y(Λ) is introduced in the abstract but its precise definition (normalizer of the lattice Gaussian) is not restated when the radius formula is given; a one-line reminder would improve readability.
  2. [Simulation results] Simulation section: the MIMO detection results are said to 'confirm the tractable decoding trade-off,' yet no table or figure caption indicates the lattice dimension n, the range of K, or the SNR points at which the |S|<nK bound was observed; these details should be added for reproducibility.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading and valuable comments. We address the major comments point by point below.

read point-by-point responses

  1. Referee: [Abstract] Abstract (paragraph on ESD): the statement that ESD 'is exactly the same with the classic Fincke-Pohst SD but characterizes the sphere radius with D=σ√(2lnK)' omits the regularization term ρ_σ,y(Λ) that is introduced two sentences earlier. Because ρ_σ,y(Λ) is y- and lattice-dependent, it is unclear whether substituting D=σ√(2lnK) recovers the classic enumeration for every received vector or only approximately when ρ≈1.

    Authors: We agree the abstract could be improved for clarity. The ESD sets the sphere radius to D=σ√(2lnK) and performs the identical enumeration as Fincke-Pohst. The regularization term ρ is part of the motivating distribution but does not change the enumeration steps or the radius used. We will revise the abstract to state this more explicitly and avoid any implication that ρ is omitted from the overall framework. revision: yes

  2. Referee: [Abstract] Abstract (complexity claim): the assertion that 'by fixing σ properly' the visited-node count satisfies |S|<nK is presented without derivation steps or error analysis. The skeptic note correctly flags that an instance-dependent ρ prevents a single fixed σ from guaranteeing the bound uniformly across all y; the manuscript must therefore supply an explicit argument showing how σ is chosen independently of y while still preserving both the exact FP equivalence and the strict inequality |S|<nK.

    Authors: The abstract states the complexity result without including the derivation. The full paper provides the analysis for the bound |S|<nK. To directly address the issue with ρ being y-dependent, we will add an explicit argument in the revised version explaining the choice of σ (independent of y) that preserves the bound for all instances while keeping the FP equivalence. revision: yes

  3. Referee: [RSD introduction] The transition from ESD to RSD (section introducing Klein sampling) relies on the same radius characterization; any gap in the ESD equivalence proof therefore propagates directly to the claimed improvement of RSD over ESD.

    Authors: Any revisions to the ESD radius characterization will be reflected in the RSD section. The RSD uses the same radius but leverages the full Klein sampling which utilizes the regularization terms for improved performance. We will update the transition text to emphasize this connection. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation remains self-contained

full rationale

The abstract presents the ESD equivalence to Fincke-Pohst SD via the radius formula D=σ√(2lnK) and the subsequent |S|<nK bound as analytical results obtained after characterizing the radius with K, σ and ρ. No quoted equations demonstrate that the bound reduces to the input K by construction, nor is any self-citation, uniqueness theorem, or ansatz smuggling used to justify the central claims. The dependence on fixing σ is stated as a premise for the bound rather than a tautological redefinition, leaving the derivation independent of its own outputs.

Axiom & Free-Parameter Ledger

2 free parameters · 1 axioms · 0 invented entities

The central claims rest on the unshown equivalence between the Gaussian-radius formulation and classic Fincke-Pohst enumeration plus the assumption that fixing σ yields a strict nK node bound; no independent evidence or machine-checked proof is referenced.

free parameters (2)
  • K
    Initial pruning size used to set the sphere radius and bound complexity; appears as a design parameter.
  • σ
    Standard deviation of the lattice Gaussian; must be fixed properly to obtain the |S|<nK bound.
axioms (1)
  • domain assumption Lattice Gaussian distribution allows the sphere radius to be expressed as D = σ√(2 ln K) while preserving exact equivalence to Fincke-Pohst enumeration.
    Invoked when defining ESD in the abstract.

pith-pipeline@v0.9.0 · 5831 in / 1360 out tokens · 22643 ms · 2026-05-24T18:21:48.246283+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

54 extracted references · 54 canonical work pages · 1 internal anchor

  1. [1]

    On Lov´ asz’ lattice reduction and the nearest lattice point problem,

    L. Babai, “On Lov´ asz’ lattice reduction and the nearest lattice point problem,” Combinatorica, vol. 6, no. 1, pp. 1–13, 1986

    work page 1986

  2. [2]

    Lattice-reduction-aided detect ors for MIMO communication systems,

    H. Y ao and G. Wornell, “Lattice-reduction-aided detect ors for MIMO communication systems,” in Proc. IEEE Globecom , Taipei, China, Nov. 2002, pp. 424–428

    work page 2002

  3. [3]

    LLL reduct ion achieves the receive diversity in MIMO decoding,

    M. Taherzadeh, A. Mobasher, and A. Khandani, “LLL reduct ion achieves the receive diversity in MIMO decoding,” IEEE Trans. Inform. Theory, vol. 53, pp. 4801–4805, Dec. 2007

    work page 2007

  4. [4]

    DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system mod els,

    J. Jalden and P . Elia, “DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system mod els,” IEEE Trans. Inform. Theory , vol. 56, no. 10, pp. 4765–4780, Oct. 2010

    work page 2010

  5. [5]

    On the proximity factors of lattice reduction- aided decoding,

    C. Ling, “On the proximity factors of lattice reduction- aided decoding,” IEEE Trans. Signal Process. , vol. 59, no. 6, pp. 2795–2808, Jun. 2011

    work page 2011

  6. [6]

    Improved algorithms for integer programmin g and related lattice problems,

    R. Kannan, “Improved algorithms for integer programmin g and related lattice problems,” in Proc ACM Symp. Theory of Computing , Boston, Apr. 1983, pp. 193–206

    work page 1983

  7. [7]

    Closest p oint search in lattices,

    E. Agrell, T. Eriksson, A. V ardy, and K. Zeger, “Closest p oint search in lattices,” IEEE Trans. Inform. Theory , vol. 48, no. 8, pp. 2201–2214, Aug. 2002

    work page 2002

  8. [8]

    On the sphere-decoding algori thm I. Ex- pected complexity,

    B. Hassibi and H. Vikalo, “On the sphere-decoding algori thm I. Ex- pected complexity,” IEEE Trans. Signal Process. , vol. 53, pp. 2806– 2818, Aug. 2005

    work page 2005

  9. [9]

    On maximum-likeli hood detection and the search for the closest lattice point,

    M. O. Damen, H. E. Gamal, and G. Caire, “On maximum-likeli hood detection and the search for the closest lattice point,” IEEE Trans. Inform. Theory , vol. 49, pp. 2389–2401, Oct. 2003

    work page 2003

  10. [10]

    Iterative decod ing for MIMO channels via modified sphere decoding,

    H. Vikalo, B. Hassibi, and T. Kailath, “Iterative decod ing for MIMO channels via modified sphere decoding,” IEEE Trans. Wireless Commun., vol. 3, no. 6, pp. 2299 – 2311, Nov. 2004

    work page 2004

  11. [11]

    T he error probability of the fixed-complexity sphere decoder,

    J. Jalden, L. Barbero, B. Ottersten, and J. Thompson, “T he error probability of the fixed-complexity sphere decoder,” IEEE Trans. Signal Process., vol. 57, pp. 2711–2720, Jul. 2009

    work page 2009

  12. [12]

    Relaxed k-best MIMO signal detector design and vlsi implementation,

    S. Chen, T. Zhang, and Y . Xin, “Relaxed k-best MIMO signal detector design and vlsi implementation,” IEEE Transactions on V ery Large Scale Integration (VLSI) Systems , vol. 15, no. 3, pp. 328–337, March 2007

    work page 2007

  13. [13]

    Decoding by embeddin g: correct decoding radius and DMT optimality,

    L. Luzzi, D. Stehl´ e, and C. Ling, “Decoding by embeddin g: correct decoding radius and DMT optimality,” IEEE Trans. Inform. Theory , vol. 59, no. 5, pp. 2960–2973, 2013

    work page 2013

  14. [14]

    Layered Tabu search algorithm for large-MIMO detection and a lower bound on ML performance,

    N. Srinidhi, T. Datta, A. Chockalingam, and B. S. Rajan, “Layered Tabu search algorithm for large-MIMO detection and a lower bound on ML performance,” IEEE Transactions on Communications , vol. 59, no. 11, pp. 2955–2963, Nov. 2011

    work page 2011

  15. [15]

    Low-compl exity soft-output signal detection based on Gauss-Seidel method for uplink multiuser large-scale MIMO systems,

    L. Dai, X. Gao, X. Su, S. Han, C. I, and Z. Wang, “Low-compl exity soft-output signal detection based on Gauss-Seidel method for uplink multiuser large-scale MIMO systems,” IEEE Transactions on V ehicular Technology, vol. 64, no. 10, pp. 4839–4845, Oct. 2015

    work page 2015

  16. [16]

    Low complexity po lynomial expansion detector with deterministic equivalents of the m oments of channel Gram matrix for massive MIMO uplink,

    A. Lu, X. Gao, Y . R. Zheng, and C. Xiao, “Low complexity po lynomial expansion detector with deterministic equivalents of the m oments of channel Gram matrix for massive MIMO uplink,” IEEE Transactions on Communications , vol. 64, no. 2, pp. 586–600, Feb. 2016

    work page 2016

  17. [17]

    Low-co mplexity iterative detection for large-scale multiuser MIMO-OFDM s ystems using approximate message passing,

    S. Wu, L. Kuang, Z. Ni, J. Lu, D. Huang, and Q. Guo, “Low-co mplexity iterative detection for large-scale multiuser MIMO-OFDM s ystems using approximate message passing,” IEEE Journal of Selected Topics in Signal Processing, vol. 8, no. 5, pp. 902–915, Oct. 2014

    work page 2014

  18. [18]

    Low-complexity detection in large-dimension MIMO-ISI ch annels us- ing graphical models,

    P . Som, T. Datta, N. Srinidhi, A. Chockalingam, and B. S. Rajan, “Low-complexity detection in large-dimension MIMO-ISI ch annels us- ing graphical models,” IEEE Journal of Selected Topics in Signal Processing, vol. 5, no. 8, pp. 1497–1511, Dec 2011

    work page 2011

  19. [19]

    Op- timized Markov Chain Monte Carlo for signal detection in MIM O systems: An analysis of the stationary distribution and mix ing time,

    B. Hassibi, M. Hansen, A. Dimakis, H. Alshamary, and W. X u, “Op- timized Markov Chain Monte Carlo for signal detection in MIM O systems: An analysis of the stationary distribution and mix ing time,” IEEE Transactions on Signal Processing , vol. 62, no. 17, pp. 4436– 4450, Sep. 2014

    work page 2014

  20. [20]

    A nov el Monte Carlo sampling based receiver for large-scale uplink multi user MIMO systems,

    T. Datta, N. Kumar, A. Chockalingam, and B. Rajan, “A nov el Monte Carlo sampling based receiver for large-scale uplink multi user MIMO systems,” IEEE Transactions on V ehicular Technology, , vol. 62, no. 7, pp. 3019–3038, Sep. 2013

    work page 2013

  21. [21]

    Multilevel sequential Monte C arlo al- gorithms for MIMO demodulation,

    P . Aggarwal and X. Wang, “Multilevel sequential Monte C arlo al- gorithms for MIMO demodulation,” IEEE Transactions on Wireless Communications, vol. 6, no. 2, pp. 750–758, Feb. 2007

    work page 2007

  22. [22]

    An MCMC-MIMO detector as a stochastic linear s ystem solver using successive overrelexation,

    J. Choi, “An MCMC-MIMO detector as a stochastic linear s ystem solver using successive overrelexation,” IEEE Transactions on Wireless Communications, vol. 15, no. 2, pp. 1445–1455, Feb. 2016

    work page 2016

  23. [23]

    Finding the closest lattice vector when it is unusually close,

    P . Klein, “Finding the closest lattice vector when it is unusually close,” in ACM-SIAM Symp. Discr . Algorithms, 2000, pp. 937–941. 15

    work page 2000

  24. [24]

    Decoding by sampling: A randomized lattice algorithm for bounded distance decoding,

    S. Liu, C. Ling, and D. Stehl´ e, “Decoding by sampling: A randomized lattice algorithm for bounded distance decoding,” IEEE Trans. Inform. Theory, vol. 57, pp. 5933–5945, Sep. 2011

    work page 2011

  25. [25]

    Decoding by sampling - Part II: Derandomization and soft-output decoding,

    Z. Wang, S. Liu, and C. Ling, “Decoding by sampling - Part II: Derandomization and soft-output decoding,” IEEE Trans. Commun. , vol. 61, no. 11, pp. 4630–4639, Nov. 2013

    work page 2013

  26. [26]

    Convergence analysis and c omparisons of Markov chain Monte Carlo algorithms in digital communica tions,

    R. Chen, J. Liu, and X. Wang, “Convergence analysis and c omparisons of Markov chain Monte Carlo algorithms in digital communica tions,” IEEE Trans. on Signal Process. , vol. 50, no. 2, pp. 255–270, 2002

    work page 2002

  27. [27]

    Markov chain Monte Carl o al- gorithms for lattice Gaussian sampling,

    Z. Wang, C. Ling, and G. Hanrot, “Markov chain Monte Carl o al- gorithms for lattice Gaussian sampling,” in Proc. IEEE International Symposium on Information Theory (ISIT) , Honolulu, USA, Jun. 2014, pp. 1489–1493

    work page 2014

  28. [28]

    On perfo rmance of sphere decoding and Markov chain Monte Carlo detection meth ods,

    H. Zhu, B. Farhang-Boroujeny, and R.-R. Chen, “On perfo rmance of sphere decoding and Markov chain Monte Carlo detection meth ods,” IEEE Signal Processing Letters , vol. 12, no. 10, pp. 669–672, 2005

    work page 2005

  29. [29]

    On the geometric ergodicity of Metr opolis- Hastings algorithms for lattice Gaussian sampling,

    Z. Wang and C. Ling, “On the geometric ergodicity of Metr opolis- Hastings algorithms for lattice Gaussian sampling,” IEEE Transactions on Information Theory , vol. 64, no. 2, pp. 738–751, Feb. 2018

    work page 2018

  30. [30]

    Lattice Gaussian sampling by Markov chain Monte Ca rlo: Bounded distance decoding and trapdoor sampling,

    ——, “Lattice Gaussian sampling by Markov chain Monte Ca rlo: Bounded distance decoding and trapdoor sampling,” IEEE Transactions on Information Theory , vol. 65, no. 6, pp. 3630–3645, June 2019

    work page 2019

  31. [31]

    On the complexity of sphere d ecoding in digital communications,

    J. Jalden and B. Ottersen, “On the complexity of sphere d ecoding in digital communications,” IEEE Trans. Signal Process. , vol. 53, pp. 1474–1484, Aug. 2005

    work page 2005

  32. [32]

    A unifi ed frame- work for tree search decoding: rediscovering the sequentia l decoder,

    A.D.Murugan, H. E. Gamal, M. Damen, and G.Caire, “A unifi ed frame- work for tree search decoding: rediscovering the sequentia l decoder,” IEEE Trans. Inform. Theory , vol. 52, pp. 933– 953, 2006

    work page 2006

  33. [33]

    Statistical pruning for ne ar-maximum likelihood decoding,

    R. Gowaikar and B. Hassibi, “Statistical pruning for ne ar-maximum likelihood decoding,” IEEE Trans. Signal Process. , vol. 55, no. 6, pp. 2661–2675, Jun. 2007

    work page 2007

  34. [34]

    Faster recursions in sph ere decoding,

    A. Ghasemmehdi and E. Agrell, “Faster recursions in sph ere decoding,” IEEE Transactions on Information Theory , vol. 57, no. 6, pp. 3530– 3536, June 2011

    work page 2011

  35. [35]

    Noncooperative cellular wireless wit h unlimited num- bers of base station antennas,

    T. L. Marzetta, “Noncooperative cellular wireless wit h unlimited num- bers of base station antennas,” IEEE Transactions on Wireless Commu- nications, vol. 9, no. 11, pp. 3590–3600, November 2010

    work page 2010

  36. [36]

    Massive MIMO for next generation wireless systems,

    E. G. Larsson, O. Edfors, F. Tufvesson, and T. L. Marzett a, “Massive MIMO for next generation wireless systems,” IEEE Communications Magazine, vol. 52, no. 2, pp. 186–195, February 2014

    work page 2014

  37. [37]

    Scaling up MIMO: Opportunitie s and challenges with very large arrays,

    F. Rusek, D. Persson, B. K. Lau, E. G. Larsson, T. L. Marze tta, O. Edfors, and F. Tufvesson, “Scaling up MIMO: Opportunitie s and challenges with very large arrays,” IEEE Signal Processing Magazine , vol. 30, no. 1, pp. 40–60, Jan 2013

    work page 2013

  38. [38]

    Energy and s pectral efficiency of very large multiuser MIMO systems,

    H. Q. Ngo, E. G. Larsson, and T. L. Marzetta, “Energy and s pectral efficiency of very large multiuser MIMO systems,” IEEE Transactions on Communications , vol. 61, no. 4, pp. 1436–1449, April 2013

    work page 2013

  39. [39]

    Augmented performance bounds o n strictly linear and widely linear estimators with complex data,

    Y . Xia and D. P . Mandic, “Augmented performance bounds o n strictly linear and widely linear estimators with complex data,” IEEE Trans. on Signal Process. , vol. 66, no. 2, pp. 507–514, Jan 2018

    work page 2018

  40. [40]

    Improved methods for calculati ng vectors of short length in a lattice, including a complexity analysis,

    U. Fincke and M. Pohst, “Improved methods for calculati ng vectors of short length in a lattice, including a complexity analysis, ” Math. Comp.,, vol. 44, pp. 463–471, Apr. 1985

    work page 1985

  41. [41]

    On the computation of lattice vectors of mini mal length, successive minima and reduced basis with applications,

    M. Pohst, “On the computation of lattice vectors of mini mal length, successive minima and reduced basis with applications,” in Proc ACM SIGSAM, vol. 15, 1981, pp. 37–44

    work page 1981

  42. [42]

    Worst-case to average-cas e reductions based on Gaussian measures,

    D. Micciancio and O. Regev, “Worst-case to average-cas e reductions based on Gaussian measures,” in Proc. Ann. Symp. F ound. Computer Science, Rome, Italy, Oct. 2004, pp. 372–381

    work page 2004

  43. [43]

    Trapdoo rs for hard lattices and new cryptographic constructions,

    C. Gentry, C. Peikert, and V . V aikuntanathan, “Trapdoo rs for hard lattices and new cryptographic constructions,” in Proc. 40th Ann. ACM Symp. Theory of Comput. , Victoria, Canada, 2008, pp. 197–206

    work page 2008

  44. [44]

    Discrete Gaussian Sampling Reduces to CVP and SVP

    N. Stephens-Davidowitz, “Discrete Gaussian sampling reduces to CVP and SVP,” submitted for publication. [Online]. Availab le: http://arxiv.org/abs/1506.07490

    work page internal anchor Pith review Pith/arXiv arXiv

  45. [45]

    J. H. Conway and N. A. Sloane, Sphere Packings, Lattices and Groups . New Y ork: Springer-V erlag, 1998

    work page 1998

  46. [46]

    On the complexity distribution of sphere decoding,

    D. Seethaler, J. Jalden, C. Studer, and H. Bolcskei, “On the complexity distribution of sphere decoding,” IEEE Transactions on Information Theory, vol. 57, no. 9, pp. 5754–5768, Sep. 2011

    work page 2011

  47. [47]

    Sphere decoding complexity expo nent for decoding full-rate codes over the quasi-static mimo channe l,

    J. Jalden and P . Elia, “Sphere decoding complexity expo nent for decoding full-rate codes over the quasi-static mimo channe l,” IEEE Transactions on Information Theory , vol. 58, no. 9, pp. 5785–5803, Sep. 2012

    work page 2012

  48. [48]

    Performance and complex ity analysis of infinity-norm sphere-decoding,

    D. Seethaler and H. Bolcskei, “Performance and complex ity analysis of infinity-norm sphere-decoding,” IEEE Transactions on Information Theory, vol. 56, no. 3, pp. 1085–1105, March 2010

    work page 2010

  49. [49]

    Factoring p olynomials with rational coefficients,

    A. K. Lenstra, H. W. Lenstra, and L. Lovasz, “Factoring p olynomials with rational coefficients,” Math. Annalen, vol. 261, pp. 515–534, 1982

    work page 1982

  50. [50]

    Lattice problems in NP ∩ coNP

    D. Aharonov and O. Regev, “Lattice problems in NP ∩ coNP.” J. ACM, vol. 52, no. 5, pp. 749–765, 2005

    work page 2005

  51. [51]

    Decoding by emb ed- ding:correct decoding radius and DMT optimality,

    C. Ling, S. Liu, L. Luzzi, and D. Stehle, “Decoding by emb ed- ding:correct decoding radius and DMT optimality,” in Proc. Int. Symp. Inform. Theory , submitted for publication

    work page

  52. [52]

    Low-complexity soft-output decodi ng with lattice-reduction-aided detectors,

    W. Zhang and X. Ma, “Low-complexity soft-output decodi ng with lattice-reduction-aided detectors,” IEEE Trans. Commun. , vol. 58, no. 9, pp. 2621–2629, Sep. 2010

    work page 2010

  53. [53]

    Iterative lattice reducti on aided MMSE list detection in MIMO system,

    T. Shimokawa and T. Fujino, “Iterative lattice reducti on aided MMSE list detection in MIMO system,” in Proc. IEEE International Conference on Advanced Technologies for Communications , Oct. 2008, pp. 50–54

    work page 2008

  54. [54]

    Counting the floating point operations (FLOPS ),

    H. Qian, “Counting the floating point operations (FLOPS ),” MATLAB Central File Exchange , no. 50608, June, 2015

    work page 2015