IDEAS home Printed from https://ideas.repec.org/a/epw/ejece0/v3y2019i5id19127.html

Floating Point versus Fixed point Tradeoffs in FPGA Implementations of QR Decomposition Algorithm

Author

Listed:
  • Siavash Amin-Nejad

    (University of Guilan, Iran.)

  • Katayoon Basharkhah

    (University of Guilan, Iran.)

  • Tayyebeh Asgari Gashteroodkhani

    (University of Guilan, Iran.)

Abstract

A wide variety of digital communication systems are encountered with high computational tasks. QR decomposition is one of such algorithms that can be implemented on FPGAs as a solution to large complex matrix inversion problems. A flexible vector processing architecture for the fixed and floating point implementations of the QR decomposition is presented. The design is implemented on the StratixIV device with 230K logic elements and verified with the SignalTap II built-in logic analyzer. Throughputs of 2.4M and 2.11M decompositions per second with maximum clock frequency of 340 MHz and 360 MHz are achieved for 4×4 matrices with the fixed and floating point designs respectively. The FPGA resource utilizations of the two data type implementations are also compared for different matrix sizes for the StratixIV and Arria10 devices.

Suggested Citation

  • Siavash Amin-Nejad & Katayoon Basharkhah & Tayyebeh Asgari Gashteroodkhani, 2019. "Floating Point versus Fixed point Tradeoffs in FPGA Implementations of QR Decomposition Algorithm," European Journal of Electrical Engineering and Computer Science, European Open Science, vol. 3(5), September.
    • Handle: RePEc:epw:ejece0:v:3:y:2019:i:5:id:19127
    DOI: 10.24018/ejece.2019.3.5.127
    as

    Download full text from publisher

    File URL: https://eu-opensci.org/index.php/ejece/article/view/19127
    File Function: Abstract page
    Download Restriction: no
    File URL: https://eu-opensci.org/index.php/ejece/article/download/19127/11052
    File Function: Full text
    Download Restriction: no
    File URL: https://libkey.io/10.24018/ejece.2019.3.5.127?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:epw:ejece0:v:3:y:2019:i:5:id:19127. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: support (email available below). General contact details of provider: https://eu-opensci.org/index.php/ejece .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.