On the public citation graph

Multiplication and Accumulation Co-Optimization for Low Complexity FIR Filter Implementation

https://doi.org/10.3390/electronics11111721
0 signed · 36 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s00034-013-9727-8openalex-snapshot
A Tutorial on Multiplierless Design of FIR Filters: Algorithms and Architectures
inferredcites →https://doi.org/10.1016/j.apacoust.2020.107669openalex-snapshot
Design of digital IIR filter: A research survey
inferredcites →https://doi.org/10.1016/j.dsp.2017.09.006openalex-snapshot
Some new results of designing an IIR filter with colored noise for signal processing
inferredcites →https://doi.org/10.1016/j.micpro.2011.08.009openalex-snapshot
Finding the optimal tradeoff between area and delay in multiple constant multiplications
inferredcites →https://doi.org/10.1049/ip-g-2.1991.0066openalex-snapshot
Primitive operator digital filters
inferredcites →https://doi.org/10.1109/43.739059openalex-snapshot
A new algorithm for elimination of common subexpressions
inferredcites →https://doi.org/10.1109/82.466647openalex-snapshot
Use of minimum-adder multiplier blocks in FIR digital filters
inferredcites →https://doi.org/10.1109/82.539000openalex-snapshot
Subexpression sharing in filters using canonic signed digit multipliers
inferredcites →https://doi.org/10.1109/acssc.2004.1399091openalex-snapshot
Low-complexity hybrid form FIR filters using matrix multiple constant multiplication
inferredcites →https://doi.org/10.1109/ecctd.2011.6043643openalex-snapshot
Low error bit width reduction for structural adders of FIR filters
inferredcites →https://doi.org/10.1109/iccsp48568.2020.9182328openalex-snapshot
Design of Multiplierless IFIR based Cosine Modulated Filter Bank using QPSO
inferredcites →https://doi.org/10.1109/icecs.2007.4511091openalex-snapshot
Bit-Level Optimization of Shift-and-Add Based FIR Filters
inferredcites →https://doi.org/10.1109/icedss.2018.8544270openalex-snapshot
Review of Multiplierless Fir Filter Design Based On Graph Based Optimization
inferredcites →https://doi.org/10.1109/icsc45622.2019.8938282openalex-snapshot
Performance of Multiplierless FIR Filter based on CSD and Binary: A Comparative Study
inferredcites →https://doi.org/10.1109/iscas.2017.8050935openalex-snapshot
Design of IIR frequency-response masking filters with near linear phase using constrained optimization
inferredcites →https://doi.org/10.1109/iscas.2018.8351062openalex-snapshot
Equiripple-Stopband Multiplierless FIR Filters by Chebyshev Sharpening of Two-Sample Averaging
inferredcites →https://doi.org/10.1109/iscas45731.2020.9180522openalex-snapshot
Matrix Decomposition Based Low-Complexity FIR Filter: Further Results
inferredcites →https://doi.org/10.1109/mwscas.2018.8624036openalex-snapshot
Sparse FIR Filter Design Using Artificial Bee Colony Algorithm
inferredcites →https://doi.org/10.1109/tcad.2016.2584181openalex-snapshot
Lower Bound Analysis and Perturbation of Critical Path for Area-Time Efficient Multiple Constant Multiplications
inferredcites →https://doi.org/10.1109/tcsi.2004.836853openalex-snapshot
A Novel Common-Subexpression-Elimination Method for Synthesizing Fixed-Point FIR Filters
inferredcites →https://doi.org/10.1109/tcsi.2007.904599openalex-snapshot
Design of Linear Phase FIR Filters in Subexpression Space Using Mixed Integer Linear Programming
inferredcites →https://doi.org/10.1109/tcsi.2008.920090openalex-snapshot
Information Theoretic Approach to Complexity Reduction of FIR Filter Design
inferredcites →https://doi.org/10.1109/tcsi.2009.2016165openalex-snapshot
Design of Extrapolated Impulse Response FIR Filters With Residual Compensation in Subexpression Space
inferredcites →https://doi.org/10.1109/tcsi.2010.2055290openalex-snapshot
Design of Linear Phase FIR Filters With High Probability of Achieving Minimum Number of Adders
inferredcites →https://doi.org/10.1109/tcsi.2013.2256211openalex-snapshot
Single-Stage and Cascade Design of High Order Multiplierless Linear Phase FIR Filters Using Genetic Algorithm
inferredcites →https://doi.org/10.1109/tcsi.2013.2268551openalex-snapshot
Designing Hardware-Efficient Fixed-Point FIR Filters in an Expanding Subexpression Space
inferredcites →https://doi.org/10.1109/tcsi.2014.2327287openalex-snapshot
Bit-Level Multiplierless FIR Filter Optimization Incorporating Sparse Filter Technique
inferredcites →https://doi.org/10.1109/tcsi.2014.2377412openalex-snapshot
Fine-Grained Critical Path Analysis and Optimization for Area-Time Efficient Realization of Multiple Constant Multiplications
inferredcites →https://doi.org/10.1109/tcsi.2016.2587105openalex-snapshot
Analysis and Optimization of Product-Accumulation Section for Efficient Implementation of FIR Filters
inferredcites →https://doi.org/10.1109/tcsi.2020.2964568openalex-snapshot
Cascaded Form Sparse FIR Filter Design
inferredcites →https://doi.org/10.1109/tcsii.2002.1013866openalex-snapshot
Design of high-speed multiplierless filters using a nonrecursive signed common subexpression algorithm
inferredcites →https://doi.org/10.1109/tcsii.2016.2614727openalex-snapshot
Novel Structure for Area-Efficient Implementation of FIR Filters
inferredcites →https://doi.org/10.1109/tetc.2020.2997067openalex-snapshot
Design Space Exploration Based Methodology for Residue Number System Digital Filters Implementation
inferredcites →https://doi.org/10.1145/1240233.1240234openalex-snapshot
Multiplierless multiple constant multiplication

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4671147openalex-extracted
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2024.109533openalex-snapshot
IoT-driven optimization of a NxN enhanced pipeline multiplier
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.