A method for mapping DSP algorithms into application specific structures

Author

Sergyienko, Anatoli ; Kanevski, Juri ; Maslennikov, Oleg ; Wyrzykowski, Roman

Author_Institution

Dept. of Comput. Sci., Nat. Tech. Univ. of Ukraine, Kiev, Ukraine

Volume

1

fYear

1998

fDate

25-27 Aug 1998

Firstpage

365

Abstract

A method for mapping DSP algorithms represented by unimodular loop nests into application specific structures is presented. The method consists of representing the reduced dependence graph of an algorithm in the multidimensional index space, and mapping this graph into a subspace of structure and subspace of events. Some restrictions, which constrain the reduced dependence graph, help to simplify the mapping process, and to get pipelined processing units. An example of synthesis of an IIR filter structure illustrates the mapping process

Keywords

IIR filters; application specific integrated circuits; circuit CAD; digital signal processing chips; graph theory; pipeline processing; signal processing; DSP algorithm mapping; IIR filter structure; application specific structures; mapping process; multidimensional index space; pipelined processing units; reduced dependence graph; unimodular loop nests; Application software; Computer science; Design methodology; Digital signal processing; Digital signal processing chips; Field programmable gate arrays; Hardware; Iterative algorithms; Systolic arrays; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Euromicro Conference, 1998. Proceedings. 24th

Conference_Location

Vasteras

ISSN

1089-6503

Print_ISBN

0-8186-8646-4

Type

conf

DOI

10.1109/EURMIC.1998.711828

Filename

711828