{"title":"多媒体用ml分解二进制算法编码器的新型可配置结构","authors":"Yu-Jen Chen, Chen-Han Tsai, Liang-Gee Chen","doi":"10.1109/VDAT.2007.373238","DOIUrl":null,"url":null,"abstract":"A novel architecture of ML-decomposed binary arithmetic coder is proposed. Through the analysis of previous designs, the traditional processing unit is divided into two parts, MPS encoder and LPS encoder. With different arrangements of these two basic components, we develop two types of ML-decomposed structures. To increase the throughput of arithmetic coding, ML cascade architecture puts the coders in serial, while throughput-selection architecture offers several choices in parallel. Their design methodologies are described in this paper. Both methods achieve very high throughput, more than 800 M symbols/sec. And they are configurable and extensible to supply a wide range of specifications. Moreover, the proposed architecture can be used in binary arithmetic coding of various video and image standards.","PeriodicalId":137915,"journal":{"name":"2007 International Symposium on VLSI Design, Automation and Test (VLSI-DAT)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Novel Configurable Architecture of ML-Decomposed Binary Arithmetic Encoder for Multimedia Applications\",\"authors\":\"Yu-Jen Chen, Chen-Han Tsai, Liang-Gee Chen\",\"doi\":\"10.1109/VDAT.2007.373238\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel architecture of ML-decomposed binary arithmetic coder is proposed. Through the analysis of previous designs, the traditional processing unit is divided into two parts, MPS encoder and LPS encoder. With different arrangements of these two basic components, we develop two types of ML-decomposed structures. To increase the throughput of arithmetic coding, ML cascade architecture puts the coders in serial, while throughput-selection architecture offers several choices in parallel. Their design methodologies are described in this paper. Both methods achieve very high throughput, more than 800 M symbols/sec. And they are configurable and extensible to supply a wide range of specifications. Moreover, the proposed architecture can be used in binary arithmetic coding of various video and image standards.\",\"PeriodicalId\":137915,\"journal\":{\"name\":\"2007 International Symposium on VLSI Design, Automation and Test (VLSI-DAT)\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Symposium on VLSI Design, Automation and Test (VLSI-DAT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VDAT.2007.373238\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on VLSI Design, Automation and Test (VLSI-DAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VDAT.2007.373238","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Novel Configurable Architecture of ML-Decomposed Binary Arithmetic Encoder for Multimedia Applications
A novel architecture of ML-decomposed binary arithmetic coder is proposed. Through the analysis of previous designs, the traditional processing unit is divided into two parts, MPS encoder and LPS encoder. With different arrangements of these two basic components, we develop two types of ML-decomposed structures. To increase the throughput of arithmetic coding, ML cascade architecture puts the coders in serial, while throughput-selection architecture offers several choices in parallel. Their design methodologies are described in this paper. Both methods achieve very high throughput, more than 800 M symbols/sec. And they are configurable and extensible to supply a wide range of specifications. Moreover, the proposed architecture can be used in binary arithmetic coding of various video and image standards.