2018 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS) 2018
DOI: 10.1109/apccas.2018.8605574
|View full text |Cite
|
Sign up to set email alerts
|

Hardware-Efficient Parallel FIR Filter Structure Based on Modified Cook-Toom Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
12
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(14 citation statements)
references
References 5 publications
0
12
0
Order By: Relevance
“…From Tables 2 and 3, it is clear that the proposed structure always requires less number of delay elements false(Dfalse) $(\mathcal{D})$ and adders false(Afalse) $(\mathcal{A})$ for different combinations of N and M . For instance, when M = 3, N = 578 proposed structure requires scriptD=579 $\mathcal{D}=579$ and scriptM=867 $\mathcal{M}=867$ while existing structures [8–14] need more number of scriptM $\mathcal{M}$, scriptA $\mathcal{A}$, and scriptD $\mathcal{D}$. Comprehensively, for M = 2 and M = 3, the proposed structure has better performance than refs.…”
Section: Performance Analysis Of Proposed Structurementioning
confidence: 97%
See 4 more Smart Citations
“…From Tables 2 and 3, it is clear that the proposed structure always requires less number of delay elements false(Dfalse) $(\mathcal{D})$ and adders false(Afalse) $(\mathcal{A})$ for different combinations of N and M . For instance, when M = 3, N = 578 proposed structure requires scriptD=579 $\mathcal{D}=579$ and scriptM=867 $\mathcal{M}=867$ while existing structures [8–14] need more number of scriptM $\mathcal{M}$, scriptA $\mathcal{A}$, and scriptD $\mathcal{D}$. Comprehensively, for M = 2 and M = 3, the proposed structure has better performance than refs.…”
Section: Performance Analysis Of Proposed Structurementioning
confidence: 97%
“…[2, 3] as well as recent work reported in refs. [8–14] in terms of number of multipliers false(i.e.Mfalse) $(i.e.\mathcal{M})$, adders false(i.e.Afalse) $(i.e.\mathcal{A})$ and delay elements false(i.e.Dfalse) $(i.e.\mathcal{D})$, the required number of scriptD $\mathcal{D}$ and scriptA $\mathcal{A}$ are almost same as traditional structures. The count of multipliers, adders and delay‐elements involved in the proposed structure can be calculated using following equations.…”
Section: Performance Analysis Of Proposed Structurementioning
confidence: 97%
See 3 more Smart Citations