{"title":"快速混合源编码设计","authors":"Zhu Chen, M. Lee","doi":"10.1109/ISITC.2007.71","DOIUrl":null,"url":null,"abstract":"We address a new representation of DCT/DFT/wavelet matrices via one hybrid architecture. Based on an element inverse matrix factorization algorithm, we show that the DCT, DFT and wavelet which based on Haar matrix have the similar recursive computational pattern, all of them can be decomposed to one orthogonal character matrix and a special sparse matrix. The special sparse matrix belongs to Jacket matrix, whose inverse can be from element-wise inverse or block-wise inverse. Based on this trait, we can develop a fast hybrid DCT/DFT/HWT source coding.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"On Fast Hybrid Source Coding Design\",\"authors\":\"Zhu Chen, M. Lee\",\"doi\":\"10.1109/ISITC.2007.71\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address a new representation of DCT/DFT/wavelet matrices via one hybrid architecture. Based on an element inverse matrix factorization algorithm, we show that the DCT, DFT and wavelet which based on Haar matrix have the similar recursive computational pattern, all of them can be decomposed to one orthogonal character matrix and a special sparse matrix. The special sparse matrix belongs to Jacket matrix, whose inverse can be from element-wise inverse or block-wise inverse. Based on this trait, we can develop a fast hybrid DCT/DFT/HWT source coding.\",\"PeriodicalId\":394071,\"journal\":{\"name\":\"2007 International Symposium on Information Technology Convergence (ISITC 2007)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Symposium on Information Technology Convergence (ISITC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITC.2007.71\",\"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 Information Technology Convergence (ISITC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITC.2007.71","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We address a new representation of DCT/DFT/wavelet matrices via one hybrid architecture. Based on an element inverse matrix factorization algorithm, we show that the DCT, DFT and wavelet which based on Haar matrix have the similar recursive computational pattern, all of them can be decomposed to one orthogonal character matrix and a special sparse matrix. The special sparse matrix belongs to Jacket matrix, whose inverse can be from element-wise inverse or block-wise inverse. Based on this trait, we can develop a fast hybrid DCT/DFT/HWT source coding.