1 / 3

c: cosine s: sine

c: cosine s: sine. FPGA Based Systolic Array Implementation of QR Transformation Using Givens Rotations by Xiaojun Wang and Miriam Leeser (mel@coe.neu.edu). Givens Rotation Algorithm:. Divide and square root are required. x. c. ×. /. +. y. s. ×. /. c. r 1. ×. r 1. s. +.

mauli
Download Presentation

c: cosine s: sine

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. c: cosine s: sine FPGA Based Systolic Array Implementation of QR Transformation Using Givens Rotationsby Xiaojun Wang and Miriam Leeser (mel@coe.neu.edu) Givens Rotation Algorithm: • Divide and square root are required

  2. x c × / + y s × / c r1 × r1 s + r2 × s r1 × r2 c ─ × r2 2D Systolic Array Architecturefor QR Implementation x1 x2 x3 xN ……… r1 r1,2 r1,3 r1,N ……… r2 r2,3 r2,N …… …… rN • Diagonal PE: calculate the rotation parameters c and s • Off-diagonal PE: update the matrix elements using rotation parameters

  3. Experimental Results Resources and Speed: XC5VLX220 Latency IEEE Single-precision square matrix • 1D implementation: 1302 cycles • Our 2D implementation: 954 cycles • 2D latency increases linearly with matrix size, scales well for larger matrices

More Related