Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2119
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSrivastava, Gaurav-
dc.contributor.authorMuralidhar, P.-
dc.contributor.authorRama Rao, C.B.-
dc.date.accessioned2024-12-26T06:49:16Z-
dc.date.available2024-12-26T06:49:16Z-
dc.date.issued2014-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/2119-
dc.descriptionNITWen_US
dc.description.abstractThe paper implements a shift based diamond search architecture, for HDTV videos. High resolution frames like 720p need large memory to store the pixel data. This large pixel data is stored on an external memory and an internal local memory is updated with the pixel data on the reference frame and current frame required for particular diamond search iterations. This is done as internal memory is expensive. However, accessing pixel data from external memory incurs high timing latency. This paper implements a shift based DS architecture to shift data in internal local memory and update from external memory only the pixels which are new to search area. This reduces the redundant operation of accessing same pixel data for successive searches. Even when considering equal latency for internal and external memory access, when simulation was performed on the same sample 720p frame, architectures with no shift block took 173.170ms vs with shift block took 90.564ms. When considering the latency of external memory access this difference in timing becomes largely significant.en_US
dc.language.isoenen_US
dc.publisher2014 International Conference on Devices, Circuits and Communications, ICDCCom 2014 - Proceedingsen_US
dc.subjectSrivastava,en_US
dc.subjectGauraven_US
dc.subjectMuralidhar,en_US
dc.subjectPen_US
dc.subjectRama Rao,en_US
dc.subjectC.Ben_US
dc.titleA High Throughput Diamond Search Architecture with Shift Mechanism for 720p Motion Estimationen_US
dc.typeOtheren_US
Appears in Collections:Electronics and Communication Engineering



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.