Learn More
Matrix multiplication is a basic computing operation. Whereas it is basic, it is also very expensive with a straight forward technique of O(N 3) run-time complexity. More complex solutions such as Strassen's algorithm exist that reduce this complexity to O(N log 2 7); the recursive nature of such algorithms place a large burden on memory systems due to(More)
Recursive solutions are effective software techniques that are difficult to map into hardware due to their dependency on input size and data values. As a result, most high-level design tools do not allow for recursive calls. In this paper we present a technique for mapping the merge-sort algorithm, as a case study, into a reconfigurable system. Our mapping(More)
  • 1