Sie verwenden einen Browser, in dem JavaScript deaktiviert ist. Dadurch wird verhindert, dass Sie die volle Funktionalität dieser Webseite nutzen können. Zur Navigation müssen Sie daher die Sitemap nutzen.

You are currently using a browser with deactivated JavaScript. There you can't use all the features of this website. In order to navigate the site, please use the Sitemap .

Efficient and Scalable CGRA-based Implementation of Column-wise Givens Rotation

Authors:: Rákossy, Z. E. , Merchant, F. , Acosta Aponte, A. , Nandy, S. K. , Chattopadhyay, A.
Book Title:: 25th IEEE International Conference on Application-specific Systems, Architectures and Processors
Organization:: IEEE
Address:: Zuerich, Switzerland
Date:: Jun. 2014
DOI:: 10.1109/ASAP.2014.6868659
Language:: English
Abstract:: Givens Rotation is a key computation-intensive block in embedded wireless applications.
In order to achieve an efficient mapping which smoothly scales to the underlying architecture, we propose two new Column-based Givens Rotation algorithms, derived from traditional Fast Givens and Square-root and Division Free Givens algorithms.
These algorithms allow annihilation of multiple elements in a column of the input matrix simultaneously, without a dependency bottle-neck allowing increased parallelism, resource sharing and scalability.
The ease of mapping and scalability has been tested on a layered coarse-grained reconfigurable architecture reaching close to optimal results for highly parallel architectures.
Download:: BibTeX
Copyright © by IEEE rakossy_asap2014.pdf: © 2024 IEEE.Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.