Architectures for adaptive weight calculation on ASIC and FPGA
Richard L. Walke, ROBERT WILLIAM SMITH, Gaye Lightbody
Abstract
Richard L. Walke, ROBERT WILLIAM SMITH, Gaye Lightbody
Abstract
We compare two parallel array architectures for adaptive weight calculation based an QR-decomposition by Givens rotations. We present FPGA implementations of both architectures and compare them with an ASIC-based solution. The throughput of the FPGA implementations is of the order 5-20 GigaFLOPS, making FPGA a viable alternative to ASIC implementation in applications where power consumption and volume cost are not critical.
OpenAlex reports 42 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We compare two parallel array architectures for adaptive weight calculation based an QR-decomposition by Givens rotations. We present FPGA implementations of both architectures and compare them with an ASIC-based solution. The throughput of the FPGA implementations is of the order 5-20 GigaFLOPS, making FPGA a viable alternative to ASIC implementation in applications where power consumption and volume cost are not critical.
Key concepts: Application-specific integrated circuit, Field-programmable gate array, Computer science, Implementation, Throughput, Power consumption, Embedded system, Computer architecture