{"title":"二维不可分离离散小波变换的位序列收缩结构","authors":"B. K. Mohanty, P. Meher","doi":"10.1109/ICIAS.2007.4658605","DOIUrl":null,"url":null,"abstract":"In this paper, we have presented a bit-serial systolic-like architecture for the computation of non-separable two-dimensional discrete wavelet transform (2-D DWT) based on the principle of distributed arithmetic. The computational core of the proposed structure is highly regular and modular. The computations which become redundant due to the decimation process are eliminated to obtain a low-complexity computing algorithm for the 2-D DWT. Moreover, it exploits the advantage of constant wavelet filter-base in the DA-based structure to reduce the hardware-complexity. It is shown that the proposed structure involves very low hardware complexity, and significantly less area-time complexity compared with the existing bit-level designs.","PeriodicalId":348978,"journal":{"name":"Proceedings of the 2009 12th International Symposium on Integrated Circuits","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Bit-serial systolic architecture for 2-D non-separable discrete wavelet transform\",\"authors\":\"B. K. Mohanty, P. Meher\",\"doi\":\"10.1109/ICIAS.2007.4658605\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we have presented a bit-serial systolic-like architecture for the computation of non-separable two-dimensional discrete wavelet transform (2-D DWT) based on the principle of distributed arithmetic. The computational core of the proposed structure is highly regular and modular. The computations which become redundant due to the decimation process are eliminated to obtain a low-complexity computing algorithm for the 2-D DWT. Moreover, it exploits the advantage of constant wavelet filter-base in the DA-based structure to reduce the hardware-complexity. It is shown that the proposed structure involves very low hardware complexity, and significantly less area-time complexity compared with the existing bit-level designs.\",\"PeriodicalId\":348978,\"journal\":{\"name\":\"Proceedings of the 2009 12th International Symposium on Integrated Circuits\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2009 12th International Symposium on Integrated Circuits\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIAS.2007.4658605\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2009 12th International Symposium on Integrated Circuits","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIAS.2007.4658605","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Bit-serial systolic architecture for 2-D non-separable discrete wavelet transform
In this paper, we have presented a bit-serial systolic-like architecture for the computation of non-separable two-dimensional discrete wavelet transform (2-D DWT) based on the principle of distributed arithmetic. The computational core of the proposed structure is highly regular and modular. The computations which become redundant due to the decimation process are eliminated to obtain a low-complexity computing algorithm for the 2-D DWT. Moreover, it exploits the advantage of constant wavelet filter-base in the DA-based structure to reduce the hardware-complexity. It is shown that the proposed structure involves very low hardware complexity, and significantly less area-time complexity compared with the existing bit-level designs.