Abstract
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 language | English |
|---|---|
| Title of host publication | Proceedings of the 2014 International Conference on Field-Programmable Technology, FPT 2014 |
| Publisher | IEEE |
| Pages | 243-247 |
| Number of pages | 5 |
| ISBN (Electronic) | 978-1-4799-6245-7 |
| DOIs | |
| Publication status | Published - 9 Apr 2015 |
| Externally published | Yes |
| Event | 2014 International Conference on Field-Programmable Technology - Shanghai, Chile Duration: 10 Dec 2014 → 12 Dec 2014 |
Conference
| Conference | 2014 International Conference on Field-Programmable Technology |
|---|---|
| Abbreviated title | ICFPT |
| Country/Territory | Chile |
| City | Shanghai |
| Period | 10/12/14 → 12/12/14 |
Keywords
- Polynomial Matrix Multiplication
- SBR2P
- Xilinx System Generator
- Field-Programmable Gate Array (FPGA)