A Method for Mapping DSP Algorithms into Application Specific Structures

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Anatoli Sergyienko Articles by Juri Kanevski Articles by Oleg Maslennikov Articles by Roman Wyrzykowski

24 th. EUROMICRO Conference Volume 1 (EUROMICRO'98)

Västerås, Sweden

August 25-August 27

ISBN: 0-8186-8646-4

	ASCII Text	x
	Anatoli Sergyienko, Juri Kanevski, Oleg Maslennikov, Roman Wyrzykowski, "A Method for Mapping DSP Algorithms into Application Specific Structures," EUROMICRO Conference, vol. 1, pp. 10365, 24 th. EUROMICRO Conference Volume 1 (EUROMICRO'98), 1998.

	BibTex	x
	@article{ 10.1109/EURMIC.1998.711828, author = {Anatoli Sergyienko and Juri Kanevski and Oleg Maslennikov and Roman Wyrzykowski}, title = {A Method for Mapping DSP Algorithms into Application Specific Structures}, journal ={EUROMICRO Conference}, volume = {1}, year = {1998}, issn = {1089-6503}, pages = {10365}, doi = {http://doi.ieeecomputersociety.org/10.1109/EURMIC.1998.711828}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - EUROMICRO Conference TI - A Method for Mapping DSP Algorithms into Application Specific Structures SN - 1089-6503 SP EP A1 - Anatoli Sergyienko, A1 - Juri Kanevski, A1 - Oleg Maslennikov, A1 - Roman Wyrzykowski, PY - 1998 KW - null VL - 1 JA - EUROMICRO Conference ER -

Anatoli Sergyienko, National Technical University of Ukraine

Juri Kanevski, Technical University of Koszalin

Oleg Maslennikov, Technical University of Koszalin

Roman Wyrzykowski, Technical University of Czestochowa

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EURMIC.1998.711828

A method for mapping DSP algorithms represented by unimodular loop nests into application specific structures is presented. The method consists in 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 a IIR-filter structure illustrates the mapping process.

Citation:

Anatoli Sergyienko, Juri Kanevski, Oleg Maslennikov, Roman Wyrzykowski, "A Method for Mapping DSP Algorithms into Application Specific Structures," euromicro, vol. 1, pp.10365, 24 th. EUROMICRO Conference Volume 1 (EUROMICRO'98), 1998

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.