Proceedings of the International Conference on Compilers, Architectures and Synthesis for Embedded Systems - CASES '03 2003
DOI: 10.1145/951713.951714
|View full text |Cite
|
Sign up to set email alerts
|

Vectorizing for a SIMdD DSP architecture

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Year Published

2006
2006
2011
2011

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 11 publications
(19 citation statements)
references
References 0 publications
0
19
0
Order By: Relevance
“…The SIMdD (Single Instruction Multiple disjoint Data) architecture contains the multi-port vector memory unit which allows accessing disjoint data with no overhead [8]. Although the SIMdD shows a good performance, it is based on the costly multi-port memory.…”
Section: Related Workmentioning
confidence: 99%
“…The SIMdD (Single Instruction Multiple disjoint Data) architecture contains the multi-port vector memory unit which allows accessing disjoint data with no overhead [8]. Although the SIMdD shows a good performance, it is based on the costly multi-port memory.…”
Section: Related Workmentioning
confidence: 99%
“…A different approach to eliminate data-permutation instructions named single-instruction multiple disjoint data (SIMdD) has been proposed in the eLite DSP architecture [Moreno et al 2003;Naishlos et al 2003]. Instead of a vector register file, the eLite DSP employs a large scalar register file, the vector element file (VEF).…”
Section: Related Workmentioning
confidence: 99%
“…The FIR filter was selected for several reasons. First, it can be vectorized in a number of ways, for example with either inner-loop or outer-loop vectorization, on different SIMD platforms [10,16,25,8]. Figure 4 demonstrates the difference between inner-loop vectorization (regular vectorization of the innermost loop) and outer-loop vectorization, using a vector size of 4.…”
Section: Benchmark Descriptionmentioning
confidence: 99%
“…The compiler can then arrange to exploit this data reuse by computing the overall range of data that is being accessed throughout the execution of a loop, and preload it in advance into the vectorregister file, thereby making sure that all elements in that range are loaded exactly once. This data can then be accessed indirectly via the vector maps of iVMX, updated to index "sliding windows" of vector registers, similarly to the eLite architecture with its vector pointers [16].…”
Section: Compiler Optimizationsmentioning
confidence: 99%
See 1 more Smart Citation