SwePub - sökning: id:"swepub:oai:research.chalme...

Träfflista för sökning "id:"swepub:oai:research.chalmers.se:e77dc2eb-d757-482e-8932-1597f567528c" "

Sökning: id:"swepub:oai:research.chalmers.se:e77dc2eb-d757-482e-8932-1597f567528c"

Sortera/gruppera träfflistan

Sortering: Träffar per sida:

Numrering	Referens	Omslagsbild	Hitta
1.	Ghasemmehdi, Arash, 1981, et al. (författare) Faster Recursions in Sphere Decoding 2011 Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448 .- 1557-9654. ; 57:6, s. 3530-3536 Tidskriftsartikel (refereegranskat)abstract 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.

Skapa referenser, mejla, bekava och länka

Träfflista för sökning "id:"swepub:oai:research.chalmers.se:e77dc2eb-d757-482e-8932-1597f567528c" "