{"title":"一个高效的块牛顿型算法","authors":"K. Berberidis, S. Theodoridis","doi":"10.1109/ICASSP.1995.480435","DOIUrl":null,"url":null,"abstract":"The algorithm presented in the paper is an exact block processing counterpart of the fast Newton transversal filtering (FNTF) algorithm [Moustakides and Theodorides, 1991]. The main trait of the new algorithm is that the block processing is done in such a way so that the resulting estimates are mathematically equivalent with the respective estimates of the FNTF algorithm. In cases where the involved filter is of medium to long order the new algorithm offers a substantial saving in computational complexity without sacrificing performance.","PeriodicalId":300119,"journal":{"name":"1995 International Conference on Acoustics, Speech, and Signal Processing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An efficient block Newton-type algorithm\",\"authors\":\"K. Berberidis, S. Theodoridis\",\"doi\":\"10.1109/ICASSP.1995.480435\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The algorithm presented in the paper is an exact block processing counterpart of the fast Newton transversal filtering (FNTF) algorithm [Moustakides and Theodorides, 1991]. The main trait of the new algorithm is that the block processing is done in such a way so that the resulting estimates are mathematically equivalent with the respective estimates of the FNTF algorithm. In cases where the involved filter is of medium to long order the new algorithm offers a substantial saving in computational complexity without sacrificing performance.\",\"PeriodicalId\":300119,\"journal\":{\"name\":\"1995 International Conference on Acoustics, Speech, and Signal Processing\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-05-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1995 International Conference on Acoustics, Speech, and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP.1995.480435\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1995 International Conference on Acoustics, Speech, and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.1995.480435","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The algorithm presented in the paper is an exact block processing counterpart of the fast Newton transversal filtering (FNTF) algorithm [Moustakides and Theodorides, 1991]. The main trait of the new algorithm is that the block processing is done in such a way so that the resulting estimates are mathematically equivalent with the respective estimates of the FNTF algorithm. In cases where the involved filter is of medium to long order the new algorithm offers a substantial saving in computational complexity without sacrificing performance.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
