Modified givens rotations and their application to matrix inversion

Ma, Lei; Dickson, K.; McAllister, John; McCanny, J.V.

doi:10.1109/icassp.2008.4517890

Cited by 12 publications

(10 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the SGR algorithm produces erroneous results when zeros occur on the diagonal elements of the matrix either initially or during processing. This limitation is overcome in the modified squared Givens rotations (MSGR) algorithm [5], a brief overview of which is given here.…”

Section: Matrix Inversion Methodsmentioning

confidence: 99%

“…In turn, the modified squared Givens rotations (MSGR) algorithm [5] is the optimum method for QRD-based matrix inversion as it offers high-performance real-time processing and also overcomes limitations in other QRD-based algorithms, as discussed further in Section 2. In this paper, a novel method to significantly reduce the complexity of MSGR-based matrix inversion, such that it is more amenable to real-time implementation in MIMO wireless communication systems is presented.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Reduced-complexity MSGR-based matrix inversion

Dickson

McAllister

et al. 2008

2008 IEEE Workshop on Signal Processing Systems

Self Cite

View full text Add to dashboard Cite

A novel method to significantly reduce the complexity of real-time hardware/software implementations of MSGRbased matrix inversion for MIMO wireless communication systems is presented. It is shown, through extensive simulation of this new technique within a T-BLAST MIMO system, that removing the scale-factor from the MSGR algorithm has no adverse effect on the bit-error rate performance of this practical application. Moreover, this new modification to the MSGR algorithm reduces the number of multiply and divide operations in MSGR-based matrix inversion by 18-19%. Furthermore, it is shown that reduced-precision fixed-point arithmetic may be exploited to further reduce the complexity of the implementation while maintaining acceptable bit-error rate performance.

show abstract

Section: Matrix Inversion Methodsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Reduced-complexity MSGR-based matrix inversion

Dickson

McAllister

et al. 2008

2008 IEEE Workshop on Signal Processing Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…To overcome these problems, MSGR is proposed for complex valued matrices with the potential for zeros on the diagonal [1]. MSGR uses (9)-(10) to translate rows r and a to U and V-space respectively.…”

Section: Msgr-based Matrix Inversionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

MSGR-based low latency complex matrix inversion architecture

Dickson

McAllister

et al. 2008

2008 9th International Conference on Signal Processing

Self Cite

View full text Add to dashboard Cite

This paper presents a matrix inversion architecture based on the novel Modified Squared Givens Rotations (MSGR) algorithm, which extends the original SGR method to complex valued data, and also corrects erroneous results in the original SGR method when zeros occur on the diagonal of the matrix either initially or during processing. The MSGR algorithm also avoids complex dividers in the matrix inversion, thus minimising the complexity of potential real-time implementations. A systolic array architecture is implemented and FPGA synthesis results indicate a high-throughput low-latency complex matrix inversion solution.

show abstract

“…Many previous research efforts are focused on the high-performance VLSI implementation of matrix inversion [6][7][8]. Triangular systolic arrays (TSA) [9] are frequently used for matrix inversion with the properties Manuscript received Nov. 30, 2010; revised Feb. 28, 2011.…”

Section: Introductionmentioning

confidence: 99%

Sign-Select Lookahead CORDIC based High-Speed QR Decomposition Architecture for MIMO Receiver Applications

Lee¹

2011

JSTS:Journal of Semiconductor Technology and Science

View full text Add to dashboard Cite

Abstract-This paper presents a high-speed QR decomposition architecture for the multi-input-multioutput (MIMO) receiver based on Givens rotation. Under fast-varying channel, since the inverse matrix calculation has to be performed frequently in MIMO receiver, a high performance and low latency QR decomposition module is highly required. The proposed QR decomposition architecture is composed of Sign-Select Lookahead (SSL) coordinate rotation digital computer (CORDIC). In the SSL-CORDIC, the sign bits, which are computed ahead to select which direction to rotate, are used to select one of the last iteration results, therefore, the data dependencies on the previous iterations are efficiently removed. Our proposed QR decomposition module is implemented using TSMC 0.25 µm CMOS process. Experimental results show that the proposed QR architecture achieves 34.83% speed-up over the Compact CORDIC based architecture for the 4 × 4 matrix decomposition.

show abstract

Modified givens rotations and their application to matrix inversion

Cited by 12 publications

References 9 publications

Reduced-complexity MSGR-based matrix inversion

Reduced-complexity MSGR-based matrix inversion

MSGR-based low latency complex matrix inversion architecture

Sign-Select Lookahead CORDIC based High-Speed QR Decomposition Architecture for MIMO Receiver Applications

Contact Info

Product

Resources

About