{"id":"https://openalex.org/W2558630945","doi":"https://doi.org/10.1109/tcomm.2016.2633466","title":"Non-Uniform Window Decoding Schedules for Spatially Coupled LDPC Codes","display_name":"Non-Uniform Window Decoding Schedules for Spatially Coupled LDPC Codes","publication_year":2016,"publication_date":"2016-11-29","ids":{"openalex":"https://openalex.org/W2558630945","doi":"https://doi.org/10.1109/tcomm.2016.2633466","mag":"2558630945"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2016.2633466","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2016.2633466","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Transactions on Communications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lup.lub.lu.se/search/files/35273512/FinalPaper.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078487384","display_name":"Najeeb ul Hassan","orcid":null},"institutions":[{"id":"https://openalex.org/I245417339","display_name":"Vodafone (Germany)","ror":"https://ror.org/044qwkx83","country_code":"DE","type":"company","lineage":["https://openalex.org/I245417339","https://openalex.org/I74316835"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Najeeb Ul Hassan","raw_affiliation_strings":["Vodafone Chair Mobile Communications Systems, SFB 912 HAEC, Technical University of Dresden, Dresden, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vodafone Chair Mobile Communications Systems, SFB 912 HAEC, Technical University of Dresden, Dresden, Germany","institution_ids":["https://openalex.org/I245417339"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059780057","display_name":"Al\u00ed Emre Pusane","orcid":"https://orcid.org/0000-0002-8412-6684"},"institutions":[{"id":"https://openalex.org/I4405392","display_name":"Bo\u011fazi\u00e7i University","ror":"https://ror.org/03z9tma90","country_code":"TR","type":"education","lineage":["https://openalex.org/I4405392"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Ali E. Pusane","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Bo\u011fazi\u00e7i University, Istanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Bo\u011fazi\u00e7i University, Istanbul, Turkey","institution_ids":["https://openalex.org/I4405392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090066379","display_name":"Michael Lentmaier","orcid":"https://orcid.org/0000-0003-3549-1412"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Michael Lentmaier","raw_affiliation_strings":["Department of Electrical and Information Technology, Lund University, Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Information Technology, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022117288","display_name":"Gerhard Fettweis","orcid":"https://orcid.org/0000-0003-4622-1311"},"institutions":[{"id":"https://openalex.org/I245417339","display_name":"Vodafone (Germany)","ror":"https://ror.org/044qwkx83","country_code":"DE","type":"company","lineage":["https://openalex.org/I245417339","https://openalex.org/I74316835"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Gerhard P. Fettweis","raw_affiliation_strings":["Vodafone Chair Mobile Communications Systems, SFB 912 HAEC, Technical University of Dresden, Dresden, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vodafone Chair Mobile Communications Systems, SFB 912 HAEC, Technical University of Dresden, Dresden, Germany","institution_ids":["https://openalex.org/I245417339"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089062454","display_name":"Daniel J. Costello","orcid":"https://orcid.org/0000-0002-4387-116X"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel J. Costello","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1164,"has_fulltext":true,"cited_by_count":29,"citation_normalized_percentile":{"value":0.92670603,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"65","issue":"2","first_page":"501","last_page":"510"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9864000082015991,"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.9801999926567078,"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/decoding-methods","display_name":"Decoding methods","score":0.868450939655304},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6496139764785767},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6153465509414673},{"id":"https://openalex.org/keywords/sliding-window-protocol","display_name":"Sliding window protocol","score":0.598352313041687},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5894648432731628},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5374339818954468},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5191646814346313},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.48761382699012756},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4815566837787628},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4663464426994324},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4206421375274658},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2835242748260498},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.278445303440094},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2573157846927643},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.16802144050598145}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.868450939655304},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6496139764785767},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6153465509414673},{"id":"https://openalex.org/C102392041","wikidata":"https://www.wikidata.org/wiki/Q592860","display_name":"Sliding window protocol","level":3,"score":0.598352313041687},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5894648432731628},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5374339818954468},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5191646814346313},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.48761382699012756},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4815566837787628},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4663464426994324},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4206421375274658},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2835242748260498},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.278445303440094},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2573157846927643},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.16802144050598145},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tcomm.2016.2633466","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2016.2633466","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Transactions on Communications","raw_type":"journal-article"},{"id":"pmh:oai:lup.lub.lu.se:a67a77f3-b8c0-43b9-8c67-7f08007bb112","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/a67a77f3-b8c0-43b9-8c67-7f08007bb112","pdf_url":"https://lup.lub.lu.se/search/files/35273512/FinalPaper.pdf","source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"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":"ISSN: 0090-6778","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:lup.lub.lu.se:a67a77f3-b8c0-43b9-8c67-7f08007bb112","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/a67a77f3-b8c0-43b9-8c67-7f08007bb112","pdf_url":"https://lup.lub.lu.se/search/files/35273512/FinalPaper.pdf","source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"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":"ISSN: 0090-6778","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3394318195","display_name":null,"funder_award_id":"CCF-1165714","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6421713472","display_name":null,"funder_award_id":"111E276","funder_id":"https://openalex.org/F4320338080","funder_display_name":"European Social Fund"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338080","display_name":"European Social Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2558630945.pdf","grobid_xml":"https://content.openalex.org/works/W2558630945.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1520354017","https://openalex.org/W1525888637","https://openalex.org/W1864365761","https://openalex.org/W1964402820","https://openalex.org/W1972036717","https://openalex.org/W1976430875","https://openalex.org/W1991528082","https://openalex.org/W2067073337","https://openalex.org/W2074450800","https://openalex.org/W2094085127","https://openalex.org/W2099335463","https://openalex.org/W2123119950","https://openalex.org/W2128765501","https://openalex.org/W2134502194","https://openalex.org/W2138308684","https://openalex.org/W2149021408","https://openalex.org/W2155295255","https://openalex.org/W2172679141","https://openalex.org/W2560849640","https://openalex.org/W3100523383","https://openalex.org/W3125530803","https://openalex.org/W4300188436","https://openalex.org/W6603727012","https://openalex.org/W6631424144","https://openalex.org/W6730588902"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2102627024","https://openalex.org/W2182594114","https://openalex.org/W2085052822","https://openalex.org/W3097264971"],"abstract_inverted_index":{"Spatially":[0],"coupled":[1,21],"low-density":[2],"parity-check":[3],"codes":[4],"can":[5,54],"be":[6,55],"decoded":[7],"using":[8,118],"a":[9,32,58,66,103,123],"graph-based":[10],"message":[11],"passing":[12],"algorithm":[13],"applied":[14,56],"across":[15],"the":[16,20,71,89,142],"total":[17],"length":[18],"of":[19],"graph.":[22],"However,":[23,61],"considering":[24],"practical":[25],"constraints":[26],"on":[27,85,115],"decoding":[28,35,44,50,59,126,143],"latency":[29],"and":[30,82,129],"complexity,":[31],"sliding":[33],"window":[34,67],"approach":[36],"is":[37],"normally":[38],"preferred.":[39],"In":[40],"order":[41],"to":[42],"reduce":[43],"complexity":[45,107],"compared":[46],"with":[47],"standard":[48],"parallel":[49],"schedules,":[51],"serial":[52,63],"schedules":[53,64,80,100],"within":[57,65,141],"window.":[60],"uniform":[62],"do":[68],"not":[69,133],"provide":[70],"expected":[72],"reduction":[73,105],"in":[74,88,102,106,111],"complexity.":[75],"Hence,":[76],"we":[77,121],"propose":[78,122],"non-uniform":[79,99,124],"(parallel":[81,128],"serial)":[83,130],"based":[84,114],"measured":[86],"improvements":[87],"estimated":[90],"bit":[91],"error":[92],"rate":[93],"(BER).":[94],"We":[95],"show":[96],"that":[97,131],"these":[98],"result":[101],"significant":[104],"without":[108],"any":[109,135],"loss":[110],"performance.":[112],"Furthermore,":[113],"observations":[116],"made":[117],"density":[119],"evolution,":[120],"pragmatic":[125],"schedule":[127],"does":[132],"require":[134],"additional":[136],"calculations":[137],"(e.g.,":[138],"BER":[139],"estimates)":[140],"process.":[144]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}