2003
DOI: 10.1007/978-3-540-45234-8_50
|View full text |Cite
|
Sign up to set email alerts
|

Time and Energy Efficient Matrix Factorization Using FPGAs

Abstract: Abstract. In this paper, new algorithms and architectures for matrix factorization are presented. Two fully-parallel and block-based designs for LU decomposition on configurable devices are proposed. A linear array architecture is employed to minimize the usage of long interconnects, leading to lower energy dissipation. The designs are made scalable by using a fixed I/O bandwidth independent of the problem size. High level models for energy profiling are built and the energy performance of many possible design… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2004
2004
2017
2017

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 19 publications
(17 citation statements)
references
References 9 publications
(10 reference statements)
0
17
0
Order By: Relevance
“…Some considered fixedpoint arithmetic only [28], [29], [30]. Due to the implementation complexity of the floating-point units, the work of these researchers is not suitable for floating-point-based operations.…”
Section: Linear Algebra On Fpgasmentioning
confidence: 99%
“…Some considered fixedpoint arithmetic only [28], [29], [30]. Due to the implementation complexity of the floating-point units, the work of these researchers is not suitable for floating-point-based operations.…”
Section: Linear Algebra On Fpgasmentioning
confidence: 99%
“…It is well known that increasing this data locality has a direct relationship to the power consumed [5 -7]. Indeed, previous work has involved investigating locality properties for FPGA-based systolic array implementations [8] and an FFT-based digital receiver solution based on a Xilinx Virtex-II FPGA implementation [9]; however, the real challenge is how to influence data locality at the algorithmic level in a systematic fashion, particularly for fast transforms that may not necessarily exhibit this locality in the first instance.…”
Section: Introductionmentioning
confidence: 99%
“…al. [4] and our LU architecture shown in Figure 1. Choi's block LU decomposition architecture also utilizes a matrix multiplication and subtraction architecture.…”
Section: Discussionmentioning
confidence: 99%
“…Many systolic array algorithms have been described in literature [6], [2], [4] and [7]. Rajopadhye [7] presents systolic arrays for LU decomposition.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation