TY - GEN
T1 - Algorithmic complexity analysis on data transfer rate and data storage for multidimensional signal processing
AU - Lee, Gwo-Giun
AU - Chen, Chun Fu
AU - Lin, He Yuan
PY - 2013/1/1
Y1 - 2013/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84896455430&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84896455430&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84896455430
SN - 9781467362382
T3 - IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation
SP - 171
EP - 176
BT - 2013 IEEE Workshop on Signal Processing Systems, SiPS 2013
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2013 IEEE Workshop on Signal Processing Systems, SiPS 2013
Y2 - 16 October 2013 through 18 October 2013
ER -