{"title":"基于斐波那契递归的离散正交变换","authors":"K. Egiazarian, J. Astola","doi":"10.1109/DSPWS.1996.555547","DOIUrl":null,"url":null,"abstract":"The idea of unified Fibonacci-type topology is used for construction of wide classes of discrete orthogonal transforms, including Rademacher-Fibonacci, Walsh-Fibonacci, Haar-Fibonacci-type transforms, etc. Efficient algorithms for proposed transforms directly related with the generalized Fibonacci topology are derived. The generation of discrete wavelets and wavelet packets based on Fibonacci-type recursions is established.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Discrete orthogonal transforms based on Fibonacci-type recursions\",\"authors\":\"K. Egiazarian, J. Astola\",\"doi\":\"10.1109/DSPWS.1996.555547\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The idea of unified Fibonacci-type topology is used for construction of wide classes of discrete orthogonal transforms, including Rademacher-Fibonacci, Walsh-Fibonacci, Haar-Fibonacci-type transforms, etc. Efficient algorithms for proposed transforms directly related with the generalized Fibonacci topology are derived. The generation of discrete wavelets and wavelet packets based on Fibonacci-type recursions is established.\",\"PeriodicalId\":131323,\"journal\":{\"name\":\"1996 IEEE Digital Signal Processing Workshop Proceedings\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1996 IEEE Digital Signal Processing Workshop Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DSPWS.1996.555547\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1996 IEEE Digital Signal Processing Workshop Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSPWS.1996.555547","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Discrete orthogonal transforms based on Fibonacci-type recursions
The idea of unified Fibonacci-type topology is used for construction of wide classes of discrete orthogonal transforms, including Rademacher-Fibonacci, Walsh-Fibonacci, Haar-Fibonacci-type transforms, etc. Efficient algorithms for proposed transforms directly related with the generalized Fibonacci topology are derived. The generation of discrete wavelets and wavelet packets based on Fibonacci-type recursions is established.