Design of high-speed, low-power, and area-efficient FIR filters

In a recent work, we have introduced a new multiple constant multiplication (MCM) algorithm, denoted as RADIX-2r. The latter exhibits the best results in speed and power, comparatively with the most prominent algorithms. In this paper, the area aspect of RADIX-2r is more specially investigated. RADI...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IET circuits, devices & systems Jg. 12; H. 1; S. 1 - 11
Hauptverfasser:	Liacha, Ahmed, Oudjida, Abdelkrim K, Ferguene, Farid, Bakiri, Mohammed, Berrandjia, Mohamed L
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Stevenage The Institution of Engineering and Technology 01.01.2018 John Wiley & Sons, Inc
Schlagworte:	adders Adding circuits Algorithms CMOS logic circuits Competition complementary metal oxide semiconductor technology Complexity Cost control Critical path digital arithmetic FIR filter design FIR filters Heuristic lowest adder cost MCM algorithm multiple constant multiplication algorithm Multiplication RADIX-2r Research Article Technology assessment lowest adder cost FIR filters FIR filter design adders CMOS logic circuits digital arithmetic RADIX-2r multiple constant multiplication algorithm MCM algorithm complementary metal oxide semiconductor technology
ISSN:	1751-858X, 1751-8598, 1751-8598
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	In a recent work, we have introduced a new multiple constant multiplication (MCM) algorithm, denoted as RADIX-2r. The latter exhibits the best results in speed and power, comparatively with the most prominent algorithms. In this paper, the area aspect of RADIX-2r is more specially investigated. RADIX-2r is confronted to area efficient algorithms, notably to the cumulative benefit heuristic (Hcub) known for its lowest adder-cost. A number of benchmark FIR filters of growing complexity served for comparison. The results showed that RADIX-2r is better than Hcub in area, especially for high order filters where the saving ranges from 1.50% up to 3.46%. This advantage is analytically proved and experimentally confirmed using a 65nm CMOS technology. Area efficiency is achieved along with important savings in speed and power, ranging from 6.37% up to 38.01% and from 9.30% up to 25.85%, respectively. When MCM blocks are implemented alone, the savings are higher: 10.18%, 47.24%, and 41.27% in area, speed, and power, respectively. Most importantly, we prove that MCM heuristics using similar addition pattern (A-operation with the same shift spans) as Hcub yield excessive bit-adder overhead in MCM problems of high complexity. As such, they are not competitive to RADIX-2r in high order filters.
AbstractList	In a recent work, we have introduced a new multiple constant multiplication (MCM) algorithm, denoted as RADIX‐2 r . The latter exhibits the best results in speed and power, comparatively with the most prominent algorithms. In this paper, the area aspect of RADIX‐2 r is more specially investigated. RADIX‐2 r is confronted to area efficient algorithms, notably to the cumulative benefit heuristic (Hcub) known for its lowest adder‐cost. A number of benchmark FIR filters of growing complexity served for comparison. The results showed that RADIX‐2 r is better than Hcub in area, especially for high order filters where the saving ranges from 1.50% up to 3.46%. This advantage is analytically proved and experimentally confirmed using a 65nm CMOS technology. Area efficiency is achieved along with important savings in speed and power, ranging from 6.37% up to 38.01% and from 9.30% up to 25.85%, respectively. When MCM blocks are implemented alone, the savings are higher: 10.18%, 47.24%, and 41.27% in area, speed, and power, respectively. Most importantly, we prove that MCM heuristics using similar addition pattern (A‐operation with the same shift spans) as Hcub yield excessive bit‐adder overhead in MCM problems of high complexity. As such, they are not competitive to RADIX‐2 r in high order filters. In a recent work, we have introduced a new multiple constant multiplication (MCM) algorithm, denoted as RADIX‐2r. The latter exhibits the best results in speed and power, comparatively with the most prominent algorithms. In this paper, the area aspect of RADIX‐2r is more specially investigated. RADIX‐2r is confronted to area efficient algorithms, notably to the cumulative benefit heuristic (Hcub) known for its lowest adder‐cost. A number of benchmark FIR filters of growing complexity served for comparison. The results showed that RADIX‐2r is better than Hcub in area, especially for high order filters where the saving ranges from 1.50% up to 3.46%. This advantage is analytically proved and experimentally confirmed using a 65nm CMOS technology. Area efficiency is achieved along with important savings in speed and power, ranging from 6.37% up to 38.01% and from 9.30% up to 25.85%, respectively. When MCM blocks are implemented alone, the savings are higher: 10.18%, 47.24%, and 41.27% in area, speed, and power, respectively. Most importantly, we prove that MCM heuristics using similar addition pattern (A‐operation with the same shift spans) as Hcub yield excessive bit‐adder overhead in MCM problems of high complexity. As such, they are not competitive to RADIX‐2r in high order filters.
Author	Liacha, Ahmed Oudjida, Abdelkrim K Ferguene, Farid Bakiri, Mohammed Berrandjia, Mohamed L
Author_xml	– sequence: 1 givenname: Ahmed surname: Liacha fullname: Liacha, Ahmed organization: 2Université des Sciences et de la Technologie Houari Boumediene, USTHB, LRPE Laboratory, Algiers, Algeria – sequence: 2 givenname: Abdelkrim K surname: Oudjida fullname: Oudjida, Abdelkrim K email: a_oudjida@hotmail.com organization: 1Centre de Développement des Technologies Avancées, CDTA, System Architecture and Multimedia Division, Algiers, Algeria – sequence: 3 givenname: Farid surname: Ferguene fullname: Ferguene, Farid organization: 2Université des Sciences et de la Technologie Houari Boumediene, USTHB, LRPE Laboratory, Algiers, Algeria – sequence: 4 givenname: Mohammed surname: Bakiri fullname: Bakiri, Mohammed organization: 1Centre de Développement des Technologies Avancées, CDTA, System Architecture and Multimedia Division, Algiers, Algeria – sequence: 5 givenname: Mohamed L surname: Berrandjia fullname: Berrandjia, Mohamed L organization: 1Centre de Développement des Technologies Avancées, CDTA, System Architecture and Multimedia Division, Algiers, Algeria
BookMark	eNqFkF1LwzAUhoNMcE5_gHcFb5eZj7ZpvBHdnA4Ggh_gXeia0y2jNjPpGPv3plR2Iag3SSDvc17Oc4p6ta0BoQtKRpTE8spAgwvtR4xQMSIkyY5Qn4qE4iyRWe_wzt5P0Kn365BIEp720c0EvFnWkS2jlVmusN8A6GFU2R3e2B24YZTXOsod5BjK0hQG6iaazp6j0lQNOH-Gjsu88nD-fQ_Q2_T-dfyI508Ps_HtHBc8ZTHWBKhm8UKnmpWxFKnkUgoaZ4RxxkWScwAeDq71ggMDAZKmWfgiJAZCFnyALru5G2c_t-AbtbZbV4dKxYlkTCQZFSFFu1ThrPcOSrVx5iN3e0WJaj2p4EkFT6r1pFpPgRE_mMI0eWNs3bjcVH-S1x25MxXs_69S48kLu5sSwlkcYNzBbeywy-9lX0Qyj2Y
CitedBy_id	crossref_primary_10_1038_s41598_024_61713_z crossref_primary_10_1007_s00034_020_01436_4 crossref_primary_10_1016_j_vlsi_2025_102519 crossref_primary_10_1038_s41598_024_73514_5 crossref_primary_10_1049_cds2_12043 crossref_primary_10_1080_00207217_2022_2098387 crossref_primary_10_1080_00207217_2023_2245194 crossref_primary_10_1049_iet_cds_2020_0213 crossref_primary_10_1109_TCSI_2018_2838666
Cites_doi	10.1109/TSP.2014.2366713 10.1109/TCSI.2014.2377412 10.1109/NEWCAS.2017.8010156 10.1109/TCAD.2007.907064 10.1109/TCSII.2015.2469051 10.1109/TCSII.2002.1013866 10.1109/ISCAS.2009.5118230 10.1109/31.31347 10.1109/TCSII.2014.2312799 10.1109/NORCHP.2008.4738280 10.1109/ECCTD.2005.1523161 10.1109/ISCAS.2012.6272072 10.1109/ISCAS.2007.378201 10.1109/TCAD.2011.2153853 10.1109/TCSI.2014.2327287 10.1109/82.466647 10.1109/TCSI.2015.2476319 10.1109/ARITH.2001.930126 10.1109/TCSI.2015.2512742 10.1109/ISCAS.2011.5937844 10.1109/DAC.2007.375200 10.1109/TCSII.2005.851776 10.1109/TCSII.2011.2168130 10.1109/TCSII.2014.2387620 10.1109/ISCAS.2010.5537658 10.1109/TCAD.2008.923242 10.1145/1240233.1240234 10.1109/TCAD.2010.2043585 10.1016/j.micpro.2009.10.001 10.1109/TEC.1961.5219227 10.1109/TCSII.2007.903212 10.1109/ICCD.2010.5647750
ContentType	Journal Article
Copyright	The Institution of Engineering and Technology 2018 The Institution of Engineering and Technology Copyright The Institution of Engineering & Technology 2018
Copyright_xml	– notice: The Institution of Engineering and Technology – notice: 2018 The Institution of Engineering and Technology – notice: Copyright The Institution of Engineering & Technology 2018
DBID	AAYXX CITATION JQ2
DOI	10.1049/iet-cds.2017.0058
DatabaseName	CrossRef ProQuest Computer Science Collection
DatabaseTitle	CrossRef ProQuest Computer Science Collection
DatabaseTitleList	CrossRef ProQuest Computer Science Collection
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1751-8598
EndPage	11
ExternalDocumentID	10_1049_iet_cds_2017_0058 CDS2BF00324
Genre	article
GrantInformation_xml	– fundername: Centre de Développement des Technologies Avancées
GroupedDBID	0R 24P 29I 4.4 4IJ 6IK 8FE 8FG AAJGR ABJCF ACGFS ACIWK ADCOW AFKRA ALMA_UNASSIGNED_HOLDINGS ARAPS BENPR BFFAM BGLVJ EBS EJD GOZPB GRPMH HCIFZ HZ IFIPE IPLJI JAVBF K6V K7- L6V LAI LOTEE LXI M43 M7S NADUK NXXTH O9- OCL P62 PTHSS RIE RNS RUI S0W U5U UNMZH UNR ZZ .DC 0R~ 0ZK 1OC 96U AAHHS AAHJG ABQXS ACCFJ ACCMX ACESK ACXQS ADEYR ADZOD AEEZP AEGXH AEQDE AFAZI AIWBW AJBDE ALUQN AVUZU CCPQU F8P GROUPED_DOAJ HZ~ IAO ITC MCNEO OK1 ROL ~ZZ AAYXX AFFHD CITATION IDLOA PHGZM PHGZT PQGLB WIN JQ2
ID	FETCH-LOGICAL-c3624-d0e1d24bd6d2f4976939971480232375a3ee3a3e3ddb3e2e7e9168323004e00b3
IEDL.DBID	24P
ISICitedReferencesCount	12
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000419402700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1751-858X 1751-8598
IngestDate	Wed Aug 13 11:31:40 EDT 2025 Wed Oct 29 21:46:24 EDT 2025 Tue Nov 18 22:39:15 EST 2025 Wed Jan 22 16:59:16 EST 2025 Tue Jan 05 21:45:57 EST 2021
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	lowest adder cost FIR filters FIR filter design adders CMOS logic circuits digital arithmetic RADIX-2r multiple constant multiplication algorithm MCM algorithm complementary metal oxide semiconductor technology
Language	English
License	http://onlinelibrary.wiley.com/termsAndConditions#vor
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c3624-d0e1d24bd6d2f4976939971480232375a3ee3a3e3ddb3e2e7e9168323004e00b3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	3092275817
PQPubID	1936358
PageCount	11
ParticipantIDs	proquest_journals_3092275817 wiley_primary_10_1049_iet_cds_2017_0058_CDS2BF00324 crossref_primary_10_1049_iet_cds_2017_0058 iet_journals_10_1049_iet_cds_2017_0058 crossref_citationtrail_10_1049_iet_cds_2017_0058
ProviderPackageCode	RUI
PublicationCentury	2000
PublicationDate	20180100 January 2018 2018-01-00 20180101
PublicationDateYYYYMMDD	2018-01-01
PublicationDate_xml	– month: 1 year: 2018 text: 20180100
PublicationDecade	2010
PublicationPlace	Stevenage
PublicationPlace_xml	– name: Stevenage
PublicationTitle	IET circuits, devices & systems
PublicationYear	2018
Publisher	The Institution of Engineering and Technology John Wiley & Sons, Inc
Publisher_xml	– name: The Institution of Engineering and Technology – name: John Wiley & Sons, Inc
References	Oudjida, A.K.; Liacha, A.; Bakiri, M. (C3) 2016; 63 Lou, X.; Yu, Y.J.; Meher, P.K. (C34) 2014; 62 Voronenko, Y.; Püschel, M. (C8) 2007; 3 Xu, F.; Chang, C.H.; Jong, C.C. (C5) 2005; 52 Lou, X.; Yu, Y.J.; Meher, P.K. (C27) 2015; 62 Dempster, A.G.; Macleod, M.D. (C7) 1995; 42 Oudjida, A.K.; Chaillet, N. (C13) 2014; 61 Avizienis, A. (C20) 1961; EC-10 Aksoy, L.; Flores, P.; Monteiro, J. (C21) 2015; 63 Feng, F.; Chen, J.; Chang, C.H. (C33) 2016 Huang, R.; Chang, C.H.; Faust, M. (C28) 2011; 58 Thong, J.; Nicolici, N. (C1) 2011; 30 Martinez-Peiro, M.; Boemo, E.I.; Wanhammar, L. (C6) 2002; 49 Aksoy, L.; da Costa, E.; Flores, P. (C2) 2008; 27 Gustafsson, O. (C10) 2007; 54 Aksoy, L.; Günes, E.O.; Flores, P. (C18) 2010; 34 Ye, W.B.; Yu, Y.J. (C31) 2014; 61 Mahesh, R.; Vinod, A.P. (C4) 2008; 27 Oudjida, A.K.; Chaillet, N.; Berrandjia, M.L. (C14) 2015; 62 Chang, C.H.; Faust, M. (C9) 2010; 29 Samueli, H. (C23) 1989; 36 2010; 34 2012 2011 2010 2009 2011; 30 2008 2007 2011; 58 2007; 54 2014; 62 2014; 61 1961; EC‐10 2002; 49 1995; 42 2001 2010; 29 2015; 62 2015; 63 2008; 27 2005; 52 2016; 63 2017 2016 2005; 3 2007; 3 1989; 36 e_1_2_8_27_2 e_1_2_8_28_2 e_1_2_8_29_2 e_1_2_8_23_2 e_1_2_8_24_2 Fraust M. (e_1_2_8_17_2) 2010 e_1_2_8_25_2 e_1_2_8_26_2 e_1_2_8_9_2 e_1_2_8_2_2 e_1_2_8_4_2 e_1_2_8_3_2 e_1_2_8_6_2 e_1_2_8_5_2 e_1_2_8_8_2 e_1_2_8_7_2 e_1_2_8_20_2 e_1_2_8_21_2 e_1_2_8_22_2 e_1_2_8_16_2 e_1_2_8_18_2 e_1_2_8_19_2 e_1_2_8_12_2 e_1_2_8_35_2 e_1_2_8_13_2 e_1_2_8_34_2 e_1_2_8_14_2 e_1_2_8_37_2 e_1_2_8_15_2 e_1_2_8_36_2 e_1_2_8_31_2 e_1_2_8_30_2 e_1_2_8_10_2 e_1_2_8_33_2 e_1_2_8_11_2 e_1_2_8_32_2
References_xml	– volume: 27 start-page: 1013 issue: 6 year: 2008 end-page: 1026 ident: C2 article-title: Exact and approximate algorithms for the optimisation of area and delay in multiple constant multiplication publication-title: IEEE Trans. Comput. -Aided Des. Integr. Circuits Syst. – volume: 61 start-page: 349 issue: 5 year: 2014 end-page: 353 ident: C13 article-title: Radix-2 arithmetic for multiplication by a constant publication-title: IEEE Trans. Circuits Syst. II Exp. Brief – volume: 36 start-page: 1044 issue: 7 year: 1989 end-page: 1047 ident: C23 article-title: An improved search algorithm for the design of multiplierless FIR filters with powers-of-two coefficients publication-title: IEEE Trans. Circuits Syst. – volume: 63 start-page: 176 issue: 2 year: 2016 end-page: 180 ident: C3 article-title: Multiple constant multiplication algorithm for high speed and low power design publication-title: IEEE Trans. Circuits Syst. II Exp. Brief. – volume: 62 start-page: 372 issue: 4 year: 2015 end-page: 376 ident: C14 article-title: Radix-2 arithmetic for multiplication by a constant: further results and improvements publication-title: IEEE Trans. Circuits Syst. II Exp. Brief – volume: 54 start-page: 974 issue: 11 year: 2007 end-page: 978 ident: C10 article-title: Lower bounds for constant multiplication problems publication-title: IEEE Trans. Circuits Syst. II Exp. Brief – volume: 3 start-page: 1 issue: 2 year: 2007 end-page: 38 ident: C8 article-title: Multiplierless multiple constant multiplication publication-title: ACM Trans. Algorithms – volume: 29 start-page: 844 issue: 5 year: 2010 end-page: 848 ident: C9 article-title: On “a new common subexpression elimination algorithm for realizing low-complexity higher order digital filters” publication-title: IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. – volume: 30 start-page: 1373 issue: 9 year: 2011 end-page: 1386 ident: C1 article-title: An optimal and practical approach to single constant multiplication publication-title: IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. – volume: 27 start-page: 217 issue: 2 year: 2008 end-page: 229 ident: C4 article-title: A new common subexpression elimination algorithm for realizing low-complexity higher order digital filters publication-title: IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. – volume: EC-10 start-page: 389 issue: 3 year: 1961 end-page: 400 ident: C20 article-title: Signed-digit number representation for fast parallel arithmetic publication-title: IRE Trans. Electron. Comput. – volume: 52 start-page: 695 issue: 10 year: 2005 end-page: 700 ident: C5 article-title: Contention resolution algorithm for common subexpression elimination in digital filter design publication-title: IEEE Trans. Circuits Syst. II Exp. Brief – volume: 34 start-page: 151 issue: 5 year: 2010 end-page: 162 ident: C18 article-title: Search algorithms for the multiple constant multiplications problem: exact and approximate publication-title: Microprocess. Microsyst. – year: 2016 ident: C33 article-title: Hypergraph based minimum arborescence algorithm for the optimization and reoptimization of multiple constant multiplications publication-title: IEEE Trans. Circuits Syst. I – volume: 58 start-page: 916 issue: 12 year: 2011 end-page: 920 ident: C28 article-title: Sign-extension avoidance and word-length optimization by positive-offset representation for FIR filter design publication-title: IEEE Trans. Circuits Syst. II Exp. Brief – volume: 62 start-page: 2695 issue: 11 year: 2015 end-page: 2705 ident: C27 article-title: New approach to the reduction of sign-extension overhead for efficient implementation of multiple constant multiplications publication-title: IEEE Trans. Circuits Syst. I: Reg. Papers – volume: 61 start-page: 3206 issue: 11 year: 2014 end-page: 3215 ident: C31 article-title: Bit-level multiplierless FIR filter optimization incorporating sparce filter technique publication-title: IEEE Trans. Circuits Syst. I Reg. Papers – volume: 42 start-page: 569 issue: 9 year: 1995 end-page: 577 ident: C7 article-title: Use of minimum-adder multiplier blocks in FIR digital filters publication-title: IEEE Trans. Circuits Syst. II Analog Digit. Signal Process. – volume: 62 start-page: 863 issue: 3 year: 2014 end-page: 872 ident: C34 article-title: Fine-grained critical path analysis and optimization for area-time efficient realization of multiple constant multiplications publication-title: IEEE Trans. Circuits Syst. I Reg. Papers – volume: 49 start-page: 196 issue: 3 year: 2002 end-page: 203 ident: C6 article-title: Design of high-speed multiplierless filters using a nonrecursive signed common subexpression algorithm publication-title: IEEE Trans. Circuits Syst. II Analog Digit. Signal Process. – volume: 63 start-page: 142 issue: 1 year: 2015 end-page: 154 ident: C21 article-title: Exact and approximate algorithms for the filter design optimization problem publication-title: IEEE Trans. Signal Process. – volume: 63 start-page: 142 issue: 1 year: 2015 end-page: 154 article-title: Exact and approximate algorithms for the filter design optimization problem publication-title: IEEE Trans. Signal Process. – volume: 62 start-page: 863 issue: 3 year: 2014 end-page: 872 article-title: Fine‐grained critical path analysis and optimization for area‐time efficient realization of multiple constant multiplications publication-title: IEEE Trans. Circuits Syst. I Reg. Papers – volume: 30 start-page: 1373 issue: 9 year: 2011 end-page: 1386 article-title: An optimal and practical approach to single constant multiplication publication-title: IEEE Trans. Comput.‐Aided Des. Integr. Circuits Syst. – start-page: 1439 year: 2011 end-page: 1442 – volume: 54 start-page: 974 issue: 11 year: 2007 end-page: 978 article-title: Lower bounds for constant multiplication problems publication-title: IEEE Trans. Circuits Syst. II Exp. Brief – start-page: 420 year: 2007 end-page: 423 – year: 2016 article-title: Hypergraph based minimum arborescence algorithm for the optimization and reoptimization of multiple constant multiplications – start-page: 2185 year: 2009 end-page: 2188 – start-page: 1097 year: 2007 end-page: 1100 – start-page: 457 year: 2010 end-page: 460 – volume: 62 start-page: 2695 issue: 11 year: 2015 end-page: 2705 article-title: New approach to the reduction of sign‐extension overhead for efficient implementation of multiple constant multiplications publication-title: IEEE Trans. Circuits Syst. I: Reg. Papers – start-page: 247 year: 2001 end-page: 254 – volume: 61 start-page: 3206 issue: 11 year: 2014 end-page: 3215 article-title: Bit‐level multiplierless FIR filter optimization incorporating sparce filter technique publication-title: IEEE Trans. Circuits Syst. I Reg. Papers – volume: 3 start-page: 465 year: 2005 end-page: 468 – start-page: 1293 year: 2010 end-page: 1301 – volume: 58 start-page: 916 issue: 12 year: 2011 end-page: 920 article-title: Sign‐extension avoidance and word‐length optimization by positive‐offset representation for FIR filter design publication-title: IEEE Trans. Circuits Syst. II Exp. Brief – start-page: 41 year: 2008 end-page: 44 – volume: EC‐10 start-page: 389 issue: 3 year: 1961 end-page: 400 article-title: Signed‐digit number representation for fast parallel arithmetic publication-title: IRE Trans. Electron. Comput. – volume: 61 start-page: 349 issue: 5 year: 2014 end-page: 353 article-title: Radix‐2 arithmetic for multiplication by a constant publication-title: IEEE Trans. Circuits Syst. II Exp. Brief – volume: 27 start-page: 217 issue: 2 year: 2008 end-page: 229 article-title: A new common subexpression elimination algorithm for realizing low‐complexity higher order digital filters publication-title: IEEE Trans. Comput.‐Aided Des. Integr. Circuits Syst. – volume: 3 start-page: 1 issue: 2 year: 2007 end-page: 38 article-title: Multiplierless multiple constant multiplication publication-title: ACM Trans. Algorithms – volume: 49 start-page: 196 issue: 3 year: 2002 end-page: 203 article-title: Design of high‐speed multiplierless filters using a nonrecursive signed common subexpression algorithm publication-title: IEEE Trans. Circuits Syst. II Analog Digit. Signal Process. – volume: 62 start-page: 372 issue: 4 year: 2015 end-page: 376 article-title: Radix‐2 arithmetic for multiplication by a constant: further results and improvements publication-title: IEEE Trans. Circuits Syst. II Exp. Brief – start-page: 1 year: 2017 end-page: 4 – volume: 27 start-page: 1013 issue: 6 year: 2008 end-page: 1026 article-title: Exact and approximate algorithms for the optimisation of area and delay in multiple constant multiplication publication-title: IEEE Trans. Comput. ‐Aided Des. Integr. Circuits Syst. – volume: 29 start-page: 844 issue: 5 year: 2010 end-page: 848 article-title: On “a new common subexpression elimination algorithm for realizing low‐complexity higher order digital filters” publication-title: IEEE Trans. Comput.‐Aided Des. Integr. Circuits Syst. – start-page: 49 year: 2012 end-page: 52 – volume: 42 start-page: 569 issue: 9 year: 1995 end-page: 577 article-title: Use of minimum‐adder multiplier blocks in FIR digital filters publication-title: IEEE Trans. Circuits Syst. II Analog Digit. Signal Process. – volume: 52 start-page: 695 issue: 10 year: 2005 end-page: 700 article-title: Contention resolution algorithm for common subexpression elimination in digital filter design publication-title: IEEE Trans. Circuits Syst. II Exp. Brief – volume: 34 start-page: 151 issue: 5 year: 2010 end-page: 162 article-title: Search algorithms for the multiple constant multiplications problem: exact and approximate publication-title: Microprocess. Microsyst. – volume: 63 start-page: 176 issue: 2 year: 2016 end-page: 180 article-title: Multiple constant multiplication algorithm for high speed and low power design publication-title: IEEE Trans. Circuits Syst. II Exp. Brief. – volume: 36 start-page: 1044 issue: 7 year: 1989 end-page: 1047 article-title: An improved search algorithm for the design of multiplierless FIR filters with powers‐of‐two coefficients publication-title: IEEE Trans. Circuits Syst. – start-page: 266 year: 2010 end-page: 273 – ident: e_1_2_8_22_2 doi: 10.1109/TSP.2014.2366713 – ident: e_1_2_8_35_2 doi: 10.1109/TCSI.2014.2377412 – ident: e_1_2_8_37_2 doi: 10.1109/NEWCAS.2017.8010156 – ident: e_1_2_8_5_2 doi: 10.1109/TCAD.2007.907064 – ident: e_1_2_8_4_2 doi: 10.1109/TCSII.2015.2469051 – ident: e_1_2_8_7_2 doi: 10.1109/TCSII.2002.1013866 – ident: e_1_2_8_16_2 – ident: e_1_2_8_33_2 doi: 10.1109/ISCAS.2009.5118230 – ident: e_1_2_8_24_2 doi: 10.1109/31.31347 – ident: e_1_2_8_14_2 doi: 10.1109/TCSII.2014.2312799 – ident: e_1_2_8_23_2 doi: 10.1109/NORCHP.2008.4738280 – ident: e_1_2_8_27_2 doi: 10.1109/ECCTD.2005.1523161 – ident: e_1_2_8_31_2 doi: 10.1109/ISCAS.2012.6272072 – ident: e_1_2_8_12_2 doi: 10.1109/ISCAS.2007.378201 – ident: e_1_2_8_2_2 doi: 10.1109/TCAD.2011.2153853 – ident: e_1_2_8_32_2 doi: 10.1109/TCSI.2014.2327287 – ident: e_1_2_8_8_2 doi: 10.1109/82.466647 – ident: e_1_2_8_28_2 doi: 10.1109/TCSI.2015.2476319 – ident: e_1_2_8_25_2 doi: 10.1109/ARITH.2001.930126 – ident: e_1_2_8_34_2 doi: 10.1109/TCSI.2015.2512742 – ident: e_1_2_8_18_2 doi: 10.1109/ISCAS.2011.5937844 – ident: e_1_2_8_26_2 doi: 10.1109/DAC.2007.375200 – ident: e_1_2_8_6_2 doi: 10.1109/TCSII.2005.851776 – ident: e_1_2_8_20_2 – ident: e_1_2_8_29_2 doi: 10.1109/TCSII.2011.2168130 – ident: e_1_2_8_15_2 doi: 10.1109/TCSII.2014.2387620 – ident: e_1_2_8_36_2 – ident: e_1_2_8_30_2 doi: 10.1109/ISCAS.2010.5537658 – ident: e_1_2_8_3_2 doi: 10.1109/TCAD.2008.923242 – ident: e_1_2_8_9_2 doi: 10.1145/1240233.1240234 – start-page: 1293 volume-title: Proc. IEEE ASILOMAR Conf. Signals, Systems, and Computers year: 2010 ident: e_1_2_8_17_2 – ident: e_1_2_8_10_2 doi: 10.1109/TCAD.2010.2043585 – ident: e_1_2_8_19_2 doi: 10.1016/j.micpro.2009.10.001 – ident: e_1_2_8_21_2 doi: 10.1109/TEC.1961.5219227 – ident: e_1_2_8_11_2 doi: 10.1109/TCSII.2007.903212 – ident: e_1_2_8_13_2 doi: 10.1109/ICCD.2010.5647750
SSID	ssj0055536
Score	2.214888
Snippet	In a recent work, we have introduced a new multiple constant multiplication (MCM) algorithm, denoted as RADIX-2r. The latter exhibits the best results in speed... In a recent work, we have introduced a new multiple constant multiplication (MCM) algorithm, denoted as RADIX‐2r. The latter exhibits the best results in speed... In a recent work, we have introduced a new multiple constant multiplication (MCM) algorithm, denoted as RADIX‐2 r . The latter exhibits the best results in...
SourceID	proquest crossref wiley iet
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1
SubjectTerms	adders Adding circuits Algorithms CMOS logic circuits Competition complementary metal oxide semiconductor technology Complexity Cost control Critical path digital arithmetic FIR filter design FIR filters Heuristic lowest adder cost MCM algorithm multiple constant multiplication algorithm Multiplication RADIX-2r Research Article Technology assessment
Title	Design of high-speed, low-power, and area-efficient FIR filters
URI	http://digital-library.theiet.org/content/journals/10.1049/iet-cds.2017.0058 https://onlinelibrary.wiley.com/doi/abs/10.1049%2Fiet-cds.2017.0058 https://www.proquest.com/docview/3092275817
Volume	12
WOSCitedRecordID	wos000419402700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVWIB databaseName: Wiley Online Library Free Content customDbUrl: eissn: 1751-8598 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0055536 issn: 1751-858X databaseCode: WIN dateStart: 20130101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell – providerCode: PRVWIB databaseName: Wiley Online Library Open Access customDbUrl: eissn: 1751-8598 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0055536 issn: 1751-858X databaseCode: 24P dateStart: 20130101 isFulltext: true titleUrlDefault: https://authorservices.wiley.com/open-science/open-access/browse-journals.html providerName: Wiley-Blackwell
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NSgMxEB5q9aAH_8VqlRzEgxjcTbLu5qi1RUGK-H9bNpsECqUtturVR_AZfRIn2bZahAriJbDZSXaZJDNfMrvfAOzlJhQI2izNcpNRoSynyoacJhLBttWZYT7X4f1l3Gwmj4_yqgS10b8wBT_E-MDNrQxvr90Cz1SRhQRBLQ5iywxorh3jduhYCKNkBmbDkMduajNxNTLHURT5PIHoJkOaRDIZhzbl0Y8uJpzTDN6ewJ3f0at3P42lf3nxZVgcok9yUkyXFSiZziosfOMkXIP6mf-mg3QtcVTGH2_v_R56uEPS7r7iRc9lVTskWUeTDPEm1hhPQoG-izQuroltufB7fx3uGvXb2jkd5lqgObowQXVgQs2E0seaWSFdhkQpY9wroU9nPI4ybgzHgmutuGEmNogr0Ro4wi4TBIpvQLnT7ZhNIDbLA-147qzCDhMrjxMbxSqXQmqFkhUIRkpO8yERucuH0U59QFzIFDWUooZSp6HUaagCB-MmvYKFY5rwvqsbrsX-NMHqaHC_pHkgGcNNVBhXgPth_P2Jae3shp020EAysfWnVtswj_VJcbZThfLg6dnswFz-Mmj1n3b9hMby4aL5CXrd-YU
linkProvider	Wiley-Blackwell
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Ba9swFH60XaHboVvXjWXtNh3GDqWitiTX1nFNYhKWhdBmozdjWxIEShKatLv2J_Q37pfsPTlOUwYpjF0Mtp9k8yS970myvw_gc2lDhUmb43lpc64KJ3nhQskTjcm2M7kVXuvwZy_u95PLSz3YgFb9L0zFD7FccKOR4eM1DXBakK4mnIpIMkd2zktDlNsh0RBGySY8U4g2pGMg1KCOx1EUeaFAxMmQJ5FOlnub-uSvKh6h0ybefpR4rqavHn_Sl__nzV_B7iL_ZF-rDrMHG3b8Gl6ssBLuQ7vlv-pgE8eIzPj33f1sihh3zK4mv_BkSrpqxywfG5ZjxolXrKehQPRiafecuRFtwM_ewI-0PWx2-EJtgZcIYoqbwIZGqMKcGuGUJo1ErWOcLSGqCxlHubRW4kEaU0grbGwxs8R4QJRdNggK-Ra2xpOxfQfM5WVgiOnOFVhh4vRp4qK4KLXSpkDLBgS1l7NyQUVOihhXmd8SVzpDD2XooYw8lJGHGnC0LDKteDjWGX-ha4vROFtneFi37oO1DLQQOI0K4wZI345PPzFrti7EWYohUqj3_1TqE-x0ht97Wa_b_3YAz9EmqVZ6DmFrfn1jP8B2eTsfza4_-t79B2Qm_Fg
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1bS8MwFD7MC6IP3sXp1DyID2KwTVLbPKpbURxjeMO30jYJDGQbbuqrP8Hf6C_xJN3mhqAgvhTanqTlJDnfl6T9DsB-rn2BpM3QNNcpFZnhNDM-p5FEsm1UqpnLdXhfDxuN6OFBNktQHf4LU-hDjBbc7Mhw8doOcN1VpphwCiuS2dJ9misrue1bGcIgmoIZEWCstfrOojmMx0EQuESBiJM-jQIZjfY25fG3KibQaQpvTxDPcfrq8Cde-p83X4bFAf8kp0WHWYGSbq_Cwpgq4RrUqu6rDtIxxIoZf7y997qIcUfksfOKJ12bV-2IpG1FUmSceEU7GQpELxJfXhPTshvwvXW4i2u35xd0kG2B5ghigipP-4qJTJ0oZoS0ORKlDHG2hKjOeBikXGuOB65UxjXToUZmifHASnZpz8v4Bky3O229CcSkuaes0p3JsMLIyJPIBGGWSyFVhpZl8IZeTvKBFLnNiPGYuC1xIRP0UIIeSqyHEuuhMhyOinQLHY6fjA_stcFo7P1kWBm27pc19yRjOI3ywzJw146_PzE5r96wsxhDJBNbfyq1B3PNapzULxtX2zCPJlGx0FOB6f7Ts96B2fyl3-o97brO_QkOnvvc
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Design+of+high%E2%80%90speed%2C+low%E2%80%90power%2C+and+area%E2%80%90efficient+FIR+filters&rft.jtitle=IET+circuits%2C+devices+%26+systems&rft.au=Liacha%2C+Ahmed&rft.au=Oudjida%2C+Abdelkrim+K.&rft.au=Ferguene%2C+Farid&rft.au=Bakiri%2C+Mohammed&rft.date=2018-01-01&rft.pub=The+Institution+of+Engineering+and+Technology&rft.issn=1751-8598&rft.eissn=1751-8598&rft.volume=12&rft.issue=1&rft.spage=1&rft.epage=11&rft_id=info:doi/10.1049%2Fiet-cds.2017.0058&rft.externalDBID=10.1049%252Fiet-cds.2017.0058&rft.externalDocID=CDS2BF00324
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1751-858X&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1751-858X&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1751-858X&client=summon