Name
Abstract | ||
|---|---|---|
MIMO systems exploit multipath propagation to improve throughput and performance of digital communication systems. However, at the receiver side, the computation of Euclidean distances requires prohibitive computational complexity particularly when combined with a high-order constellation. Conventionally, it is necessary to calculate all the Euclidean distances to find the maximum likelihood solut... |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/LCOMM.2016.2525722 | IEEE Communications Letters |
Keywords | Field | DocType |
Silicon,MIMO,Decoding,Detectors,Euclidean distance,Lattices,Receivers | Multipath propagation,3G MIMO,Computer science,QAM,Euclidean distance,Algorithm,MIMO,Theoretical computer science,Real-time computing,Decoding methods,Throughput,Computational complexity theory | Journal |
Volume | Issue | ISSN |
20 | 4 | 1089-7798 |
Citations | PageRank | References |
1 | 0.36 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ali Haroun | 1 | 5 | 1.17 |
| Charbel Abdel Nour | 2 | 152 | 23.78 |
| Matthieu Arzel | 3 | 69 | 15.10 |
| Christophe Jégo | 4 | 115 | 28.37 |