Construct · 1 fields · 1 citations

Parks-McClellan algorithm: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Signal processing

design of linear-phase FIR filters that minimize the maximum weighted error, giving equiripple bands via Remez exchange.

In signal processing, Parks-McClellan algorithm refers to design of linear-phase FIR filters that minimize the maximum weighted error, giving equiripple bands via Remez exchange. This meaning comes from Parks (1972) in IEEE Transactions on Circuit Theory.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Parks-McClellan algorithm sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

circuit1 fields · 1 citationsanchor · a standalone construct error4 fields · 8 citationsjingle · one word, four constructs exchange4 fields · 7 citationsjingle · one word, four constructs

References

Parks, T., & McClellan, J. (1972). Chebyshev Approximation for Nonrecursive Digital Filters with Linear Phase. IEEE Transactions on Circuit Theory, 19(2), 189-194. https://doi.org/10.1109/tct.1972.1083419

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct