{"title":"用于音频信号分析的有界q快速滤波器组","authors":"F. Diniz, I. Kothe, L. Biscainho, S. L. Netto","doi":"10.1109/ITS.2006.4433420","DOIUrl":null,"url":null,"abstract":"This paper describes a new spectral analysis tool, the bounded-Q fast filter bank (BQFFB), which consists of a high selectivity filter bank with a piecewise linear spacing between its channels. This approximately geometric representation yields relatively low computational cost and a suitable frequency resolution, thus making the BQFFB an efficient tool for musical analysis applications. A description of the BQFFB algorithm is presented along with a complete evaluation of its corresponding computational complexity. Computer simulations are then included to illustrate the BQFFB performance against other methods from the literature, such as the fast Fourier transform, the standard fast filter bank, and the constant-Q transform.","PeriodicalId":271294,"journal":{"name":"2006 International Telecommunications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A bounded-Q fast filter bank for audio signal analysis\",\"authors\":\"F. Diniz, I. Kothe, L. Biscainho, S. L. Netto\",\"doi\":\"10.1109/ITS.2006.4433420\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a new spectral analysis tool, the bounded-Q fast filter bank (BQFFB), which consists of a high selectivity filter bank with a piecewise linear spacing between its channels. This approximately geometric representation yields relatively low computational cost and a suitable frequency resolution, thus making the BQFFB an efficient tool for musical analysis applications. A description of the BQFFB algorithm is presented along with a complete evaluation of its corresponding computational complexity. Computer simulations are then included to illustrate the BQFFB performance against other methods from the literature, such as the fast Fourier transform, the standard fast filter bank, and the constant-Q transform.\",\"PeriodicalId\":271294,\"journal\":{\"name\":\"2006 International Telecommunications Symposium\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Telecommunications Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITS.2006.4433420\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Telecommunications Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITS.2006.4433420","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A bounded-Q fast filter bank for audio signal analysis
This paper describes a new spectral analysis tool, the bounded-Q fast filter bank (BQFFB), which consists of a high selectivity filter bank with a piecewise linear spacing between its channels. This approximately geometric representation yields relatively low computational cost and a suitable frequency resolution, thus making the BQFFB an efficient tool for musical analysis applications. A description of the BQFFB algorithm is presented along with a complete evaluation of its corresponding computational complexity. Computer simulations are then included to illustrate the BQFFB performance against other methods from the literature, such as the fast Fourier transform, the standard fast filter bank, and the constant-Q transform.