Skip to search formSkip to main contentSkip to account menu

Givens rotation

Known as: Given's rotation 
In numerical linear algebra, a Givens rotation is a rotation in the plane spanned by two coordinates axes. Givens rotations are named after Wallace… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Active and passive transformationEigenvalue algorithmGeneralized minimal residual methodHouseholder transformation

Broader (1)

Numerical linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Semidefinite programming based omnidirectional beamforming for massive MIMO
In public channels, common signals need to be transmitted omnidirectionally to achieve cell-wide coverage. In this paper, we… 
2016
2016
Improvements on parsimonious extreme learning machine using recursive orthogonal least squares
2015
2015
A Systolic Array Based GTD Processor With a Parallel Algorithm
Generalized triangular decomposition (GTD) has been found to be useful in the field of signal processing, but the feasibility of… 
2014
2014
Scalable and energy-efficient reconfigurable accelerator for column-wise givens rotation
A new layered reconfigurable architecture is proposed which exploits modularity, scalability and flexibility to achieve high… 
2012
2012
High-throughput sorted MMSE QR decomposition for MIMO detection
The sorted QR decomposition (SQRD) has become a critical prerequisite for non-linear detection algorithms such as K-best and… 
2009
2009
The Computer Realization of the QR Decomposition on Matrices with Full Column Rank
The QR decomposition of matrix is an especial tool for Matrix Calculation, although its decomposition process is very complex… 
2009
2009
OFDM joint data detection and phase noise cancellation based on minimum mean square prediction error
2004
2004
Diagnosing Manufacturing Variation Using Second-Order and Fourth-Order Statistics
This article discusses a method that can aid in diagnosing root causes of product and process variability in complex… 
Review
1998
Review
1998
Idempotent Full Paraconsistent Negations are not Algebraizable
  • J. Béziau
  • Notre Dame J. Formal Log.
  • 1998
  • Corpus ID: 14966535
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of… 
1986
1986
A flexible, numerically robust array processing algorithm and its relationship to the givens transformation
The development of systolic array processors is very important for real-time adaptive array processing applications. In this… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)