Realization of area efficient QR factorization using unified division, square root, and inverse square root hardware

The QR factorization is used in many signal processing and communication applications such as echo cancellation, adaptive beamforming and multiple-input-multiple-output (MIMO) systems. However, division, square root and inverse square root operations required by the QR algorithm are very difficult t...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2009 IEEE International Conference on Electro/Information Technology s. 245 - 250
Hlavní autori: Aslan, S., Oruklu, E., Saniie, J.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.06.2009
Predmet:
Adaptive signal processing
Algorithm design and analysis
Application software
Arithmetic
Computer architecture
Delay
Field programmable gate arrays
Hardware
Newton method
Signal processing algorithms
ISBN:9781424433544, 1424433541
ISSN:2154-0357
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The QR factorization is used in many signal processing and communication applications such as echo cancellation, adaptive beamforming and multiple-input-multiple-output (MIMO) systems. However, division, square root and inverse square root operations required by the QR algorithm are very difficult to implement because they are computationally slow and area-consuming arithmetic operations. This paper presents unified hardware architecture for fast, area efficient QR factorization based on the Householder transformation. Newton-Raphson, and Goldschmidt algorithms are used for fast division, square root and inverse square root blocks. By using a unified architecture, area and power requirements for QR factorization are reduced without decreasing overall speed. The design and implementation of the proposed hardware is presented with synthesis results based on FPGA hardware.
ISBN:9781424433544
1424433541
ISSN:2154-0357
DOI:10.1109/EIT.2009.5189620