{"title":"最快的四元线性无关变换类","authors":"B. Falkowski, Cheng Fu","doi":"10.1109/ISMVL.2005.12","DOIUrl":null,"url":null,"abstract":"In this paper, four classes of quaternary linearly independent transformations, which possess fastest forward and inverse transforms with the lowest computational cost have been presented. All the transform matrices are recursively defined and have consistent formulas relating forward and inverse matrices. Computational costs of the calculation for presented transforms have also been discussed.","PeriodicalId":340578,"journal":{"name":"35th International Symposium on Multiple-Valued Logic (ISMVL'05)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Classes of fastest quaternary linearly independent transformations\",\"authors\":\"B. Falkowski, Cheng Fu\",\"doi\":\"10.1109/ISMVL.2005.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, four classes of quaternary linearly independent transformations, which possess fastest forward and inverse transforms with the lowest computational cost have been presented. All the transform matrices are recursively defined and have consistent formulas relating forward and inverse matrices. Computational costs of the calculation for presented transforms have also been discussed.\",\"PeriodicalId\":340578,\"journal\":{\"name\":\"35th International Symposium on Multiple-Valued Logic (ISMVL'05)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"35th International Symposium on Multiple-Valued Logic (ISMVL'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2005.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"35th International Symposium on Multiple-Valued Logic (ISMVL'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2005.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Classes of fastest quaternary linearly independent transformations
In this paper, four classes of quaternary linearly independent transformations, which possess fastest forward and inverse transforms with the lowest computational cost have been presented. All the transform matrices are recursively defined and have consistent formulas relating forward and inverse matrices. Computational costs of the calculation for presented transforms have also been discussed.