{"id":"https://openalex.org/W2982446276","doi":"https://doi.org/10.1109/lsp.2019.2950111","title":"Linear Convolution Filter to Reduce Computational Complexity Based on Discrete Hirschman Transform","display_name":"Linear Convolution Filter to Reduce Computational Complexity Based on Discrete Hirschman Transform","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2982446276","doi":"https://doi.org/10.1109/lsp.2019.2950111","mag":"2982446276"},"language":"en","primary_location":{"id":"doi:10.1109/lsp.2019.2950111","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2019.2950111","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035887746","display_name":"Dingli Xue","orcid":"https://orcid.org/0000-0003-1633-7233"},"institutions":[{"id":"https://openalex.org/I103163165","display_name":"Florida State University","ror":"https://ror.org/05g3dte14","country_code":"US","type":"education","lineage":["https://openalex.org/I103163165"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dingli Xue","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Florida State University, Tallahassee, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Florida State University, Tallahassee, USA","institution_ids":["https://openalex.org/I103163165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035887746"],"corresponding_institution_ids":["https://openalex.org/I103163165"],"apc_list":null,"apc_paid":null,"fwci":0.7567,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.69814257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10688","display_name":"Image and Signal Denoising Methods","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11034","display_name":"Digital Filter Design and Implementation","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.802104651927948},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.7687865495681763},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.7667046785354614},{"id":"https://openalex.org/keywords/overlap\u2013add-method","display_name":"Overlap\u2013add method","score":0.7251625061035156},{"id":"https://openalex.org/keywords/circular-convolution","display_name":"Circular convolution","score":0.6317285299301147},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.6271761655807495},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6009858250617981},{"id":"https://openalex.org/keywords/convolution-theorem","display_name":"Convolution theorem","score":0.5883424878120422},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.5737185478210449},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5533273220062256},{"id":"https://openalex.org/keywords/discrete-hartley-transform","display_name":"Discrete Hartley transform","score":0.5400709509849548},{"id":"https://openalex.org/keywords/raders-fft-algorithm","display_name":"Rader's FFT algorithm","score":0.536238431930542},{"id":"https://openalex.org/keywords/digital-filter","display_name":"Digital filter","score":0.4533802568912506},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4222366213798523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37796974182128906},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.30854862928390503},{"id":"https://openalex.org/keywords/short-time-fourier-transform","display_name":"Short-time Fourier transform","score":0.16577398777008057},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.16292506456375122},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14149224758148193},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.13424545526504517},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.09270969033241272}],"concepts":[{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.802104651927948},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7687865495681763},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.7667046785354614},{"id":"https://openalex.org/C181002996","wikidata":"https://www.wikidata.org/wiki/Q1611641","display_name":"Overlap\u2013add method","level":5,"score":0.7251625061035156},{"id":"https://openalex.org/C194980680","wikidata":"https://www.wikidata.org/wiki/Q245450","display_name":"Circular convolution","level":5,"score":0.6317285299301147},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.6271761655807495},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6009858250617981},{"id":"https://openalex.org/C79587385","wikidata":"https://www.wikidata.org/wiki/Q2638931","display_name":"Convolution theorem","level":5,"score":0.5883424878120422},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.5737185478210449},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5533273220062256},{"id":"https://openalex.org/C192853989","wikidata":"https://www.wikidata.org/wiki/Q1006531","display_name":"Discrete Hartley transform","level":5,"score":0.5400709509849548},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.536238431930542},{"id":"https://openalex.org/C36390408","wikidata":"https://www.wikidata.org/wiki/Q1163067","display_name":"Digital filter","level":3,"score":0.4533802568912506},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4222366213798523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37796974182128906},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.30854862928390503},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.16577398777008057},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.16292506456375122},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14149224758148193},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.13424545526504517},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.09270969033241272},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lsp.2019.2950111","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2019.2950111","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1987138902","https://openalex.org/W2001271893","https://openalex.org/W2025688688","https://openalex.org/W2054215882","https://openalex.org/W2096121910","https://openalex.org/W2098219648","https://openalex.org/W2099206970","https://openalex.org/W2102357544","https://openalex.org/W2107868713","https://openalex.org/W2114499326","https://openalex.org/W2120816439","https://openalex.org/W2123066648","https://openalex.org/W2124092400","https://openalex.org/W2134128809","https://openalex.org/W2798924194","https://openalex.org/W2918622534","https://openalex.org/W2920471934"],"related_works":["https://openalex.org/W4363675452","https://openalex.org/W4372260258","https://openalex.org/W2759540840","https://openalex.org/W2166650508","https://openalex.org/W2170755202","https://openalex.org/W4253408561","https://openalex.org/W2982446276","https://openalex.org/W2049065832","https://openalex.org/W4134551","https://openalex.org/W2009436830"],"abstract_inverted_index":{"A":[0,50],"Fast":[1,26],"linear":[2],"convolution":[3,32,48,69],"algorithm":[4],"based":[5,23],"on":[6,24],"the":[7,25,46,73],"Discrete":[8],"Hirschman":[9],"Transform":[10,28],"(DHT)":[11],"provides":[12],"increased":[13],"hardware":[14],"flexibility":[15],"and":[16],"reduced":[17],"computational":[18,61,85],"complexity":[19],"compared":[20],"to":[21,44,56],"those":[22],"Fourier":[27],"(FFT).":[29],"This":[30,93],"DHT":[31,47,68],"can":[33,95],"be":[34,96],"realized":[35],"by":[36],"block-processing":[37],"filters.":[38],"We":[39],"propose":[40],"a":[41,88],"hardware-efficient":[42],"structure":[43],"implement":[45],"filter.":[49],"digital":[51],"data":[52],"example":[53],"is":[54],"used":[55],"discuss":[57],"its":[58,78],"improvement":[59],"in":[60],"complexity.":[62],"Observation":[63],"indicates":[64],"that":[65],"our":[66],"proposed":[67],"filter":[70],"either":[71],"enjoys":[72],"same":[74],"peak":[75],"performances":[76],"as":[77],"FFT":[79],"competitor,":[80],"or":[81],"even":[82],"reduces":[83],"more":[84],"load":[86],"with":[87],"slightly":[89],"larger":[90],"output":[91],"size.":[92],"performance":[94],"further":[97],"enhanced":[98],"using":[99],"alternative":[100],"DHT-based":[101],"methods.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}