Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

PLDI

2003

ACM

2003

ACM

As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacriﬁcing eﬃciency. Toward this end, we present a set of aggressive optimizations that target linear sections of a stream program. Our input language is StreamIt, which represents programs as a hierarchical graph of autonomous ﬁlters. A ﬁlter is linear if each of its outputs can be represented as an aﬃne combination of its inputs. Linearity is common in DSP components; examples include FIR ﬁlters, expanders, compressors, FFTs and DCTs. We demonstrate that several algorithmic transformations, traditionally hand-tuned by DSP experts, can be completely automated by the compiler. First, we present a linear extraction analysis that automatically detects linear ﬁlters from the C-like code in their work function. Then, we give a procedure for combining adjacent linear ﬁlters into a single ﬁlter, as well as for translating a linear ﬁl...

Related Content

Added |
05 Jul 2010 |

Updated |
05 Jul 2010 |

Type |
Conference |

Year |
2003 |

Where |
PLDI |

Authors |
Andrew A. Lamb, William Thies, Saman P. Amarasinghe |

Comments (0)