2014
DOI: 10.1109/lcomm.2014.2349995
|View full text |Cite
|
Sign up to set email alerts
|

Complex QR Decomposition Using Fast Plane Rotations for MIMO Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…On the other hand, the fast plane rotation [7] that is derived in complex plane and rectangular coordinates is a square root-and division-free Givens rotations [8]. In this sense, the fast plane rotation which is also referred as the complex-valued fast Givens rotations (CV À FGR) is a very efficient algorithm, aiming a QRdecomposition of matrices once the computations are performed incrementally, i.e., as the data arrives sequentially in time.…”
Section: Complex-valued Fast Givens Rotationsmentioning
confidence: 99%
“…On the other hand, the fast plane rotation [7] that is derived in complex plane and rectangular coordinates is a square root-and division-free Givens rotations [8]. In this sense, the fast plane rotation which is also referred as the complex-valued fast Givens rotations (CV À FGR) is a very efficient algorithm, aiming a QRdecomposition of matrices once the computations are performed incrementally, i.e., as the data arrives sequentially in time.…”
Section: Complex-valued Fast Givens Rotationsmentioning
confidence: 99%
“…In QRD, a matrix A, with Gaussian entries with zero mean and σ 2 variance [aijNfalse(0,thinmathspaceσ2false)] is decomposed into an orthonormal component and an upper triangular matrix, i.e.{1em4ptA=QRbold-italicQnormalHQ=bold-italicINrij=0,1emi>j.There are basically three methods used to evaluate the QRD: through Householder reflections [17], Givens rotations [1] and through the GS orthogonalisation [11]. The latter, however, can be considered the most popular due to its simplicity, even not being considered the most reliable method available.…”
Section: Modified Gs‐qrdmentioning
confidence: 99%
“…It can be used in linear systems, least‐square problems and even in sophisticated multiple‐input–multiple‐output (MIMO) detectors. Still, the QRD computation is a very active topic in communication systems, for there is an ever growing need for faster and/or distributed nature algorithms [1–3]. Moreover, optimised algorithms (context application) could be able to reduce complexity and latency, while distributed nature algorithms are more suitable in multi‐user scenarios, where processing information may not be shared simultaneously by all users.…”
Section: Introductionmentioning
confidence: 99%