期刊检索

  • 2024年第56卷
  • 2023年第55卷
  • 2022年第54卷
  • 2021年第53卷
  • 2020年第52卷
  • 2019年第51卷
  • 2018年第50卷
  • 2017年第49卷
  • 2016年第48卷
  • 2015年第47卷
  • 2014年第46卷
  • 2013年第45卷
  • 2012年第44卷
  • 2011年第43卷
  • 2010年第42卷
  • 第1期
  • 第2期

主管单位 中华人民共和国
工业和信息化部
主办单位 哈尔滨工业大学 主编 李隆球 国际刊号ISSN 0367-6234 国内刊号CN 23-1235/T

期刊网站二维码
微信公众号二维码
引用本文:钟燕清,阎跃鹏,孟真,田易,刘谋,李继秀.二维非递归的低成本FIR滤波器设计方法[J].哈尔滨工业大学学报,2021,53(6):171.DOI:10.11918/201910089
ZHONG Yanqing,YAN Yuepeng,MENG Zhen,TIAN Yi,LIU Mou,LI Jixiu.Two-dimensional non-recursive design method of low-cost FIR filter[J].Journal of Harbin Institute of Technology,2021,53(6):171.DOI:10.11918/201910089
【打印本页】   【HTML】   【下载PDF全文】   查看/发表评论  下载PDF阅读器  关闭
过刊浏览    高级检索
本文已被:浏览 732次   下载 1152 本文二维码信息
码上扫一扫!
分享到: 微信 更多
二维非递归的低成本FIR滤波器设计方法
钟燕清1,2,阎跃鹏1,2,孟真1,田易1,2,刘谋1,李继秀1
(1.中国科学院 微电子研究所,北京 100029; 2.中国科学院大学,北京 100049)
摘要:
为降低有限冲激响应(Finite impulse response,FIR)数字滤波器的成本,提升可综合性,提出了一种基于系数矩阵的二维非递归优化算法,并进行了仿真. 首先,对现有的数字滤波器优化算法进行了调研,比较了各优化算法的优势和不足;然后,对现有的一维非递归算法进行优化,提取一维非递归算法优化后的冗余项,得到了二维非递归优化算法,并分析了算法的复杂度;最后,生成多组滤波器分别对本算法与一维非递归算法,以及本算法和现有递归算法进行仿真和对比. 仿真结果表明:提出的二维非递归FIR滤波器设计方法充分利用了系数矩阵的冗余信息,保留了现有算法的最小逻辑深度特性,同时可以进一步节省中间加法器个数;相比于现有的一维非递归算法,本算法可节省10.05%(12 bit量化)和7.21%(16 bit量化)的加法器个数;在低阶滤波器的设计中,加法器使用量降低到了传统CSD表示法的30%左右,从逻辑深度和加法器个数两方面都超越了已发表的递归和非递归滤波器设计方法.
关键词:  低成本FIR滤波器  非递归  冗余项  系数矩阵  逻辑深度  加法器个数
DOI:10.11918/201910089
分类号:TP510
文献标识码:A
基金项目:
Two-dimensional non-recursive design method of low-cost FIR filter
ZHONG Yanqing1,2,YAN Yuepeng1,2,MENG Zhen1,TIAN Yi1,2,LIU Mou1,LI Jixiu1
(1.Institute of Microelectronics, Chinese Academy of Sciences, Beijing 100029, China; 2.University of Chinese Academy of Sciences, Beijing 100049, China)
Abstract:
To reduce the overall hardware cost as well as improve the synthesizability of finite impulse response (FIR) filter, a two-dimensional non-recursive optimization algorithm based on coefficient matrix was proposed and simulated. Firstly, the existing digital filter optimization algorithms were investigated, and the advantages and shortcomings of these algorithms were compared and analyzed. Then, efforts were made to optimize the existing one-dimensional non-recursive algorithm. By extracting the redundant terms of one-dimensional non-recursive optimization algorithm, a novel two-dimensional non-recursive FIR optimization method with low computing complexity was obtained. Finally, multiple groups of filters were generated to simulate and compare the performance between the proposed algorithm and one-dimensional non-recursive algorithm as well as the existing recursive algorithms. Simulation results show that the two-dimensional non-recursive FIR filter design method proposed in this paper makes full use of the redundant information of the coefficient matrix, keeps the character of minimum logic depth, and meanwhile reduces logic adder number. Compared with the existing one-dimensional non-recursive algorithm, this algorithm saved logic adder by 10.05% (12 bit quantization) and 7.21% (16 bit quantization). In the design of low-order filter, the adder cost was reduced to 30% of the conventional CSD representation, which outperforms the existing recursive and non-recursive filter design methods in terms of logic depth and adder number.
Key words:  low-cost FIR filter  non-recursive  redundant terms  coefficient matrix  logic depth  logic adder number

友情链接LINKS