2006
DOI: 10.1007/11802839_26
|View full text |Cite
|
Sign up to set email alerts
|

Constant Complexity Management of 2D HW Multitasking in Run-Time Reconfigurable FPGAs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2006
2006
2015
2015

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…For this last purpose, we need to perform rotations using steps matrix like the one show in (23), called Jacobi rotations…”
Section: B Implementation Of the Signal Subspace Estimationmentioning
confidence: 99%
See 1 more Smart Citation
“…For this last purpose, we need to perform rotations using steps matrix like the one show in (23), called Jacobi rotations…”
Section: B Implementation Of the Signal Subspace Estimationmentioning
confidence: 99%
“…The idea is that FPGAs can be reconfigured on the fly. This approach is called temporal partitioning [22], [23] or runtime reconfiguration [24]. Basically, the FPGA (or a region of the FPGA) executes a series of tasks one after another by reconfiguring itself between tasks [25].…”
Section: B Signal Subspace Estimationmentioning
confidence: 99%
“…The idea is that FPGAs can be reconfigured on the fly. This approach is called temporal partitioning [94], [95] or run-time reconfiguration [96]. Basically, the FPGA (or a region of the FPGA) executes a series of tasks one after another by reconfiguring itself between tasks [97].…”
Section: B Fpga-based Linear Unmixing Of Hyperspectral Imagesmentioning
confidence: 99%