J4 ›› 2010, Vol. 32 ›› Issue (10): 34-37.doi: 10.3969/j.issn.1007130X.2010.
• 论文 • Previous Articles Next Articles
ZHOU Jie1,CHEN Xiaoyang1,ZHAO Jianxun2,DOU Yong1
Received:
Revised:
Online:
Published:
Abstract:
Largescale QR decomposition is widely used in many fields,such as signal processing,large image processing,and computational structure dynamics,and so on. Traditional methods adopt parallel computers to accelerate largescale QR decomposition,which is a computationintensive algorithm. This paper presents a finegrained parallel implementation of Givens Rotation QR decomposition on FPGA. A scalable linear array of processing elements (PEs),which is the core component of our hardware design,is proposed to implement this algorithm. To our knowledge,this is the first FPGAbased implementation of largescale QR decomposition. A total of 15 GRPEs can be integrated into an Altera StratixII EP2S130F1020C5 FPGA.The experimental results show that a speedup up to 19 can be achieved relative to the Pentium Dual CPU.
Key words: largescale;QR decomposition;linear array processor;FPGA
ZHOU Jie1,CHEN Xiaoyang1,ZHAO Jianxun2,DOU Yong1. The FPGA Implementation of LargeScale QR Decomposition[J]. J4, 2010, 32(10): 34-37.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://joces.nudt.edu.cn/EN/10.3969/j.issn.1007130X.2010.
http://joces.nudt.edu.cn/EN/Y2010/V32/I10/34