loading...
Mapping DSP Algorithms into FPGA
Bialystok, Poland September 13-September 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PARELEC.2006.51International Symposium on Parallel C ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Oleg Maslennikow, Technical University of Koszalin, Poland
Anatolij Sergiyenko, National Technical University of Ukraine, Ukraine
A method of mapping DSP algorithms into FPGA devices is considered. Algorithms are represented by synchronous data flow graphs, and are mapped into pipelined data path. The method consists of placing the algorithm graph in the multidimensional index space and mapping it into structure and event subspaces. The special limitations, which are injected to the mapping process, minimize both clock time and hardware volume including multiplexer inputs.
Citation:
Oleg Maslennikow, Anatolij Sergiyenko, "Mapping DSP Algorithms into FPGA," parelec, pp.208-213, International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.