{"title":"通用视频编解码器运动补偿中的带宽高效自适应类缓存缓冲结构","authors":"Jaehyun Kim, Sungoh Kim, T. Kosuge","doi":"10.1109/ICCE-BERLIN.2011.6031862","DOIUrl":null,"url":null,"abstract":"In this paper, we propose the cache-like hardware architecture of motion compensation for general hybrid video codec. The proposed architecture exploits dynamic cache-like buffer structure. Typically, every macroblock unit (MBU) fetches a constant amount of reference data from the external video memory for cache update. However, when the updated data is centered at a fixed position, e.g. considering a zero motion, hit ratio of the cache buffer updates tends to be abruptly dropped. To cope with this problem, an adaptive cache-like buffer shift algorithm was used. From our experimental results, it was demonstrated that the proposed algorithm successfully increased up to the maximum 15 % in cache hit ratio and raised the lowest bound of hit ratio to 85 %.","PeriodicalId":236486,"journal":{"name":"2011 IEEE International Conference on Consumer Electronics -Berlin (ICCE-Berlin)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bandwidth-efficient adaptive cache-like buffer architecture in motion compensation for general video codec\",\"authors\":\"Jaehyun Kim, Sungoh Kim, T. Kosuge\",\"doi\":\"10.1109/ICCE-BERLIN.2011.6031862\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose the cache-like hardware architecture of motion compensation for general hybrid video codec. The proposed architecture exploits dynamic cache-like buffer structure. Typically, every macroblock unit (MBU) fetches a constant amount of reference data from the external video memory for cache update. However, when the updated data is centered at a fixed position, e.g. considering a zero motion, hit ratio of the cache buffer updates tends to be abruptly dropped. To cope with this problem, an adaptive cache-like buffer shift algorithm was used. From our experimental results, it was demonstrated that the proposed algorithm successfully increased up to the maximum 15 % in cache hit ratio and raised the lowest bound of hit ratio to 85 %.\",\"PeriodicalId\":236486,\"journal\":{\"name\":\"2011 IEEE International Conference on Consumer Electronics -Berlin (ICCE-Berlin)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Consumer Electronics -Berlin (ICCE-Berlin)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCE-BERLIN.2011.6031862\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Consumer Electronics -Berlin (ICCE-Berlin)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCE-BERLIN.2011.6031862","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Bandwidth-efficient adaptive cache-like buffer architecture in motion compensation for general video codec
In this paper, we propose the cache-like hardware architecture of motion compensation for general hybrid video codec. The proposed architecture exploits dynamic cache-like buffer structure. Typically, every macroblock unit (MBU) fetches a constant amount of reference data from the external video memory for cache update. However, when the updated data is centered at a fixed position, e.g. considering a zero motion, hit ratio of the cache buffer updates tends to be abruptly dropped. To cope with this problem, an adaptive cache-like buffer shift algorithm was used. From our experimental results, it was demonstrated that the proposed algorithm successfully increased up to the maximum 15 % in cache hit ratio and raised the lowest bound of hit ratio to 85 %.