Sökning: id:"swepub:oai:research.chalmers.se:e77dc2eb-d757-482e-8932-1597f567528c" >
Faster Recursions i...
Faster Recursions in Sphere Decoding
-
- Ghasemmehdi, Arash, 1981 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Agrell, Erik, 1965 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
(creator_code:org_t)
- Institute of Electrical and Electronics Engineers (IEEE), 2011
- 2011
- Engelska.
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448 .- 1557-9654. ; 57:6, s. 3530-3536
- Relaterad länk:
-
http://publications.... (primary) (free)
-
visa fler...
-
http://publications....
-
https://research.cha...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Nyckelord
- 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
Publikations- och innehållstyp
- art (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas