{"title":"Designing an accelerated hardware architecture for polynomial matrix multiplications","authors":"K. S. Bodani, A. Kumbhar","doi":"10.1109/IBSS.2015.7456663","DOIUrl":null,"url":null,"abstract":"In this project, reconfigurable hardware architecture is used for performing the polynomial matrix multiplications (PMM). Hardware architecture is designed by using the Xilinx system generator tool. System generator enables the use of the math works model-based Simulink design environment for FPGA design. For designing PMM system, Fast Fourier Transform (FFT) technique is used rather than Convolution technique, because convolution takes computational time more than FFT. It's easy to implement the generic structure of FFT. This project implements the sharpening, smoothing, blurring and Gaussian smooth application using polynomial matrix multiplication. The hardware implementation is possible by using field-programmable array architecture. This PMM system takes less time for execution and it uses less FPGA resources like number of slice registers, number of slice LUT's, the number of block RAM/FIFO and number of bonded IOBs. The architecture for computing the PMM is implemented on Virtex-5.","PeriodicalId":317804,"journal":{"name":"2015 IEEE Bombay Section Symposium (IBSS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Bombay Section Symposium (IBSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IBSS.2015.7456663","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In this project, reconfigurable hardware architecture is used for performing the polynomial matrix multiplications (PMM). Hardware architecture is designed by using the Xilinx system generator tool. System generator enables the use of the math works model-based Simulink design environment for FPGA design. For designing PMM system, Fast Fourier Transform (FFT) technique is used rather than Convolution technique, because convolution takes computational time more than FFT. It's easy to implement the generic structure of FFT. This project implements the sharpening, smoothing, blurring and Gaussian smooth application using polynomial matrix multiplication. The hardware implementation is possible by using field-programmable array architecture. This PMM system takes less time for execution and it uses less FPGA resources like number of slice registers, number of slice LUT's, the number of block RAM/FIFO and number of bonded IOBs. The architecture for computing the PMM is implemented on Virtex-5.