Show simple item record

system synthesis for image processing applications

dc.contributor.advisorBhattacharyya, Shuvra S.en_US
dc.contributor.authorKo, Dong-Iken_US
dc.description.abstractOver the past few decades, embedded systems have been widely infiltrated into our daily lives. Prominent examples are cellular phones, personal digital assistants, digital television set-top boxes, and web-pads. New kinds of embedded devices are being introduced continually for various purposes. Embedded systems have different combinations and prioritizations of objectives and constraints for their proper design. With the increasing complexity in application functionality, implementation constraints, and optimization objectives, more effective techniques for modeling embedded applications, and for systematically synthesizing implementations become more and more desirable on one hand, and more and more challenging on the other. In this thesis, we focus on the efficient design, implementation, and synthesis of signal processing applications, which form a broad and important class of embedded systems. We place special emphasis in the thesis on the signal processing domain on image processing, a sector that has seen rapidly increasing demand in recent years, but for which present techniques for signal processing design are often lacking in modeling and optimization capability. We propose novel models and algorithms for streamlining scheduling, memory management, and interprocessor communication in embedded multiprocessor implementations of signal processing applications, with the aforementioned emphasis on the image processing domain. For application modeling, we propose two novel modeling techniques called blocked dataflow (BLDF) and dynamic graph topology (DGT). These modeling approaches capture within their respective formal frameworks the structure of block-based image processing operations and reconfigurable, multi-mode dataflow behaviors, respectively. For scheduling, we develop a novel intermediate representation called the pipeline decomposition tree (PDT). The PDT provides efficient representation and analysis of alternative multiprocessing configurations for signal processing applications. We also develop an algorithm, called pipeline decomposition tree scheduling (PDT scheduling), which applies the PDT to systematically derive optimized multiprocessor schedules that employ coarse-grained (task-level) pipelining, which is an especially useful form of parallelism for signal processing. To optimize interprocessor communication, we develop two novel post-optimization techniques for hardware resource mapping and software synthesis. The suite of techniques presented in this thesis address image processing system optimization at key phases in the design process and lead to significant improvements in performance and cost.en_US
dc.format.extent3360840 bytes
dc.titlesystem synthesis for image processing applicationsen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.contributor.departmentElectrical Engineeringen_US
dc.subject.pqcontrolledEngineering, Electronics and Electricalen_US
dc.subject.pqcontrolledComputer Scienceen_US
dc.subject.pquncontrolledDataflow based modelingen_US
dc.subject.pquncontrolledEmbedded system optimizationen_US
dc.subject.pquncontrolledConstraints aware multiprocessor schedulingen_US
dc.subject.pquncontrolledDSP system modeling and synthesisen_US
dc.subject.pquncontrolledHardware and software Co-designen_US
dc.subject.pquncontrolledPipeline based schedulingen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record