{"title":"Area and throughput trade-offs in design of arithmetic encoder for JPEG2000","authors":"Baofeng Li, Y. Dou, Yuanwu Lei","doi":"10.1109/APCCAS.2008.4746023","DOIUrl":null,"url":null,"abstract":"Because of serial inherence of the arithmetic encoder (AE) for the embedded block coding algorithm in JPEG2000, efficient hardware implementation of AE plays a key role in overall system throughput. In this paper, four pipelined architectures which are single-symbol coding 3-stage pipeline, single-symbol coding 4-stage pipeline, two-symbol coding 3-stage pipeline and two-symbol coding 4-stage pipeline, are investigated. Results from FPGA-based implementations show that the single-symbol coding 3-stage pipeline architecture has the best actual throughput ((133N)/(N + 2) CX/S pairs per second) and occupies the least resources (1100 ALUTs and 365 registers) in all four. Compared with several related works, our designs outperforms them in terms of tradeoff of area and throughput.","PeriodicalId":344917,"journal":{"name":"APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCCAS.2008.4746023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Because of serial inherence of the arithmetic encoder (AE) for the embedded block coding algorithm in JPEG2000, efficient hardware implementation of AE plays a key role in overall system throughput. In this paper, four pipelined architectures which are single-symbol coding 3-stage pipeline, single-symbol coding 4-stage pipeline, two-symbol coding 3-stage pipeline and two-symbol coding 4-stage pipeline, are investigated. Results from FPGA-based implementations show that the single-symbol coding 3-stage pipeline architecture has the best actual throughput ((133N)/(N + 2) CX/S pairs per second) and occupies the least resources (1100 ALUTs and 365 registers) in all four. Compared with several related works, our designs outperforms them in terms of tradeoff of area and throughput.