{"title":"Kronecker积表示的快速变换算法","authors":"C. Lazar","doi":"10.1109/MELCON.1991.161858","DOIUrl":null,"url":null,"abstract":"The Kronecker products decomposition of discrete unitary transforms and a class of fast nonlinear transforms is presented. A useful formalism for fast transform representation that can be generated by using a single recursion formula based on Kronecker notation is described.<<ETX>>","PeriodicalId":193917,"journal":{"name":"[1991 Proceedings] 6th Mediterranean Electrotechnical Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast transform algorithms representation by Kronecker product\",\"authors\":\"C. Lazar\",\"doi\":\"10.1109/MELCON.1991.161858\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Kronecker products decomposition of discrete unitary transforms and a class of fast nonlinear transforms is presented. A useful formalism for fast transform representation that can be generated by using a single recursion formula based on Kronecker notation is described.<<ETX>>\",\"PeriodicalId\":193917,\"journal\":{\"name\":\"[1991 Proceedings] 6th Mediterranean Electrotechnical Conference\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991 Proceedings] 6th Mediterranean Electrotechnical Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MELCON.1991.161858\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991 Proceedings] 6th Mediterranean Electrotechnical Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MELCON.1991.161858","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast transform algorithms representation by Kronecker product
The Kronecker products decomposition of discrete unitary transforms and a class of fast nonlinear transforms is presented. A useful formalism for fast transform representation that can be generated by using a single recursion formula based on Kronecker notation is described.<>
![[1991 Proceedings] 6th Mediterranean Electrotechnical Conference](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
