用于帧内存压缩的像素并行SPIHT

2009 IEEE International SOC Conference (SOCC) Pub Date : 2009-09-01 DOI:10.1109/SOCCON.2009.5398002

Yongseok Jin, Hyuk-Jae Lee

{"title":"用于帧内存压缩的像素并行SPIHT","authors":"Yongseok Jin, Hyuk-Jae Lee","doi":"10.1109/SOCCON.2009.5398002","DOIUrl":null,"url":null,"abstract":"This paper proposes a novel frame memory compression algorithm, called Pixel-Parallel SPIHT (PPS) that processes image data in parallel to increase the encoding throughput. The throughput of a PPS coder is an average of 4.48 bits per cycle which is 48.7 times larger than that of No List SPIHT.","PeriodicalId":303505,"journal":{"name":"2009 IEEE International SOC Conference (SOCC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Pixel-Parallel SPIHT for frame memory compression\",\"authors\":\"Yongseok Jin, Hyuk-Jae Lee\",\"doi\":\"10.1109/SOCCON.2009.5398002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a novel frame memory compression algorithm, called Pixel-Parallel SPIHT (PPS) that processes image data in parallel to increase the encoding throughput. The throughput of a PPS coder is an average of 4.48 bits per cycle which is 48.7 times larger than that of No List SPIHT.\",\"PeriodicalId\":303505,\"journal\":{\"name\":\"2009 IEEE International SOC Conference (SOCC)\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International SOC Conference (SOCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOCCON.2009.5398002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International SOC Conference (SOCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOCCON.2009.5398002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

本文提出了一种新的帧存储压缩算法——像素并行SPIHT (PPS)，该算法对图像数据进行并行处理以提高编码吞吐量。PPS编码器的吞吐量平均为每周期4.48位，是无列表SPIHT的48.7倍。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Pixel-Parallel SPIHT for frame memory compression

This paper proposes a novel frame memory compression algorithm, called Pixel-Parallel SPIHT (PPS) that processes image data in parallel to increase the encoding throughput. The throughput of a PPS coder is an average of 4.48 bits per cycle which is 48.7 times larger than that of No List SPIHT.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 IEEE International SOC Conference (SOCC)

自引率

0.00%

发文量