A First Experimental Study of Fixed-Point Approximate Arithmetic in Recursive Lattice Filters
Peter M. Koch, Yannick Le Moullec
Aalborg University Tallinn University of Technology
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
In some situations, the numerical properties of Direct Form I (DF-I) and Direct Form II (DF-II) Infinite Impulse Response (IIR) filter structures may degrade, e.g., when the filter approaches its stability limit. Other filter structures may be numerically more robust under such conditions. For example, an Nthorder Lattice filter composed of N structurally identical cascaded feed-forward sections can be extended and made recursive, i.e., Lattice IIR filter, thereby implementing zeros as well as poles. Such filters, however, have a significantly higher computational complexity compared to their DF-I and DF-II counterparts, increasing the execution time and the energy consumed per sample period. Approximate Computing (AxC) applied in Lattice IIR filters has not been researched in the scientific literature to date, and therefore we suggest substituting the exact fixed-point multiplications and additions with AxC arithmetic building blocks to potentially reduce the resource overhead. In this first study, we analyze the numerical consequences of using such arithmetic units in the 2ndorder recursive Lattice structure and compare its performance against the ordinary DF-II structure. Our findings clearly indicate that under certain conditions AxC arithmetic is a useful approach in recursive Lattice filters.
逐年被引趋势
暂无年度引用数据
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIDigital Filter Design and Implementation
Low-power high-performance VLSI design · Analog and Mixed-Signal Circuit Design