IEEE International Symposium on Circuits and Systems
DOI: 10.1109/iscas.1989.100415
|View full text |Cite
|
Sign up to set email alerts
|

System design, optimization and intelligent code generation for standard digital signal processors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…But in a scheme developed in 1989 by Genin et al [155], a similar routine is executed before code generation. Targeting digital signal processors, their compiler first transforms the program into an internal signal-flow graph (ISFG), and then executes a routine-Genin et al called it a pattern matcher-which attempts to find several low-level operations in the ISFG that can be merged into single nodes.…”
Section: Running Peephole Optimization Before Instruction Selectionmentioning
confidence: 99%
“…But in a scheme developed in 1989 by Genin et al [155], a similar routine is executed before code generation. Targeting digital signal processors, their compiler first transforms the program into an internal signal-flow graph (ISFG), and then executes a routine-Genin et al called it a pattern matcher-which attempts to find several low-level operations in the ISFG that can be merged into single nodes.…”
Section: Running Peephole Optimization Before Instruction Selectionmentioning
confidence: 99%
“…On the one hand, he has to achieve a performance close to manual assembler code (as this would otherwise defeat the purpose of employing a special purpose processor) and on the other hand, he has to deal with a very specialized and arcane instruction set. Two major compilation/code generation approaches are currently in use: block oriented and direct code generation [4]. Examples of the block oriented systems are Grape [16], Gabriel [3] and its successor Ptolemy [11].…”
Section: Software Compilers For Single Programmable Dsp Processors (Pmentioning
confidence: 99%
“…While this approach ensures near optimal assembler code, it suffers from a lack of portability and depends heavily on the library size and quality. The reverse is true for the direct code generation, [4].…”
Section: Software Compilers For Single Programmable Dsp Processors (Pmentioning
confidence: 99%
“…One way to guarantee both properties is to impose certain restrictions so that the considered subset of DPNs are deterministic and have decidable boundedness or liveness problems. Synchronous data-flow (SDF) networks [4,6,9,21,[25][26][27] and cyclo-static data-flow networks [7,12] are such restricted nets, which have become very successful, in particular, for the synthesis of signal processing systems [1,6,13,14,22,23,29,31]. They are a special kind of DPNs where in each firing step, the process node always consumes the same number of data values from the input streams and produces the same number of data values for the output streams.…”
Section: Introductionmentioning
confidence: 99%