PREDICTIVE FIR FILTERS WITH LOW COMPUTATIONAL-COMPLEXITY
被引:30
|
作者:
CAMPBELL, TG
论文数: 0引用数: 0
h-index: 0
机构:
TAMPERE UNIV,SIGNAL PROC LAB,SF-33101 TAMPERE,FINLANDTAMPERE UNIV,SIGNAL PROC LAB,SF-33101 TAMPERE,FINLAND
CAMPBELL, TG
[1
]
NEUVO, Y
论文数: 0引用数: 0
h-index: 0
机构:
TAMPERE UNIV,SIGNAL PROC LAB,SF-33101 TAMPERE,FINLANDTAMPERE UNIV,SIGNAL PROC LAB,SF-33101 TAMPERE,FINLAND
NEUVO, Y
[1
]
机构:
[1] TAMPERE UNIV,SIGNAL PROC LAB,SF-33101 TAMPERE,FINLAND
来源:
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS
|
1991年
/
38卷
/
09期
关键词:
D O I:
10.1109/31.83876
中图分类号:
TM [电工技术];
TN [电子技术、通信技术];
学科分类号:
0808 ;
0809 ;
摘要:
New families of FIR digital filters with low computational complexity are presented. The filters are extensions of the recursive running sum. Each family of filters predicts points along a characteristic polynomial. Closed-form equations are given in both time- and frequency-domain for filters corresponding to first- and second-order polynomial models. Block diagrams for efficient implementation structures are given. The first-order predictive filters require three multipliers and five adders, and the second-order predictive filters five multipliers and twelve adders, irrespective of the filter length. The filters exhibit low-pass characteristics with the passband shape controllable by a single parameter. The frequency and phase responses are discussed. A design example is given showing how the filters can be used as building blocks to obtain effective linear-phase low-pass filters.