{"id":"https://openalex.org/W4226443568","doi":"https://doi.org/10.1587/transcom.2022ebp3032","title":"Block-Based Scheduling Algorithm for Layered Decoding of Block LDPC Codes","display_name":"Block-Based Scheduling Algorithm for Layered Decoding of Block LDPC Codes","publication_year":2022,"publication_date":"2022-04-27","ids":{"openalex":"https://openalex.org/W4226443568","doi":"https://doi.org/10.1587/transcom.2022ebp3032"},"language":"en","primary_location":{"id":"doi:10.1587/transcom.2022ebp3032","is_oa":false,"landing_page_url":"https://doi.org/10.1587/transcom.2022ebp3032","pdf_url":null,"source":{"id":"https://openalex.org/S2493627025","display_name":"IEICE Transactions on Communications","issn_l":"0916-8516","issn":["0916-8516","1745-1345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Communications","raw_type":"journal-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/A5053823002","display_name":"Sangjoon PARK","orcid":null},"institutions":[{"id":"https://openalex.org/I28615091","display_name":"Kyonggi University","ror":"https://ror.org/032xf8h46","country_code":"KR","type":"education","lineage":["https://openalex.org/I28615091"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Sangjoon PARK","raw_affiliation_strings":["Department of Electronic Engineering, Kyonggi University"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, Kyonggi University","institution_ids":["https://openalex.org/I28615091"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5053823002"],"corresponding_institution_ids":["https://openalex.org/I28615091"],"apc_list":null,"apc_paid":null,"fwci":0.1382,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.44373432,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"E105.B","issue":"11","first_page":"1408","last_page":"1413"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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":1.0,"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.9987000226974487,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8091883659362793},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.670479953289032},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6094074845314026},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.5992517471313477},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5612662434577942},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5092090368270874},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4445810317993164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1410747766494751},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.08820006251335144}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8091883659362793},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.670479953289032},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6094074845314026},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.5992517471313477},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5612662434577942},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5092090368270874},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4445810317993164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1410747766494751},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.08820006251335144}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1587/transcom.2022ebp3032","is_oa":false,"landing_page_url":"https://doi.org/10.1587/transcom.2022ebp3032","pdf_url":null,"source":{"id":"https://openalex.org/S2493627025","display_name":"IEICE Transactions on Communications","issn_l":"0916-8516","issn":["0916-8516","1745-1345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1573665190","https://openalex.org/W1883779324","https://openalex.org/W1990345138","https://openalex.org/W2068818457","https://openalex.org/W2073199959","https://openalex.org/W2088926056","https://openalex.org/W2094383388","https://openalex.org/W2107932975","https://openalex.org/W2113130401","https://openalex.org/W2126259959","https://openalex.org/W2135764410","https://openalex.org/W2379692291","https://openalex.org/W2561204040","https://openalex.org/W3021696242"],"related_works":["https://openalex.org/W1979851451","https://openalex.org/W2084088975","https://openalex.org/W4376852454","https://openalex.org/W1976158077","https://openalex.org/W2010303399","https://openalex.org/W1489472178","https://openalex.org/W2366919161","https://openalex.org/W3009741155","https://openalex.org/W2889518184","https://openalex.org/W1993691287"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"an":[3],"efficient":[4],"scheduling":[5,22,39,48,75,87,113,150],"algorithm":[6,26,45,83,141],"for":[7,36,89,152],"the":[8,24,28,32,43,54,58,73,81,103,123,139],"layered":[9,59,90,153],"decoding":[10,91,104,144,154],"of":[11,31,50,57,155],"block":[12,33,65,156],"low-density":[13],"parity-check":[14],"(LDPC)":[15],"codes.":[16,158],"To":[17],"efficiently":[18,85],"configure":[19],"check":[20,51,69,107,119],"node-based":[21],"groups,":[23],"proposed":[25,44,82,140],"utilizes":[27],"base":[29],"matrix":[30],"LDPC":[34,157],"code":[35],"a":[37,47],"block-by-block":[38],"group":[40,49,114,125],"configuration;":[41],"i.e.,":[42],"generates":[46],"nodes,":[52],"satisfying":[53],"weight":[55],"condition":[56],"decoding,":[60],"which":[61],"is":[62],"performed":[63,77],"in":[64,78,111],"units":[66],"(including":[67],"several":[68],"nodes).":[70],"Therefore,":[71],"unlike":[72],"conventional":[74],"algorithms":[76,151],"node":[79],"units,":[80],"can":[84,142],"generate":[86],"groups":[88],"at":[92],"low":[93],"computational":[94],"complexity":[95],"and":[96],"memory":[97],"requirements.":[98],"In":[99],"addition,":[100],"to":[101,122,132,147],"accelerate":[102,143],"convergence":[105,145],"speed,":[106],"nodes":[108,120],"are":[109,126],"allocated":[110],"each":[112],"such":[115],"that":[116,138],"messages":[117],"from":[118],"up":[121],"current":[124],"delivered":[127],"as":[128,130],"evenly":[129],"possible":[131],"bit":[133],"nodes.":[134],"Simulation":[135],"results":[136],"confirm":[137],"compared":[146],"other":[148],"block-based":[149]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}