• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊
论文

The FPGA Implementation of LargeScale QR Decomposition

Expand
  • (1.National Laboratory for Parallel and Distributed Processing,Changsha 410073;
    2.Academy of Armored Forces Engineering,Beijing 100072,China)

Received date: 2009-04-13

  Revised date: 2009-07-10

  Online published: 2010-09-29

Abstract

Largescale 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  largescale QR decomposition,which is a computationintensive algorithm. This paper presents a finegrained 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  FPGAbased implementation of largescale QR decomposition. A total of 15 GRPEs 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.

Cite this article

ZHOU Jie1,CHEN Xiaoyang1,ZHAO Jianxun2,DOU Yong1 . The FPGA Implementation of LargeScale QR Decomposition[J]. Computer Engineering & Science, 2010 , 32(10) : 34 -37 . DOI: 10.3969/j.issn.1007130X.2010.

Outlines

/