Algorithm/Architecture Co-Exploration for Visual Computing
博士 === 國立成功大學 === 電機工程學系碩博士班 === 98 === This thesis presents a novel Algorithm/Architecture Co-exploration (AAC) design methodology that can concurrently explore both algorithms and architectures for the increasingly complex visual computing systems required for high-quality applications. Algorithmi...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/50439238572696881610 |
id |
ndltd-TW-098NCKU5442246 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-098NCKU54422462016-04-22T04:22:58Z http://ndltd.ncl.edu.tw/handle/50439238572696881610 Algorithm/Architecture Co-Exploration for Visual Computing 演算法暨架構共同探索於視訊運算 He-YuanLin 林和源 博士 國立成功大學 電機工程學系碩博士班 98 This thesis presents a novel Algorithm/Architecture Co-exploration (AAC) design methodology that can concurrently explore both algorithms and architectures for the increasingly complex visual computing systems required for high-quality applications. Algorithmic complexity analysis and dataflow modeling at various granularities play significant roles in the presented concurrent optimization of both algorithms and architectures. To extract essential architectural information in early design stages and thus optimize the targeted architectures or platforms, the complexity measurements must be intrinsic. That is, they should be transparent to implementation details or design constraints and of course unbiased with regard to either hardware or software. This thesis introduces important intrinsic complexity measurements, including the number of operations, degree of parallelism, data transfer rate, and storage configuration. To accurately quantify the intrinsic algorithmic complexity, this thesis presents a systematic complexity analysis framework based on the eigen-decomposition of dataflow graphs at multiple granularities. The extracted complexity can reveal sufficient architectural information, enabling early back-annotation for modifying algorithms. In addition, this thesis also discusses the interplay among four complexity metrics, which significantly enlarges the architectural space. Several case studies based on the novel AAC methodology for electronic system level (ESL) design are also presented. Experimental results reveal that the introduced methodology can not only accurately characterize the algorithmic complexity but also facilitate the design space exploration of visual computing systems for generic platforms or architectures such as application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), reconfigurable architectures, and system-on-a-chip (SoC), single-processor, single instruction multiple data (SIMD), and multicore systems. Using the innovative AAC methodology, this thesis presents a better porting of the discrete wavelet transform onto SIMD; a high-quality, low-cost motion estimation ASIC; an efficient frame rate up-convertor on an FPGA; and a high-resolution de-interlacer on a low-cost consumer multicore platform for real-time visual computing applications. The significantly enhanced mapping of algorithms onto various platforms reveals the advantages and contributions of the presented design methodology. Gwo Giun Lee 李國君 2010 學位論文 ; thesis 111 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
博士 === 國立成功大學 === 電機工程學系碩博士班 === 98 === This thesis presents a novel Algorithm/Architecture Co-exploration (AAC) design methodology that can concurrently explore both algorithms and architectures for the increasingly complex visual computing systems required for high-quality applications. Algorithmic complexity analysis and dataflow modeling at various granularities play significant roles in the presented concurrent optimization of both algorithms and architectures. To extract essential architectural information in early design stages and thus optimize the targeted architectures or platforms, the complexity measurements must be intrinsic. That is, they should be transparent to implementation details or design constraints and of course unbiased with regard to either hardware or software. This thesis introduces important intrinsic complexity measurements, including the number of operations, degree of parallelism, data transfer rate, and storage configuration. To accurately quantify the intrinsic algorithmic complexity, this thesis presents a systematic complexity analysis framework based on the eigen-decomposition of dataflow graphs at multiple granularities. The extracted complexity can reveal sufficient architectural information, enabling early back-annotation for modifying algorithms. In addition, this thesis also discusses the interplay among four complexity metrics, which significantly enlarges the architectural space. Several case studies based on the novel AAC methodology for electronic system level (ESL) design are also presented. Experimental results reveal that the introduced methodology can not only accurately characterize the algorithmic complexity but also facilitate the design space exploration of visual computing systems for generic platforms or architectures such as application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), reconfigurable architectures, and system-on-a-chip (SoC), single-processor, single instruction multiple data (SIMD), and multicore systems. Using the innovative AAC methodology, this thesis presents a better porting of the discrete wavelet transform onto SIMD; a high-quality, low-cost motion estimation ASIC; an efficient frame rate up-convertor on an FPGA; and a high-resolution de-interlacer on a low-cost consumer multicore platform for real-time visual computing applications. The significantly enhanced mapping of algorithms onto various platforms reveals the advantages and contributions of the presented design methodology.
|
author2 |
Gwo Giun Lee |
author_facet |
Gwo Giun Lee He-YuanLin 林和源 |
author |
He-YuanLin 林和源 |
spellingShingle |
He-YuanLin 林和源 Algorithm/Architecture Co-Exploration for Visual Computing |
author_sort |
He-YuanLin |
title |
Algorithm/Architecture Co-Exploration for Visual Computing |
title_short |
Algorithm/Architecture Co-Exploration for Visual Computing |
title_full |
Algorithm/Architecture Co-Exploration for Visual Computing |
title_fullStr |
Algorithm/Architecture Co-Exploration for Visual Computing |
title_full_unstemmed |
Algorithm/Architecture Co-Exploration for Visual Computing |
title_sort |
algorithm/architecture co-exploration for visual computing |
publishDate |
2010 |
url |
http://ndltd.ncl.edu.tw/handle/50439238572696881610 |
work_keys_str_mv |
AT heyuanlin algorithmarchitecturecoexplorationforvisualcomputing AT línhéyuán algorithmarchitecturecoexplorationforvisualcomputing AT heyuanlin yǎnsuànfǎjìjiàgòugòngtóngtànsuǒyúshìxùnyùnsuàn AT línhéyuán yǎnsuànfǎjìjiàgòugòngtóngtànsuǒyúshìxùnyùnsuàn |
_version_ |
1718229855692128256 |