EDBT 2026 Demo / reviewers in the wild / expert
Arash Ghasemmehdi
dblp:02/7116
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Coding theory · 75% Algorithms and data structures · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
decoding |
0.1 | 1 | 2011 | Faster Recursions in Sphere Decoding · IEEE Trans. Inf. Theory 2011 |
Algorithms and data structures › number-theoretic algorithms
lattice algorithms |
0.1 | 1 | 2011 | Faster Recursions in Sphere Decoding · IEEE Trans. Inf. Theory 2011 |
Coding theory › lattice codes
lattice decoding |
0.1 | 1 | 2011 | Faster Recursions in Sphere Decoding · IEEE Trans. Inf. Theory 2011 |
Coding theory › lattice codes › lattice decoding
sphere decoding |
0.1 | 1 | 2011 | Faster Recursions in Sphere Decoding · IEEE Trans. Inf. Theory 2011 |
Methods — techniques the papers use, named apart from their topics
recursion · 0.1pseudocode · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Faster Recursions in Sphere DecodingabstractMost 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. Arash Ghasemmehdi, Erik Agrell |
IEEE Trans. Inf. Theory | 1 |