{"title":"使用最坏情况峰值增益测量确定数字滤波器实现的定点格式","authors":"Anastasia Volkova, Thibault Hilaire, C. Lauter","doi":"10.1109/ACSSC.2015.7421231","DOIUrl":null,"url":null,"abstract":"In this article, we focus on the Fixed-Point implementation of Linear Time Invariant (LTI) filters in state- space representation. For that purpose, we give an algorithm to determine the Fixed-Point Formats of all the involved variables (states and outputs). For the sake of generality, the algorithm works in the case of Multiple Inputs Multiple Outputs filters. The computational errors in the intermediate steps of the filter evaluation as well as their accumulation over time are fully taken into account. We handle several rounding modes (round to nearest and truncation) for two's-complement-based Fixed-Point Arithmetic. Our approach is fully rigorous in the way that the output Fixed-Point formats are shown to be free of overflows and we do not use any (non-exhaustive) filter simulation steps but proofs.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Determining fixed-point formats for a digital filter implementation using the worst-case peak gain measure\",\"authors\":\"Anastasia Volkova, Thibault Hilaire, C. Lauter\",\"doi\":\"10.1109/ACSSC.2015.7421231\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, we focus on the Fixed-Point implementation of Linear Time Invariant (LTI) filters in state- space representation. For that purpose, we give an algorithm to determine the Fixed-Point Formats of all the involved variables (states and outputs). For the sake of generality, the algorithm works in the case of Multiple Inputs Multiple Outputs filters. The computational errors in the intermediate steps of the filter evaluation as well as their accumulation over time are fully taken into account. We handle several rounding modes (round to nearest and truncation) for two's-complement-based Fixed-Point Arithmetic. Our approach is fully rigorous in the way that the output Fixed-Point formats are shown to be free of overflows and we do not use any (non-exhaustive) filter simulation steps but proofs.\",\"PeriodicalId\":172015,\"journal\":{\"name\":\"2015 49th Asilomar Conference on Signals, Systems and Computers\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 49th Asilomar Conference on Signals, Systems and Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2015.7421231\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 49th Asilomar Conference on Signals, Systems and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2015.7421231","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Determining fixed-point formats for a digital filter implementation using the worst-case peak gain measure
In this article, we focus on the Fixed-Point implementation of Linear Time Invariant (LTI) filters in state- space representation. For that purpose, we give an algorithm to determine the Fixed-Point Formats of all the involved variables (states and outputs). For the sake of generality, the algorithm works in the case of Multiple Inputs Multiple Outputs filters. The computational errors in the intermediate steps of the filter evaluation as well as their accumulation over time are fully taken into account. We handle several rounding modes (round to nearest and truncation) for two's-complement-based Fixed-Point Arithmetic. Our approach is fully rigorous in the way that the output Fixed-Point formats are shown to be free of overflows and we do not use any (non-exhaustive) filter simulation steps but proofs.