On the sphere-decoding algorithm I. Expected complexity
… ) complexity of sphere decoding and perhaps even some of its higher order moments.In
what follows, we will give a rough argument for the expected complexity of sphere decoding …
what follows, we will give a rough argument for the expected complexity of sphere decoding …
A new reduced-complexity sphere decoder for multiple antenna systems
AM Chan, I Lee - … . Conference Proceedings. ICC 2002 (Cat. No …, 2002 - ieeexplore.ieee.org
… initial choice of sphere radius. In this paper, we present a new sphere decoding algorithm
which is even less computationally complex than the original sphere decoder. Moreover, the …
which is even less computationally complex than the original sphere decoder. Moreover, the …
On the complexity of sphere decoding in digital communications
J Jaldén, B Ottersten - IEEE transactions on signal processing, 2005 - ieeexplore.ieee.org
Sphere decoding has been suggested by a number of … an algorithm of polynomial complexity
without clearly specifying what … -case complexity is exponential, the expected complexity of …
without clearly specifying what … -case complexity is exponential, the expected complexity of …
On the expected complexity of sphere decoding
… expected complexity, averaged over the noise and over the lattice. For the “sphere decoding…
for the expected complexity and show that for a wide range of noise variances the expected …
for the expected complexity and show that for a wide range of noise variances the expected …
Reduced complexity sphere decoding via a reordered lattice representation
L Azzam, E Ayanoglu - IEEE Transactions on Communications, 2009 - ieeexplore.ieee.org
… Sphere Decoding (SD) where the real and imaginary parts of each jointly detected symbol
are decoded … technique, we reduce the decoding complexity substantially. We show that this …
are decoded … technique, we reduce the decoding complexity substantially. We show that this …
Low-complexity sphere decoding of polar codes based on optimum path metric
K Niu, K Chen, J Lin - IEEE Communications Letters, 2014 - ieeexplore.ieee.org
… of maximum likelihood (ML) decoding. But the complexity of the conventional sphere
decoder is still high, where the candidates in a target sphere are enumerated and the radius is …
decoder is still high, where the candidates in a target sphere are enumerated and the radius is …
On the complexity distribution of sphere decoding
We analyze the (computational) complexity distribution of sphere decoding (SD) for random
infinite lattices. In particular, we show that under fairly general assumptions on the statistics …
infinite lattices. In particular, we show that under fairly general assumptions on the statistics …
[PDF][PDF] On the complexity of sphere decoding
E Zimmermann, W Rave, G Fettweis - Proc. International Symp. on …, 2004 - Citeseer
… In this paper, we analyze the performance and computational complexity of different MIMO
… of complexity reduction techniques for sphere decoding and show that complexity becomes …
… of complexity reduction techniques for sphere decoding and show that complexity becomes …
On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications
… Furthermore, we consider the expected complexity of sphere decoding for channels with
memory, where the lattice-generating matrix has a special Toeplitz structure. Results indicate …
memory, where the lattice-generating matrix has a special Toeplitz structure. Results indicate …
Reduced complexity sphere decoding
B Li, E Ayanoglu - Wireless Communications and Mobile …, 2011 - Wiley Online Library
… In multiple-input multiple-output (MIMO) systems, sphere decoding (SD) can … decoding,
with reduced complexity. Several researchers reported techniques that reduce the complexity of …
with reduced complexity. Several researchers reported techniques that reduce the complexity of …