On the public citation graph
Design of nonuniformly spaced linear-phase FIR filters using mixed integer linear programming
0 signed · 33 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1109/31.1701openalex-snapshot
Design of computationally efficient interpolated FIR filters
inferredcites →https://doi.org/10.1109/78.215298openalex-snapshot
On the use of cyclotomic polynomial prefilters for efficient FIR filter design
inferredcites →https://doi.org/10.1109/icassp.1990.115627openalex-snapshot
Design of efficient parallel hybrid FIR filters using dynamic programming and subset selection methods
inferredcites →https://doi.org/10.1109/tassp.1983.1164085openalex-snapshot
FIR filter design over a discrete powers-of-two coefficient space
inferredcites →https://doi.org/10.1109/tassp.1984.1164326openalex-snapshot
A new structure for narrow transition band, lowpass digital filter design
inferredcites →https://doi.org/10.1109/tassp.1984.1164348openalex-snapshot
Interpolated finite impulse response filters
inferredcites →https://doi.org/10.1109/tassp.1985.1164722openalex-snapshot
Results on nonrecursive digital filters with nonequidistant taps
inferredcites →https://doi.org/10.1109/tcs.1980.1084712openalex-snapshot
Transversal filters with nonuniform tap spacings
inferredcites →https://doi.org/10.1109/tcs.1984.1085492openalex-snapshot
Some efficient digital prefilter structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00034-015-0122-5openalex-snapshot
Greedy Algorithm for the Design of Linear-Phase FIR Filters with Sparse Coefficients
inferred← citeshttps://doi.org/10.1007/s00034-018-0758-zopenalex-snapshot
Design of Sparse Filters by a Discrete Filled Function Technique
inferred← citeshttps://doi.org/10.1080/10556780903254104openalex-snapshot
A new hybrid descent method with application to the optimal design of finite precision FIR filters
inferred← citeshttps://doi.org/10.1109/cac59555.2023.10451229openalex-snapshot
The Binary Beetle Antennae Search Algorithm for Sparse Filter Design
inferred← citeshttps://doi.org/10.1109/ccece.2017.7946804openalex-snapshot
Minimax design of orthogonal filter banks with sparse coefficients
inferred← citeshttps://doi.org/10.1109/eusipco.2016.7760234openalex-snapshot
Peak-error-constrained sparse FIR filter design using iterative L1 optimization
inferred← citeshttps://doi.org/10.1109/icassp.1998.681830openalex-snapshot
Fast optimal and suboptimal algorithms for sparse solutions to linear inverse problems
inferred← citeshttps://doi.org/10.1109/icassp.2002.5744907openalex-snapshot
Efficient sparse FIR filter design
inferred← citeshttps://doi.org/10.1109/icassp.2010.5495892openalex-snapshot
Sparsity maximization under a quadratic constraint with applications in filter design
inferred← citeshttps://doi.org/10.1109/icdsp.2015.7251998openalex-snapshot
Design of sparse FIR filters based on reweighted l1 -norm minimization
inferred← citeshttps://doi.org/10.1109/iscas.2013.6572490openalex-snapshot
New algorithm for minimax design of sparse IIR filters
inferred← citeshttps://doi.org/10.1109/iscas.2017.8050776openalex-snapshot
Sparse FIR filter design via partial L1 optimization
inferred← citeshttps://doi.org/10.1109/mwscas.1997.662356openalex-snapshot
Design of sparse FIR filters based on branch-and-bound algorithm
inferred← citeshttps://doi.org/10.1109/ssp.2009.5278626openalex-snapshot
Non-convex optimization for the design of sparse fir filters
inferred← citeshttps://doi.org/10.1109/tcsi.2014.2327287openalex-snapshot
Bit-Level Multiplierless FIR Filter Optimization Incorporating Sparse Filter Technique
inferred← citeshttps://doi.org/10.1109/tcsi.2014.2354771openalex-snapshot
Design of Sparse FIR Filters With Joint Optimization of Sparsity and Filter Order
inferred← citeshttps://doi.org/10.1109/tsp.2009.2036471openalex-snapshot
Linear Programming Algorithms for Sparse Filter Design
inferred← citeshttps://doi.org/10.1109/tsp.2012.2199316openalex-snapshot
Peak-Error-Constrained Sparse FIR Filter Design Using Iterative SOCP
inferred← citeshttps://doi.org/10.1109/tsp.2012.2226450openalex-snapshot
A Branch-and-Bound Algorithm for Quadratically-Constrained Sparse Filter Design
inferred← citeshttps://doi.org/10.1109/tsp.2012.2229996openalex-snapshot
Sparse Filter Design Under a Quadratic Constraint: Low-Complexity Algorithms
inferred← citeshttps://doi.org/10.1109/wcsp.2016.7752662openalex-snapshot
An alternative minimax design of sparse IIR filters based on L1-norm
inferred← citeshttps://doi.org/10.1145/3277453.3277470openalex-snapshot
Efficient Design of Sparse Multiplierless FIR Filters with Low Complexity
inferred← citeshttps://doi.org/10.15517/ring.v12i1-2.6436openalex-snapshot
DISEÑO DE FILTROS DIGITALES FIR DE FASE LINEAL USANDO MUESTRAS ESPACIADAS DE ACUERDO CON LAS POSICIONES DE LOS CEROS DE POLINOMIOS ORTOGONALES EN EL DOMINIO DE LA FRECUENCIA.
inferred← citeshttps://doi.org/10.5755/j01.eie.26.1.23560openalex-snapshot
Sparse FIR Filter Design Based on Signomial Programming
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.