Name
Abstract | ||
|---|---|---|
The QR Decomposition (QRD) of communication channel matrices is a fundamental
prerequisite to several detection schemes in Multiple-Input Multiple-Output
(MIMO) communication systems. Herein, the main feature of the QRD is to
transform the non-causal system into a causal system, where consequently
efficient detection algorithms based on the Successive Interference
Cancellation (SIC) or Sphere Decoder (SD) become possible. Also, QRD can be
used as a light but efficient antenna selection scheme. In this paper, we
address the study of the QRD methods and compare their efficiency in terms of
computational complexity and error rate performance. Moreover, a particular
attention is paid to the parallelism of the QRD algorithms since it reduces the
latency of the matrix factorization. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/SPAWC.2010.5671007 | Clinical Orthopaedics and Related Research |
Keywords | DocType | Volume |
communication system,matrix factorization,error rate,qr decomposition,communication channels,computational complexity | Journal | abs/1005.4 |
Citations | PageRank | References |
2 | 0.45 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sébastien Aubert | 1 | 11 | 2.17 |
| Manar Mohaisen | 2 | 97 | 28.83 |
| Fabienne Nouvel | 3 | 67 | 15.27 |
| Kyunghi Chang | 4 | 202 | 41.07 |