Parks–McClellan filter design algorithm
The Parks–McClellan algorithm, published by James McClellan and Thomas Parks in 1972, is an iterative algorithm for finding the optimal Chebyshev finite impulse response (FIR) filter. The Parks–McClellan algorithm is utilized to design and implement efficient and optimal FIR filters. It uses an indirect method for finding the optimal filter coefficients.
known for
known for
primaryTopic
Parks–McClellan filter design algorithm
The Parks–McClellan algorithm, published by James McClellan and Thomas Parks in 1972, is an iterative algorithm for finding the optimal Chebyshev finite impulse response (FIR) filter. The Parks–McClellan algorithm is utilized to design and implement efficient and optimal FIR filters. It uses an indirect method for finding the optimal filter coefficients.
has abstract
The Parks–McClellan algorithm, ...... method for FIR filter design.
@en
帕克斯-麥克萊倫演算法（英語：Parks–McClellan ...... 有人以Remez-exchange algorithm代稱。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
979,915,004
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
The Parks–McClellan algorithm, ...... e optimal filter coefficients.
@en
帕克斯-麥克萊倫演算法（英語：Parks–McClellan ...... 有人以Remez-exchange algorithm代稱。
@zh
label
Parks–McClellan filter design algorithm
@en
帕克斯-麥克萊倫演算法
@zh