Faster Recursions in Sphere Decoding
Artikel i vetenskaplig tidskrift, 2011
Most of the calculations in standard sphere decoders are redundant in the sense that they either calculate quantities that are never used or calculate some quantities more than once. A new method, which is applicable to lattices as well as finite constellations, is proposed to avoid these redundant calculations while still returning the same result. Pseudocode is given to facilitate immediate implementation. Simulations show that the speed gain with the proposed method increases linearly with the lattice dimension. At dimension 60, the new algorithms avoid about 75% of all floating-point operations.
Fincke-Pohst
lattice
Lenstra-Lenstra-Lovasz
sphere decoder
search
multiple-input
multiple-output (MIMO)
algorithms
performance
Closest point search
point
Schnorr-Euchner
(LLL) reduction
maximum likelihood (ML) detection
lattice code decoder
Författare
Arash Ghasemmehdi
Chalmers, Signaler och system
Erik Agrell
Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner
IEEE Transactions on Information Theory
0018-9448 (ISSN)
Vol. 57 6 3530-3536 5773010Styrkeområden
Informations- och kommunikationsteknik
Ämneskategorier (SSIF 2011)
Data- och informationsvetenskap
DOI
10.1109/tit.2011.2143830