DocumentCode
649045
Title
Algorithmic complexity analysis on data transfer rate and data storage for multidimensional signal processing
Author
Gwo Giun Lee ; Chun-Fu Chen ; He-Yuan Lin
Author_Institution
Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan
fYear
2013
fDate
16-18 Oct. 2013
Firstpage
171
Lastpage
176
Abstract
Algorithmic complexity, such as data storage size and data transfer rate, is dramatically increased in multidimensional signal processing, including visual computing exploiting temporal and spatial information to achieve better visual quality. This paper present a systematic method, which is a new paradigm of designing on the complex multidimensional signal and is called as algorithm/architecture co-exploration, to efficiently quantify the algorithmic complexity, including data storage and data transfer rate, whose characteristics are independent from platforms. By exploring design space based on the dataflow with different executing orders and various data granularities, the trade-off between data storage size and data transfer rate is made by a systematic manner and hence the algorithm could be smoothly mapped onto architecture. Case studies reveal that our framework can effectively characterize the complexity of algorithms, and that the extracted complexity can facilitate design space exploration at various data granularities.
Keywords
computational complexity; multidimensional signal processing; smoothing methods; video coding; H.264/AVC; algorithm-architecture co-exploration; algorithmic complexity analysis; data granularities; data storage; data transfer rate; design space exploration; multidimensional signal processing; visual computing; visual quality; algorithm/architecture co-exploration; data storage; data transfer rate; dataflow model;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Systems (SiPS), 2013 IEEE Workshop on
Conference_Location
Taipei City
ISSN
2162-3562
Type
conf
DOI
10.1109/SiPS.2013.6674500
Filename
6674500
Link To Document