… SPHERE DECODING The basic premise in sphere decoding is rather simple: We attempt
to search over only lattice points that lie in a certain sphere of radius around the given vector , …

… for the variance of the complexity of sphere-decoding algorithm in a finite lattice. Furthermore,
we consider the expected complexity of sphere decoding for channels with memory, where …

… of sphere decoding algorithm (SDA) that performs exact maximum-likelihood (ML) decoding.
We develop novel algorithms based on an improved increasing radius search (IIRS), which …

… This paper discusses two ASIC implementations of MIMO sphere decoders. The first ASIC
attains maximum-likelihood performance with an average throughput of 73 Mb/s at a signal-to-…

… decoder pose significant implementation challenges due to their high computational complexity.
In this paper, we show how sphere decoding can … sphere decoder VLSI implementation. …

… For the sphere decoding algorithm of Fincke and Pohst we find analytic expressions for the
… the sphere-constrained search idea of the Fincke-Pohst algorithm, we develop algorithms …

… This section is intended to give sufficient understanding of the sphere decoding algorithm
for the reader to follow the complexity computations of the following sections. It will also in…

… In Section II, we review the sphere decoding algorithm and formalize its sparsity-aware
variant. Following the analysis framework in [9], [10], in Section III we derive the expected …

… In this paper, a practical sphere-decoding algorithm is proposed. It utilizes a simple and
effective way to set the initial radius which plays a decisive role in determining the computational …

… MIMO detection algorithms. Motivated by these facts, a sphere decoding algorithm based
on … the radius of the decoding hypersphere is learned by a DNN prior to decoding. The DNN …