Polyphase filtering is an efficient implementation structure for decimation and interpolation that decomposes a prototype FIR filter into P parallel sub-filters, known as polyphase branches. By rearranging the filter coefficients and leveraging the noble identities of multirate signal processing, the filtering operation is performed at the lower output sample rate rather than the high input rate, dramatically reducing the required multiply-accumulate operations (MACs) per second.
Glossary
Polyphase Filtering

What is Polyphase Filtering?
A computational optimization technique for sample rate conversion that restructures a finite impulse response (FIR) filter into parallel sub-filters operating at a reduced clock rate.
In a decimator, the input samples are commutated across the polyphase branches, and the sub-filter outputs are summed to produce the downsampled result. For interpolation, the input samples are distributed to the branches, filtered, and then interleaved at the higher rate. This architecture is foundational in modern digital down converters (DDCs), software-defined radio channelizers, and any system requiring efficient sample rate conversion without wasting compute cycles on samples destined for discard.
Key Characteristics of Polyphase Filters
Polyphase decomposition is a fundamental signal processing technique that restructures finite impulse response (FIR) filters to perform decimation and interpolation with maximum computational efficiency.
Noble Identity Exploitation
The core principle enabling polyphase efficiency is the Noble Identity, which mathematically proves that filtering followed by downsampling is equivalent to downsampling followed by filtering with a decomposed filter. This identity allows the filter to operate at the lower output sample rate rather than the high input rate.
- Reduces multiply-accumulate operations by a factor equal to the decimation ratio
- Eliminates the computation of samples that would be immediately discarded
- Applies identically to interpolation through the transposed Noble Identity
Coefficient Decomposition Structure
A prototype FIR filter of length N is decomposed into M parallel sub-filters, where M is the resampling factor. Each sub-filter contains coefficients selected from the original filter at intervals of M, starting at a different phase offset.
- Sub-filter 0: coefficients h[0], h[M], h[2M], ...
- Sub-filter 1: coefficients h[1], h[M+1], h[2M+1], ...
- Each sub-filter operates at 1/M the original sample rate
- The structure is inherently parallel and suitable for hardware implementation
Decimator Architecture
In a polyphase decimator, the input signal is commutated across M sub-filters in a counter-clockwise rotation. The commutator delivers each input sample to the next sub-filter in sequence, and the outputs of all sub-filters are summed to produce the decimated output.
- Input commutator rotates at the high sample rate
- Each sub-filter processes only every M-th sample
- Output is produced at the decimated rate fs/M
- Eliminates the need for a separate downsampling stage
Interpolator Architecture
The polyphase interpolator reverses the decimator structure. The input signal is broadcast to all M sub-filters simultaneously, and an output commutator rotates to select the output of each sub-filter in sequence, inserting M-1 computed samples between each original input.
- Input is distributed to all sub-filters at the low sample rate
- Output commutator rotates at the high sample rate M*fs
- Each sub-filter computes a different fractional delay
- Zero-stuffing and subsequent filtering are combined into one efficient operation
Fractional Rate Conversion
Polyphase filters enable arbitrary rational resampling ratios L/M by cascading an interpolator (factor L) with a decimator (factor M). The intermediate filter operates at L times the input rate, but polyphase decomposition ensures only non-zero samples are processed.
- Supports ratios like 3/2, 5/4, or 147/160
- The interpolation and decimation filters can share a single prototype
- Critical for symbol timing recovery in software-defined radios
- Enables sample rate alignment between asynchronous digital domains
Computational Savings Quantified
For a decimation-by-M filter with N taps, a direct implementation requires N multiplications per input sample. The polyphase implementation requires only N/M multiplications per input sample, a reduction factor of M.
- Example: N=128, M=8 → 128 vs 16 multiplications per input sample
- 87.5% reduction in multiply-accumulate operations
- Power savings directly proportional for hardware implementations
- Enables real-time wideband processing on resource-constrained FPGAs and DSPs
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Frequently Asked Questions
Clear, technically precise answers to the most common questions about polyphase filter banks, their computational advantages, and their role in modern digital signal processing systems.
Polyphase filtering is a computationally efficient implementation of multirate digital signal processing that restructures a finite impulse response (FIR) filter into a set of parallel sub-filters operating at a lower sample rate. The core mechanism involves decomposing the original filter's impulse response into M polyphase components, where M is the decimation or interpolation factor. For a decimation-by-M system, the input signal is first commutated across these M sub-filters, and their outputs are summed to produce the filtered, downsampled result. This rearrangement exploits the noble identities of multirate signal processing, which allow the downsampling operation to be moved before the filtering stage. Consequently, the multiply-accumulate (MAC) operations are performed at the lower output rate rather than the high input rate, reducing the computational load by a factor of approximately M. The technique is foundational in software-defined radio (SDR) digital down converters (DDCs) and channelizers.
Related Terms
Explore the core signal processing concepts that underpin polyphase decomposition and its role in efficient multirate systems.
Digital Down Conversion (DDC)
The process of digitally translating a sampled bandpass signal to baseband using a numerically controlled oscillator (NCO) and decimating filters. Polyphase filtering is the standard computational engine within a DDC, allowing the final channel filter to operate at the lower output sample rate rather than the high input rate. This architecture is fundamental to modern software-defined radio receivers, enabling channel selection with minimal hardware complexity.
Decimation and Interpolation
The two fundamental operations of multirate signal processing. Decimation reduces the sampling rate by a factor of M, requiring a low-pass filter to prevent aliasing. Interpolation increases the sampling rate by a factor of L, requiring a filter to suppress spectral images. Polyphase decomposition restructures these filters so that computations are only performed on non-zero samples or for retained output samples, drastically reducing multiply-accumulate operations per second.
Noble Identities
A set of mathematical equivalences that allow the order of filtering and downsampling/upsampling operations to be swapped under specific conditions. The First Noble Identity states that filtering a signal and then downsampling by M is equivalent to downsampling first and then filtering with the M-fold polyphase decomposition. These identities are the theoretical proof that validates the computational savings achieved by polyphase filter structures.
CIC Filters
Cascaded Integrator-Comb (CIC) filters are an efficient class of multiplierless filters often used as a first-stage decimator or interpolator in high-speed digital links. While computationally simple, they suffer from passband droop. A polyphase FIR filter is typically cascaded after a CIC stage to compensate for this droop and provide sharp transition bands, combining the efficiency of CIC structures with the precision of polyphase FIR designs.
Filter Banks and Subband Coding
A filter bank splits a wideband signal into multiple subbands using parallel bandpass filters, a process efficiently implemented using polyphase decomposition and the Discrete Fourier Transform (DFT). This is the foundation of OFDM transceivers and audio compression algorithms. The polyphase DFT filter bank allows for uniform channelization where the computational load is shared across all channels, making it vastly more efficient than implementing independent filters for each subband.
Matched Filtering
An optimal linear filter that maximizes the signal-to-noise ratio (SNR) by correlating the received signal with a known pulse shape. In high-sample-rate receivers, the matched filter is often implemented as a polyphase decimating filter to simultaneously perform pulse shaping and sample rate reduction. This combined operation is critical in timing recovery loops where the signal must be filtered and downsampled to the symbol rate with precise phase alignment.

About the author
Prasad Kumkar
CEO & MD, Inference Systems
Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.
His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us