Abstract

A new pipelined systolic array-based (PSA) architecture for matrix inversion is proposed. The pipelined systolic array (PSA) architecture is suitable for FPGA implementations as it efficiently uses available resources of an FPGA. It is scalable for different matrix size and as such allows employing parameterisation that makes it suitable for customisation for application-specific needs. This new architecture has an advantage of O(n) processing element complexity, compared to the O(n2) in other systolic array structures, where the size of the input matrix is given by n × n. The use of the PSA architecture for Kalman filter as an implementation example, which requires different structures for different number of states, is illustrated. The resulting precision error is analysed and shown to be negligible.

Highlights

  • Many DSP algorithms, such as Kalman filter, involve several iterative matrix operations, the most complicated being matrix inversion, which requires O(n3) computations (n is the matrix size)

  • In this paper we demonstrate how FPGAs can be used efficiently to implement systolic arrays, as an underlying architecture for matrix inversion and implementation of Kalman filter

  • Because of feedback paths in the design and single cell layer structure in the pipelined systolic array (PSA), the number of processing elements required for implementation has been reduced and the hardware complexity changed from O(n2) to

Read more

Summary

INTRODUCTION

Many DSP algorithms, such as Kalman filter, involve several iterative matrix operations, the most complicated being matrix inversion, which requires O(n3) computations (n is the matrix size). This becomes the critical bottleneck of the processing time in such algorithms. In this paper we demonstrate how FPGAs can be used efficiently to implement systolic arrays, as an underlying architecture for matrix inversion and implementation of Kalman filter.

MATRIX INVERSION
Systolic array for Schur complement implementation
Modifying systolic array structure
Division with multiplication
Control unit
Resource consumption and timing restrictions
Comparisons with other implementations
Limitations
Effects of the finite word length
Kalman filter
Kalman filter in PSA-based structure
A Step 1 B
Comparison with other implementations
CONCLUSIONS
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call