CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Faster Recursions in Sphere Decoding

Arash Ghasemmehdi (Institutionen för signaler och system) ; Erik Agrell (Institutionen för signaler och system, Kommunikationssystem)
IEEE Transactions on Information Theory (0018-9448). Vol. 57 (2011), 6, p. 3530-3536.
[Artikel, refereegranskad vetenskaplig]

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.

Nyckelord: Closest point search, Fincke-Pohst, lattice, Lenstra-Lenstra-Lovasz, (LLL) reduction, maximum likelihood (ML) detection, multiple-input, multiple-output (MIMO), Schnorr-Euchner, sphere decoder, lattice code decoder, algorithms, search, point, performance



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2011-06-13. Senast ändrad 2016-04-28.
CPL Pubid: 141586

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)