{"id":"https://openalex.org/W4312422976","doi":"https://doi.org/10.1109/pimrc54779.2022.9977717","title":"An Improved Stage-Combined Belief Propagation Decoding of Polar Codes","display_name":"An Improved Stage-Combined Belief Propagation Decoding of Polar Codes","publication_year":2022,"publication_date":"2022-09-12","ids":{"openalex":"https://openalex.org/W4312422976","doi":"https://doi.org/10.1109/pimrc54779.2022.9977717"},"language":"en","primary_location":{"id":"doi:10.1109/pimrc54779.2022.9977717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc54779.2022.9977717","pdf_url":null,"source":{"id":"https://openalex.org/S4363605306","display_name":"2022 IEEE 33rd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 33rd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)","raw_type":"proceedings-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/A5039139388","display_name":"Alireza Hasani","orcid":"https://orcid.org/0000-0002-0946-0324"},"institutions":[{"id":"https://openalex.org/I96578850","display_name":"Leibniz Institute for Neurobiology","ror":"https://ror.org/01zwmgk08","country_code":"DE","type":"facility","lineage":["https://openalex.org/I315704651","https://openalex.org/I96578850"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Alireza Hasani","raw_affiliation_strings":["IHP - Leibniz-Institut f&#x00FC;r innovative Mikroelektronik,Frankfurt (Oder),Germany"],"affiliations":[{"raw_affiliation_string":"IHP - Leibniz-Institut f&#x00FC;r innovative Mikroelektronik,Frankfurt (Oder),Germany","institution_ids":["https://openalex.org/I96578850"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046504896","display_name":"\u0141ukasz \u0141opaci\u0144ski","orcid":"https://orcid.org/0000-0002-2349-298X"},"institutions":[{"id":"https://openalex.org/I96578850","display_name":"Leibniz Institute for Neurobiology","ror":"https://ror.org/01zwmgk08","country_code":"DE","type":"facility","lineage":["https://openalex.org/I315704651","https://openalex.org/I96578850"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Lukasz Lopacinski","raw_affiliation_strings":["IHP - Leibniz-Institut f&#x00FC;r innovative Mikroelektronik,Frankfurt (Oder),Germany"],"affiliations":[{"raw_affiliation_string":"IHP - Leibniz-Institut f&#x00FC;r innovative Mikroelektronik,Frankfurt (Oder),Germany","institution_ids":["https://openalex.org/I96578850"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004959402","display_name":"Milo\u0161 Krsti\u0107","orcid":"https://orcid.org/0000-0003-0267-0203"},"institutions":[{"id":"https://openalex.org/I96578850","display_name":"Leibniz Institute for Neurobiology","ror":"https://ror.org/01zwmgk08","country_code":"DE","type":"facility","lineage":["https://openalex.org/I315704651","https://openalex.org/I96578850"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Milos Krstic","raw_affiliation_strings":["IHP - Leibniz-Institut f&#x00FC;r innovative Mikroelektronik,Frankfurt (Oder),Germany"],"affiliations":[{"raw_affiliation_string":"IHP - Leibniz-Institut f&#x00FC;r innovative Mikroelektronik,Frankfurt (Oder),Germany","institution_ids":["https://openalex.org/I96578850"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053247434","display_name":"Eckhard Grass","orcid":"https://orcid.org/0000-0002-9718-4170"},"institutions":[{"id":"https://openalex.org/I96578850","display_name":"Leibniz Institute for Neurobiology","ror":"https://ror.org/01zwmgk08","country_code":"DE","type":"facility","lineage":["https://openalex.org/I315704651","https://openalex.org/I96578850"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Eckhard Grass","raw_affiliation_strings":["IHP - Leibniz-Institut f&#x00FC;r innovative Mikroelektronik,Frankfurt (Oder),Germany"],"affiliations":[{"raw_affiliation_string":"IHP - Leibniz-Institut f&#x00FC;r innovative Mikroelektronik,Frankfurt (Oder),Germany","institution_ids":["https://openalex.org/I96578850"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5039139388"],"corresponding_institution_ids":["https://openalex.org/I96578850"],"apc_list":null,"apc_paid":null,"fwci":0.6479,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60845384,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1344","last_page":"1348"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9957000017166138,"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"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.902288556098938},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.890760600566864},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.884560227394104},{"id":"https://openalex.org/keywords/polar","display_name":"Polar","score":0.662309467792511},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6609443426132202},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6559466123580933},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5955003499984741},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5688043832778931},{"id":"https://openalex.org/keywords/polar-code","display_name":"Polar code","score":0.53777015209198},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5120906829833984},{"id":"https://openalex.org/keywords/bit-error-rate","display_name":"Bit error rate","score":0.4712422490119934},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.45259004831314087},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.44190043210983276},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.4186941385269165},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.41785016655921936},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.41109564900398254},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32363080978393555},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.3114193081855774},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.1655670702457428},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.11149615049362183},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.07002836465835571}],"concepts":[{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.902288556098938},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.890760600566864},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.884560227394104},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.662309467792511},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6609443426132202},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6559466123580933},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5955003499984741},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5688043832778931},{"id":"https://openalex.org/C2778396592","wikidata":"https://www.wikidata.org/wiki/Q7209069","display_name":"Polar code","level":3,"score":0.53777015209198},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5120906829833984},{"id":"https://openalex.org/C56296756","wikidata":"https://www.wikidata.org/wiki/Q840922","display_name":"Bit error rate","level":3,"score":0.4712422490119934},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.45259004831314087},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.44190043210983276},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.4186941385269165},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.41785016655921936},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.41109564900398254},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32363080978393555},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.3114193081855774},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.1655670702457428},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.11149615049362183},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.07002836465835571},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pimrc54779.2022.9977717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc54779.2022.9977717","pdf_url":null,"source":{"id":"https://openalex.org/S4363605306","display_name":"2022 IEEE 33rd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 33rd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1562717735","https://openalex.org/W2096894382","https://openalex.org/W2107523477","https://openalex.org/W2113237846","https://openalex.org/W2144885399","https://openalex.org/W2150498905","https://openalex.org/W2529234053","https://openalex.org/W2913060868","https://openalex.org/W2963817320","https://openalex.org/W3191049755","https://openalex.org/W3215360164"],"related_works":["https://openalex.org/W3152713649","https://openalex.org/W2783458831","https://openalex.org/W2963415185","https://openalex.org/W4299351589","https://openalex.org/W2532846949","https://openalex.org/W2963204888","https://openalex.org/W2106520586","https://openalex.org/W2591644370","https://openalex.org/W2899161352","https://openalex.org/W4297873022"],"abstract_inverted_index":{"Belief":[0],"Propagation":[1],"(BP)":[2],"algorithm":[3,27],"is":[4,28,41,111,126,149],"an":[5,18],"alternative":[6],"decoding":[7,13,78,108,122],"method":[8,109],"to":[9,44,59,67,75,113,132],"Successive":[10],"Cancellation":[11],"(SC)":[12],"of":[14,20,34,47,49,63,71,87,120,146,154],"polar":[15,36,65],"codes":[16],"with":[17],"advantage":[19],"higher":[21],"throughput":[22,40],"and":[23,38,73,93,135],"lesser":[24],"latency.":[25],"BP":[26,107],"performed":[29],"over":[30],"the":[31,45,50,60,69,77,115,121,143,155],"factor":[32,51,61,89],"graph":[33,62,90],"a":[35,64,88,96,104,152],"code,":[37],"its":[39],"oppositely":[42],"proportional":[43],"number":[46,70],"stages":[48,86],"graph.":[52],"The":[53],"stage-combining":[54,157],"idea":[55],"can":[56],"be":[57],"applied":[58],"code":[66],"halve":[68],"stages,":[72],"thus":[74],"double":[76],"throughput.":[79],"By":[80],"this":[81,100],"idea,":[82],"every":[83],"two":[84],"adjacent":[85],"are":[91],"combined":[92],"processed":[94],"in":[95],"single":[97],"step.":[98],"In":[99],"paper,":[101],"we":[102],"propose":[103],"modified":[105],"stage-combined":[106],"that":[110],"able":[112],"improve":[114],"Bit-Error":[116],"Rate":[117],"(BER)":[118],"performance":[119],"algorithm.":[123],"This":[124],"improvement":[125],"almost":[127],"0.5":[128],"dB":[129],"at":[130,139],"low":[131],"intermediate":[133],"SNRs,":[134,141],"much":[136],"more":[137],"considerable":[138],"high":[140],"since":[142],"undesired":[144],"phenomenon":[145],"error":[147],"floor":[148],"mitigated":[150],"as":[151],"result":[153],"proposed":[156],"mechanism.":[158]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
