Fast exhaustive search algorithm for checking limit cycles in fixed-point digital filters

被引：0
|
作者：
Univ of Sidi-Bel-Abbes, Sidi-Bel-Abbes, Algeria [1 ]
机构：
来源：
Signal Process | / 2卷 / 199-205期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
17
引用
收藏
相关论文
共 50 条
  • [41] CONTRIBUTIONS TO THE STUDY OF THE QUANTIZATION EFFECTS IN FIXED-POINT DIGITAL-FILTERS
    LEPSCHY, A
    MIAN, GA
    VIARO, U
    ALTA FREQUENZA, 1989, 58 (01): : 3 - 14
  • [42] An N/4 fixed-point duality quantum search algorithm
    HAO Liang1
    2School of Sciences
    3Tsinghua National Laboratory for Information Science and Technology
    Science China(Physics,Mechanics & Astronomy), 2010, (09) : 1765 - 1768
  • [43] An N/4 fixed-point duality quantum search algorithm
    Hao Liang
    Liu Dan
    Long GuiLu
    SCIENCE CHINA-PHYSICS MECHANICS & ASTRONOMY, 2010, 53 (09) : 1765 - 1768
  • [44] Fast principal component analysis using fixed-point algorithm
    Sharma, Alok
    Pahwal, Kuldip K.
    PATTERN RECOGNITION LETTERS, 2007, 28 (10) : 1151 - 1155
  • [45] A fast projected fixed-point algorithm for large graph matching
    Lu, Yao
    Huang, Kaizhu
    Liu, Cheng-Lin
    PATTERN RECOGNITION, 2016, 60 : 971 - 982
  • [46] Fast fixed-point neural blind-deconvolution algorithm
    Fiori, S
    IEEE TRANSACTIONS ON NEURAL NETWORKS, 2004, 15 (02): : 455 - 459
  • [47] Fixed-Point Methods in Parametric Model Checking
    Knapik, Michal
    Penczek, Wojciech
    INTELLIGENT SYSTEMS'2014, VOL 1: MATHEMATICAL FOUNDATIONS, THEORY, ANALYSES, 2015, 322 : 231 - 242
  • [48] Fixed-point digital controller
    Chételat, O
    PROCEEDINGS OF THE 2004 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 2004, : 2864 - 2869
  • [49] ZERO-INPUT LIMIT-CYCLES AND STABILITY IN 2ND-ORDER FIXED-POINT DIGITAL-FILTERS WITH 2 MAGNITUDE TRUNCATION QUANTIZERS
    LEPSCHY, A
    MIAN, GA
    VIARO, U
    CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 1989, 8 (04) : 427 - 433
  • [50] CONVERGENCE OF A FIXED-POINT ALGORITHM
    BOHNING, D
    COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 1983, 12 (22) : 2645 - 2653
12345