{"id":"https://openalex.org/W2801011149","doi":"https://doi.org/10.1109/iscas.2018.8351832","title":"Low-Complexity Software Stack Decoding of Polar Codes","display_name":"Low-Complexity Software Stack Decoding of Polar Codes","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2801011149","doi":"https://doi.org/10.1109/iscas.2018.8351832","mag":"2801011149"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2018.8351832","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2018.8351832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Circuits and Systems (ISCAS)","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/A5051883701","display_name":"Harsh Aurora","orcid":null},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Harsh Aurora","raw_affiliation_strings":["Department of Electrical and Computer Engineering, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085812448","display_name":"Carlo Condo","orcid":"https://orcid.org/0000-0002-3050-036X"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Carlo Condo","raw_affiliation_strings":["Department of Electrical and Computer Engineering, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091600002","display_name":"Warren J. Gross","orcid":"https://orcid.org/0000-0002-6226-6037"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Warren J. Gross","raw_affiliation_strings":["Department of Electrical and Computer Engineering, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051883701"],"corresponding_institution_ids":["https://openalex.org/I5023651"],"apc_list":null,"apc_paid":null,"fwci":2.3989,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.89670055,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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.9968000054359436,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9948999881744385,"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.7414476871490479},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7334583401679993},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6045218110084534},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5994384288787842},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5589404702186584},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5234512686729431},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.50983065366745},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5005195140838623},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4220714271068573},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.39524224400520325},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.3616678714752197},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3546360433101654},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1482606828212738}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7414476871490479},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7334583401679993},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6045218110084534},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5994384288787842},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5589404702186584},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5234512686729431},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.50983065366745},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5005195140838623},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4220714271068573},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.39524224400520325},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3616678714752197},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3546360433101654},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1482606828212738},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas.2018.8351832","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2018.8351832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Circuits and Systems (ISCAS)","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":17,"referenced_works":["https://openalex.org/W183754908","https://openalex.org/W892414265","https://openalex.org/W2014443100","https://openalex.org/W2033234285","https://openalex.org/W2035746421","https://openalex.org/W2106045225","https://openalex.org/W2117009122","https://openalex.org/W2150498905","https://openalex.org/W2284321898","https://openalex.org/W2518374686","https://openalex.org/W2593666428","https://openalex.org/W2600003388","https://openalex.org/W2610741500","https://openalex.org/W2963389341","https://openalex.org/W4254700466","https://openalex.org/W4301011605","https://openalex.org/W6735566060"],"related_works":["https://openalex.org/W1599365967","https://openalex.org/W4205451769","https://openalex.org/W2052976169","https://openalex.org/W2061476814","https://openalex.org/W99853930","https://openalex.org/W2127999627","https://openalex.org/W2154603729","https://openalex.org/W2010879611","https://openalex.org/W1504657239","https://openalex.org/W2115785601"],"abstract_inverted_index":{"Polar":[0],"codes":[1,9],"are":[2,113],"a":[3,48,91,99],"recent":[4],"class":[5],"of":[6,34,60,98,120,127],"linear":[7,92],"error-correcting":[8],"that":[10],"asymptotically":[11],"achieve":[12],"the":[13,32,61,78,87,96,109,117,121,125],"channel":[14],"capacity":[15],"at":[16,31,47],"infinite":[17],"code":[18],"length.":[19],"The":[20,38],"Successive":[21],"Cancellation":[22],"List":[23],"(SCL)":[24],"algorithm":[25,42],"yields":[26],"very":[27],"good":[28],"error-correction":[29,45,140],"performance,":[30],"cost":[33],"high":[35],"implementation":[36,59],"complexity.":[37,50,73],"Stack":[39],"(SCS)":[40],"decoding":[41,63],"provides":[43],"similar":[44,139],"performance":[46,141],"lower":[49],"In":[51,74],"this":[52],"work,":[53],"we":[54,76,112],"propose":[55],"an":[56,104],"efficient":[57,83],"software":[58],"SCS":[62,79,122],"algorithm,":[64],"along":[65,102],"with":[66,90,103,133],"techniques":[67],"to":[68,115,131,135],"further":[69],"reduce":[70,77,116],"its":[71],"computational":[72,118],"particular,":[75],"memory":[80],"requirements":[81],"through":[82],"path":[84],"switching,":[85],"replace":[86],"stack":[88],"sorting":[89],"search,":[93],"and":[94],"explore":[95],"use":[97],"partial":[100],"CRC":[101],"early":[105],"termination":[106],"criterion.":[107],"Using":[108],"proposed":[110],"methods,":[111],"able":[114],"complexity":[119],"decoder,":[123],"reducing":[124],"number":[126],"estimated":[128],"bits":[129],"up":[130],"97%":[132],"respect":[134],"SCL,":[136],"while":[137],"maintaining":[138],"as":[142],"SCL.":[143]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}