Finite Impulse Response (FIR) digital filters are widely used in signal processing to remove noise and extract frequency-domain features. Genetic Algorithms (GAs) have been employed to synthesize FIR filters by optimizing the coefficients in their transfer function. A notable approach is to evolve FIR filter coefficients in the Canonical Signed Digit (CSD) representation, which simplifies hardware implementation by replacing multipliers with shifts and additions. However, its crossover and mutation operators frequently produce offspring that violate CSD constraints, requiring repeated retries or coefficient resets. We propose modified crossover and mutation operators that guarantee CSD-compliant offspring by construction. We compare our method against the original CSD-based GA and a real-valued GA baseline across five low-pass filter design problems, varying filter order and coefficient word length. Results show that our method consistently outperforms the original CSD-based approach.
Automated Digital Filter Synthesis with Canonical Signed Digit via Genetic Algorithms / Deiana, S., Manzoni, L., Lorenzo, A.D., Rovito, L.. - In: CYBERNETICS AND INFORMATION TECHNOLOGIES. - ISSN 1314-4081. - 26:3(2026), pp. 229-246. [10.2478/cait-2026-0034]
Automated Digital Filter Synthesis with Canonical Signed Digit via Genetic Algorithms
Deiana, SimonePrimo
;Manzoni, LucaSecondo
;Lorenzo, Andrea DePenultimo
;Rovito, LuigiUltimo
2026-01-01
Abstract
Finite Impulse Response (FIR) digital filters are widely used in signal processing to remove noise and extract frequency-domain features. Genetic Algorithms (GAs) have been employed to synthesize FIR filters by optimizing the coefficients in their transfer function. A notable approach is to evolve FIR filter coefficients in the Canonical Signed Digit (CSD) representation, which simplifies hardware implementation by replacing multipliers with shifts and additions. However, its crossover and mutation operators frequently produce offspring that violate CSD constraints, requiring repeated retries or coefficient resets. We propose modified crossover and mutation operators that guarantee CSD-compliant offspring by construction. We compare our method against the original CSD-based GA and a real-valued GA baseline across five low-pass filter design problems, varying filter order and coefficient word length. Results show that our method consistently outperforms the original CSD-based approach.| File | Dimensione | Formato | |
|---|---|---|---|
|
Automated_Digital_Filter_Synthesis_with_Canonical_Signed_Digit_via_Genetic_Algorithms.pdf
accesso aperto
Tipologia:
Documento in Versione Editoriale
Licenza:
Creative commons
Dimensione
966.35 kB
Formato
Adobe PDF
|
966.35 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


