2003
DOI: 10.1016/s0141-9331(02)00102-3
|View full text |Cite
|
Sign up to set email alerts
|

Temporal partitioning methodology optimizing FPGA resources for dynamically reconfigurable embedded real-time system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0
2

Year Published

2006
2006
2015
2015

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 21 publications
(11 citation statements)
references
References 18 publications
0
9
0
2
Order By: Relevance
“…The CDFG of the AES algorithm are initially partitioned in five temporal partitions by the temporal partitioning approach [8]. Next, we calculate all M.S.R values between all successive partitions.…”
Section: Application and Implementation Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The CDFG of the AES algorithm are initially partitioned in five temporal partitions by the temporal partitioning approach [8]. Next, we calculate all M.S.R values between all successive partitions.…”
Section: Application and Implementation Resultsmentioning
confidence: 99%
“…Next, a temporal partitioning is founded according to the specified constraints and the target applications (constraints of power consumption, logical area, frequency, execution time, etc.) [8,11]. The first step allows us to obtain a set of nature partitions as defined in equation 1.…”
Section: Optimised Temporal Partitioning Based On Inter-partition Synmentioning
confidence: 99%
See 1 more Smart Citation
“…We can also compare our versatile implementation approach, which is based on the reuse of operators by adding control at different time, to the proposed method based on the temporal partitioning that permits to minimize the array size of a FPGA by using the dynamic reconfiguration feature [30]. All these approaches assume the existence of a resources constraint and the goal of the two approaches is the minimization of hardware resources.…”
Section: Word-length N 8 Bits 12 Bits 16 Bitsmentioning
confidence: 99%
“…SPARCS [12] is an integrated partitioning and synthesis framework, which has a temporal partitioning tool to temporally divide and schedule the DFGs on a reconfigurable system. Tanougust et al [15] attempted to find the minimum area while meeting timing constraints during temporal partitioning. In [14], Spillane and Owen focused on finding a sequence of conditions for an optimized scheduling of configurations to achieve the desired trade-offs among reconfiguration time, operation speed and area.…”
Section: Introductionmentioning
confidence: 99%