Novel reconfigurable hardware implementation of polynomial matrix/vector multiplications

S. Kasap, S. Redif

Research output: Chapter in Book/Report/Conference proceedingConference proceedingpeer-review


In this paper, we introduce a novel reconfigurable hardware architecture for computing the polynomial matrix multiplication (PMM) of polynomial matrices/vectors. The proposed algorithm exploits an extension of the fast convolution technique to multiple-input, multiple-output (MIMO) systems. The proposed architecture is the first one devoted to the hardware implementation of PMM. Hardware implementation of the algorithm is achieved via a highly pipelined, partly systolic FPGA architecture. We verify the algorithmic accuracy of the architecture, which is scalable in terms of the order of the input matrices, through FPGA-in-the-loop hardware co-simulations. Results are presented to demonstrate the accuracy and capability of the architecture.
Original languageEnglish
Title of host publicationProceedings of the 2014 International Conference on Field-Programmable Technology, FPT 2014
Number of pages5
ISBN (Electronic)978-1-4799-6245-7
Publication statusPublished - 9 Apr 2015
Externally publishedYes
Event2014 International Conference on Field-Programmable Technology - Shanghai, Chile
Duration: 10 Dec 201412 Dec 2014


Conference2014 International Conference on Field-Programmable Technology
Abbreviated titleICFPT


  • Polynomial Matrix Multiplication
  • SBR2P
  • Xilinx System Generator
  • Field-Programmable Gate Array (FPGA)


Dive into the research topics of 'Novel reconfigurable hardware implementation of polynomial matrix/vector multiplications'. Together they form a unique fingerprint.

Cite this