{"title":"无极限环的数字滤波器结构","authors":"E. Auer","doi":"10.1109/ICASSP.1987.1169831","DOIUrl":null,"url":null,"abstract":"In this paper recursive, second-order, digital filter-structures are given, that are free of zero input limit cycles. This holds for the two cases of sign-magnitude- and two's complement-truncation applied immediately after each multiplication. These structures provide for very inexpensive, but limit cycle free implementations of recursive, digital filters. The results, given for the case of zero input, are in a second part extended to the case of constant input by a simple, so called bypass-structure for the over-all transfer function.","PeriodicalId":140810,"journal":{"name":"ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Digital filter structures free of limit cycles\",\"authors\":\"E. Auer\",\"doi\":\"10.1109/ICASSP.1987.1169831\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper recursive, second-order, digital filter-structures are given, that are free of zero input limit cycles. This holds for the two cases of sign-magnitude- and two's complement-truncation applied immediately after each multiplication. These structures provide for very inexpensive, but limit cycle free implementations of recursive, digital filters. The results, given for the case of zero input, are in a second part extended to the case of constant input by a simple, so called bypass-structure for the over-all transfer function.\",\"PeriodicalId\":140810,\"journal\":{\"name\":\"ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP.1987.1169831\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.1987.1169831","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper recursive, second-order, digital filter-structures are given, that are free of zero input limit cycles. This holds for the two cases of sign-magnitude- and two's complement-truncation applied immediately after each multiplication. These structures provide for very inexpensive, but limit cycle free implementations of recursive, digital filters. The results, given for the case of zero input, are in a second part extended to the case of constant input by a simple, so called bypass-structure for the over-all transfer function.