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

(LLL) reduction

Closest point search

search

algorithms

multiple-output (MIMO)

lattice code decoder

sphere decoder

Schnorr-Euchner

performance

maximum likelihood (ML) detection

multiple-input

point

Lenstra-Lenstra-Lovasz

lattice

Författare

Arash Ghasemmehdi

Chalmers, Signaler och system

Erik Agrell

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

IEEE Transactions on Information Theory

0018-9448 (ISSN)

Vol. 57 6 3530-3536 5773010

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1109/tit.2011.2143830