Algorithm/Architecture co-design of the generalized sampling theorem based de-interlacer

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

De-interlacing is a major determinant of image quality in a modern display processing chain. The de-interlacing method based on the generalized sampling theorem (GST) applied to motion estimation and motion compensation provides the best de-interlacing results. With HDTV interlaced input material (1920*1080i), this method requires about 1000 GOPs and a communication bandwidth around 10 Gbytes/sec. We analyze and simplify the algorithm and propose a processing architecture. As a result, the operation count of the motion estimator decreases with a factor of 5.5 and the bandwidth to local pixel storage with a factor of 3.3 with only mild and acceptable quality loss. We present a task breakup and a suitable heterogeneous multi-processor architecture. The task break-up is such that the computational load of the processors is balanced and the flexibility of the architecture is preserved within the application domain. To cope with the large memory bandwidth requirements, we exploit locality of reference with multi-level scratchpad memories. © 2005 IEEE.

Cite

CITATION STYLE

APA

Beri’c, A., Haan, G. D., Sethuraman, R., & Meerbergen, J. V. (2005). Algorithm/Architecture co-design of the generalized sampling theorem based de-interlacer. In Proceedings - IEEE International Symposium on Circuits and Systems (pp. 2943–2946). https://doi.org/10.1109/ISCAS.2005.1465244

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free