Skip to content

Nonrecursive (FIR) Filter

A causal discrete-time linear filter realized as a finite weighted sum of current and delayed input samples, with no previous-output feedback, so its finite tap vector completely determines both impulse and frequency response.

Version
v1 · 2026-08-30 · History
Domain-specific #
2390
Origin domain
digital signal processing
Subdomain
finite impulse response filtering
Aliases
Non-recursive digital filter

Core Idea

A nonrecursive filter in the retained digital-signal-processing sense computes each output sample as a finite weighted sum of current and delayed input samples, without using any previous output as an input to the next calculation:

\[ y[n]=\sum_{k=0}^{M} b_k x[n-k]. \]

The coefficient vector \((b_0,\ldots,b_M)\), often called the taps, is both the filter's impulse response and the fixed convolution kernel. An impulse at the input produces exactly those \(M+1\) values and then zero, hence finite impulse response (FIR). ARM's production CMSIS-DSP implementation exposes the structure directly as a multiply–accumulate sequence over a coefficient array and delayed input-state buffer.

Scope of Application

Nonrecursive FIR filters are used for low-pass, high-pass, band-pass, and band-stop filtering; smoothing and differentiation; Hilbert transformation; equalization; matched filtering; pulse shaping; decimation and interpolation; and spatial image kernels. SciPy and MATLAB expose window, least-squares, and equiripple design tools, while embedded libraries implement the same tap-and-delay structure across floating-point and fixed-point types.

The abstraction spans offline and streaming operation. A short audio equalizer may run a direct multiply–accumulate loop. A very long impulse response can be evaluated by FFT overlap-add/overlap-save while retaining the same FIR input–output system.

Clarity

Three quick tests identify the abstraction.

Difference-equation test: after expansion, does \(y[n]\) depend only on finitely many \(x[n-k]\) terms? Impulse test: does a unit impulse yield a response that becomes exactly zero after finitely many samples? realization test: does the implemented signal path avoid using previous computed outputs? A direct-form candidate passes all three.

Manages Complexity

The filter reduces an entire stream transformation to one inspectable vector. The tap support fixes memory and arithmetic cost; coefficient sum gives DC gain; alternating sum gives Nyquist gain; symmetry reveals phase behavior; the Fourier transform of the taps reveals magnitude response; and the \(\ell_1\) norm supplies a simple output bound.

Abstract Reasoning

Several deductions follow directly.

BIBO stability. If \(|x[n]|\le B\), then

\[ |y[n]|\le B\sum_{k=0}^{M}|b_k|, \]

which is finite for a finite tap vector. Stability requires no pole-location calculation.

Finite forgetting. An input perturbation at index \(n_0\) can affect only outputs \(n_0\) through \(n_0+M\). The system forgets exactly after its support length, making warm-up and flush intervals calculable.

Knowledge Transfer

The identity transfers literally wherever samples and fixed finite convolutions occur. In audio, taps implement equalizers and crossover filters. In communications, they shape pulses, match known waveforms, and compensate channel distortion. In images, a finite 2-D kernel blurs, sharpens, or detects edges; MathWorks identifies finite spatial support as 2-D FIR and notes the same stability and linear-phase benefits.

Relationships to Other Abstractions

Local relationship map for Nonrecursive (FIR) FilterParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Nonrecursive(FIR) FilterDOMAINPrime abstraction: Convolution — is a kind ofConvolutionPRIME

Current abstraction Nonrecursive (FIR) Filter Domain-specific

Parents (1) — more general patterns this builds on

  • Nonrecursive (FIR) Filter is a kind of Convolution Prime

    The minimal prospective DAG parent is prime:convolution through strict subsumption.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Nonrecursive (FIR) Filter sits in a sparse region of the domain-specific corpus (87th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08