{"id":"https://openalex.org/W4308075492","doi":"https://doi.org/10.1109/sips55645.2022.9919209","title":"Multi-Factor Pruning for Recursive Projection-Aggregation Decoding of RM Codes","display_name":"Multi-Factor Pruning for Recursive Projection-Aggregation Decoding of RM Codes","publication_year":2022,"publication_date":"2022-11-02","ids":{"openalex":"https://openalex.org/W4308075492","doi":"https://doi.org/10.1109/sips55645.2022.9919209"},"language":"en","primary_location":{"id":"doi:10.1109/sips55645.2022.9919209","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips55645.2022.9919209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Workshop on Signal Processing Systems (SiPS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/8c49d176-849f-4fad-9e9d-49831a251e2d","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002579179","display_name":"Marzieh Hashemipour-Nazari","orcid":"https://orcid.org/0000-0003-3998-5938"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Marzieh Hashemipour-Nazari","raw_affiliation_strings":["Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,The Netherlands","Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048502768","display_name":"Kees Goossens","orcid":"https://orcid.org/0000-0001-7536-4050"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Kees Goossens","raw_affiliation_strings":["Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,The Netherlands","Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075502847","display_name":"Alexios Balatsoukas\u2010Stimming","orcid":"https://orcid.org/0000-0002-6721-4666"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alexios Balatsoukas-Stimming","raw_affiliation_strings":["Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,The Netherlands","Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002579179"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":1.1393,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79481774,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8414998054504395},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7886319756507874},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.7571603059768677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7090268135070801},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6652304530143738},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5451461672782898},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5402327179908752},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33277037739753723},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23314714431762695}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8414998054504395},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7886319756507874},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.7571603059768677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7090268135070801},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6652304530143738},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5451461672782898},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5402327179908752},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33277037739753723},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23314714431762695},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/sips55645.2022.9919209","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips55645.2022.9919209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Workshop on Signal Processing Systems (SiPS)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire/8c49d176-849f-4fad-9e9d-49831a251e2d","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/8c49d176-849f-4fad-9e9d-49831a251e2d","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Hashemipour Nazari, M, Goossens, K & Balatsoukas-Stimming, A 2022, Multi-Factor Pruning for Recursive Projection-Aggregation Decoding of RM Codes. in 2022 IEEE Workshop on Signal Processing Systems (SiPS)., 9919209, Institute of Electrical and Electronics Engineers, 36th IEEE Workshop on Signal Processing Systems, SiPS 2022, Rennes, France, 2/11/22. https://doi.org/10.1109/SiPS55645.2022.9919209","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/8c49d176-849f-4fad-9e9d-49831a251e2d","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85141649411&partnerID=8YFLogxK","pdf_url":"https://pure.tue.nl/ws/files/230743193/Multi_Factor_Pruning_for_Recursive_Projection_Aggregation_Decoding_of_RM_Codes.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hashemipour Nazari, M, Goossens, K & Balatsoukas-Stimming, A 2022, Multi-Factor Pruning for Recursive Projection-Aggregation Decoding of RM Codes. in 2022 IEEE Workshop on Signal Processing Systems (SiPS)., 9919209, Institute of Electrical and Electronics Engineers, 36th IEEE Workshop on Signal Processing Systems, SiPS 2022, Rennes, France, 2/11/22. https://doi.org/10.1109/SiPS55645.2022.9919209","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/8c49d176-849f-4fad-9e9d-49831a251e2d","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/8c49d176-849f-4fad-9e9d-49831a251e2d","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2022 IEEE Workshop on Signal Processing Systems (SiPS)","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/8c49d176-849f-4fad-9e9d-49831a251e2d","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/8c49d176-849f-4fad-9e9d-49831a251e2d","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Hashemipour Nazari, M, Goossens, K & Balatsoukas-Stimming, A 2022, Multi-Factor Pruning for Recursive Projection-Aggregation Decoding of RM Codes. in 2022 IEEE Workshop on Signal Processing Systems (SiPS)., 9919209, Institute of Electrical and Electronics Engineers, 36th IEEE Workshop on Signal Processing Systems, SiPS 2022, Rennes, France, 2/11/22. https://doi.org/10.1109/SiPS55645.2022.9919209","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1986310050","https://openalex.org/W2004229705","https://openalex.org/W2025948462","https://openalex.org/W2103524940","https://openalex.org/W2121417875","https://openalex.org/W2121498709","https://openalex.org/W2127074672","https://openalex.org/W2134750166","https://openalex.org/W2150498905","https://openalex.org/W2155995390","https://openalex.org/W2591190829","https://openalex.org/W3009999666","https://openalex.org/W3035162521","https://openalex.org/W3084582945","https://openalex.org/W3160623698","https://openalex.org/W3161348053","https://openalex.org/W3196996832","https://openalex.org/W3212795869","https://openalex.org/W4245516769","https://openalex.org/W4299677244","https://openalex.org/W6682299005"],"related_works":["https://openalex.org/W2373300491","https://openalex.org/W2161474341","https://openalex.org/W2395294869","https://openalex.org/W2378744544","https://openalex.org/W2594301978","https://openalex.org/W4302615923","https://openalex.org/W2379704676","https://openalex.org/W1998810860","https://openalex.org/W2161045342","https://openalex.org/W2943002782"],"abstract_inverted_index":{"The":[0],"recently":[1],"introduced":[2],"recursive":[3],"projection":[4],"aggregation":[5],"(RPA)":[6],"decoding":[7,18],"method":[8],"for":[9,29,77],"Reed-Muller":[10],"(RM)":[11],"codes":[12],"can":[13,67],"achieve":[14],"near-maximum":[15],"likelihood":[16],"(ML)":[17],"performance.":[19,85],"However,":[20],"its":[21,26],"high":[22],"computational":[23,49],"complexity":[24,40,50,70],"makes":[25],"implementation":[27],"challenging":[28],"time-":[30],"and":[31],"resource-critical":[32],"applications.":[33],"In":[34],"this":[35],"work,":[36],"we":[37],"present":[38],"a":[39,82],"reduction":[41],"technique":[42],"called":[43],"multi-factor":[44],"pruning":[45,61],"that":[46,58],"reduces":[47],"the":[48,59,69],"of":[51,71],"RPA":[52,72],"significantly.":[53],"Our":[54],"simulation":[55],"results":[56],"show":[57],"proposed":[60],"approach":[62],"with":[63],"appropriately":[64],"selected":[65],"factors":[66],"reduce":[68],"by":[73],"up":[74],"to":[75],"92%":[76],"RM(8,":[78],"3)":[79],"while":[80],"keeping":[81],"comparable":[83],"error-correcting":[84]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}