{"id":"https://openalex.org/W2045276811","doi":"https://doi.org/10.1109/isit.2013.6620368","title":"A two phase successive cancellation decoder architecture for polar codes","display_name":"A two phase successive cancellation decoder architecture for polar codes","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2045276811","doi":"https://doi.org/10.1109/isit.2013.6620368","mag":"2045276811"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620368","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","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/A5083387804","display_name":"Alptekin Pamuk","orcid":null},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Alptekin Pamuk","raw_affiliation_strings":["Department of Electrical-Electronics Engineering, Bilkent University, Ankara, Turkey","Dept. of Electr.-Electron. Eng., Bilkent Univ., Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical-Electronics Engineering, Bilkent University, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]},{"raw_affiliation_string":"Dept. of Electr.-Electron. Eng., Bilkent Univ., Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027597212","display_name":"Erdal Ar\u0131kan","orcid":"https://orcid.org/0000-0001-8810-4450"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Erdal Arikan","raw_affiliation_strings":["Dept. of Electr.-Electron. Eng., Bilkent Univ., Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electr.-Electron. Eng., Bilkent Univ., Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I168864056"],"apc_list":null,"apc_paid":null,"fwci":8.7845,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.97974378,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"957","last_page":"961"},"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.9984999895095825,"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/T11130","display_name":"Coding theory and cryptography","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/decoding-methods","display_name":"Decoding methods","score":0.8653210401535034},{"id":"https://openalex.org/keywords/polar-code","display_name":"Polar code","score":0.735204815864563},{"id":"https://openalex.org/keywords/soft-decision-decoder","display_name":"Soft-decision decoder","score":0.7122777104377747},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6787654161453247},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5376570820808411},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5264659523963928},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.47040921449661255},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.4583129584789276},{"id":"https://openalex.org/keywords/polar","display_name":"Polar","score":0.4196270704269409},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4145180583000183},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.3762463927268982},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17018625140190125},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.12872931361198425}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8653210401535034},{"id":"https://openalex.org/C2778396592","wikidata":"https://www.wikidata.org/wiki/Q7209069","display_name":"Polar code","level":3,"score":0.735204815864563},{"id":"https://openalex.org/C185588885","wikidata":"https://www.wikidata.org/wiki/Q7553811","display_name":"Soft-decision decoder","level":3,"score":0.7122777104377747},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6787654161453247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5376570820808411},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5264659523963928},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47040921449661255},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.4583129584789276},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.4196270704269409},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4145180583000183},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.3762463927268982},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17018625140190125},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.12872931361198425},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2013.6620368","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/27890","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/27890","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7141490565","display_name":"Network of Excellence in Wireless COMmunications #","funder_award_id":"318306","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1578792663","https://openalex.org/W1993492094","https://openalex.org/W2010365725","https://openalex.org/W2084346236","https://openalex.org/W2144068311","https://openalex.org/W2150498905","https://openalex.org/W2163509114"],"related_works":["https://openalex.org/W1599814246","https://openalex.org/W2963228343","https://openalex.org/W3106389544","https://openalex.org/W3080200660","https://openalex.org/W3196757433","https://openalex.org/W2417337632","https://openalex.org/W4293869169","https://openalex.org/W4244085088","https://openalex.org/W2139347103","https://openalex.org/W2154078079"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,25,30,44,53,97,108,170,200,223,245],"two-phase":[3],"successive":[4],"cancellation":[5],"(TPSC)":[6],"decoder":[7,67,77,110,125,134,144,150,161,190],"architecture":[8,234],"for":[9,47,56,182],"polar":[10,18,27,209],"codes":[11,19],"that":[12,231,248],"exploits":[13],"the":[14,22,50,59,62,75,105,123,143,149,160,184,189,197,217,232],"array-code":[15],"property":[16],"of":[17,24,32,41,61,84,122,141,172,177,196],"by":[20],"breaking":[21],"decoding":[23,35,38,48,57,138],"length-TV":[26],"code":[28,63,210,253],"into":[29],"series":[31],"length-\u221a":[33],"L":[34],"cycles.":[36,139],"Each":[37],"cycle":[39],"consists":[40],"two":[42],"phases:":[43],"first":[45],"phase":[46,55],"along":[49,58],"columns":[51],"and":[52,153,169,188,216,244],"second":[54],"rows":[60],"array.":[64],"The":[65,120,228],"reduced":[66],"size":[68,178],"makes":[69,127],"it":[70,128],"more":[71],"affordable":[72],"to":[73,89,96,130,252],"implement":[74],"core":[76],"logic":[78],"using":[79],"distributed":[80],"memory":[81,93,239],"elements":[82],"consisting":[83],"flip-flops":[85],"(FFs),":[86],"as":[87],"opposed":[88],"slower":[90],"random":[91],"access":[92],"(RAM),":[94],"leading":[95],"speed":[98],"up":[99],"in":[100,114,147,213],"clock":[101,246],"frequency.":[102],"To":[103],"minimize":[104],"circuit":[106,165],"complexity,":[107,237],"single":[109],"unit":[111],"is":[112,180,211,249],"used":[113],"both":[115],"phases":[116],"with":[117,222,241],"minor":[118],"modifications.":[119],"re-use":[121],"same":[124],"module":[126],"necessary":[129],"recall":[131],"certain":[132],"internal":[133],"state":[135,145],"variables":[136,146,187],"between":[137],"Instead":[140],"storing":[142,183],"RAM,":[148,168],"discards":[151],"them":[152,155],"calculates":[154],"again":[156],"when":[157],"needed.":[158],"Overall,":[159],"has":[162,235],"O(\u221a":[163],"L)":[164],"complexity":[166],"excluding":[167],"latency":[171],"approximately":[173],"2.57V.":[174],"A":[175],"RAM":[176],"O(N)":[179],"needed":[181],"channel":[185],"log-likelihood":[186],"decision":[191],"variables.":[192],"As":[193],"an":[194,214],"example":[195],"proposed":[198,233],"method,":[199],"length":[201],"N":[202],"=":[203],"2":[204],"<sup":[205],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[206],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">14</sup>":[207],"bit":[208],"implemented":[212],"FPGA":[215,226],"synthesis":[218],"results":[219,229],"are":[220],"compared":[221],"previously":[224],"reported":[225],"implementation.":[227],"show":[230],"lower":[236,238],"utilization":[240],"higher":[242],"throughput,":[243],"frequency":[247],"less":[250],"sensitive":[251],"length.":[254]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":13}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}