{"id":"https://openalex.org/W2131863482","doi":"https://doi.org/10.1109/icmcs.2014.6911170","title":"An optimized min-sum variable node layering for LDPC decoding","display_name":"An optimized min-sum variable node layering for LDPC decoding","publication_year":2014,"publication_date":"2014-04-01","ids":{"openalex":"https://openalex.org/W2131863482","doi":"https://doi.org/10.1109/icmcs.2014.6911170","mag":"2131863482"},"language":"en","primary_location":{"id":"doi:10.1109/icmcs.2014.6911170","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmcs.2014.6911170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Multimedia Computing and Systems (ICMCS)","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/A5059385138","display_name":"Nassib Laouini","orcid":null},"institutions":[{"id":"https://openalex.org/I4210131288","display_name":"National Engineering School of Tunis","ror":"https://ror.org/03b1zjt31","country_code":"TN","type":"education","lineage":["https://openalex.org/I4210131288","https://openalex.org/I63596082"]},{"id":"https://openalex.org/I119865316","display_name":"\u00c9cole Nationale d'Ing\u00e9nieurs de Tarbes","ror":"https://ror.org/01fdvj254","country_code":"FR","type":"education","lineage":["https://openalex.org/I119865316","https://openalex.org/I4405258862"]}],"countries":["FR","TN"],"is_corresponding":true,"raw_author_name":"Nassib Laouini","raw_affiliation_strings":["Ecole Nationale d'Ingenieurs de Tarbes, Tarbes, Midi-Pyr\u00c3\u00a9n\u00c3\u00a9es, FR","SYSCOM Lab., ENIT, Tunis, Tunisia"],"affiliations":[{"raw_affiliation_string":"Ecole Nationale d'Ingenieurs de Tarbes, Tarbes, Midi-Pyr\u00c3\u00a9n\u00c3\u00a9es, FR","institution_ids":["https://openalex.org/I119865316"]},{"raw_affiliation_string":"SYSCOM Lab., ENIT, Tunis, Tunisia","institution_ids":["https://openalex.org/I4210131288"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037064291","display_name":"Larbi Ben Hadj Slama","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Larbi Ben Hadj Slama","raw_affiliation_strings":["INNOVCOM Laboratory, SUPCOM, Tunisia","INNOVCOM Lab., SUPCOM, Tunis, Tunisia"],"affiliations":[{"raw_affiliation_string":"INNOVCOM Laboratory, SUPCOM, Tunisia","institution_ids":[]},{"raw_affiliation_string":"INNOVCOM Lab., SUPCOM, Tunis, Tunisia","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060658201","display_name":"Ammar Bouall\u00e8gue","orcid":null},"institutions":[{"id":"https://openalex.org/I119865316","display_name":"\u00c9cole Nationale d'Ing\u00e9nieurs de Tarbes","ror":"https://ror.org/01fdvj254","country_code":"FR","type":"education","lineage":["https://openalex.org/I119865316","https://openalex.org/I4405258862"]},{"id":"https://openalex.org/I4210131288","display_name":"National Engineering School of Tunis","ror":"https://ror.org/03b1zjt31","country_code":"TN","type":"education","lineage":["https://openalex.org/I4210131288","https://openalex.org/I63596082"]}],"countries":["FR","TN"],"is_corresponding":false,"raw_author_name":"Ammar Bouallegue","raw_affiliation_strings":["Ecole Nationale d'Ingenieurs de Tarbes, Tarbes, Midi-Pyr\u00c3\u00a9n\u00c3\u00a9es, FR","SYSCOM Lab., ENIT, Tunis, Tunisia"],"affiliations":[{"raw_affiliation_string":"Ecole Nationale d'Ingenieurs de Tarbes, Tarbes, Midi-Pyr\u00c3\u00a9n\u00c3\u00a9es, FR","institution_ids":["https://openalex.org/I119865316"]},{"raw_affiliation_string":"SYSCOM Lab., ENIT, Tunis, Tunisia","institution_ids":["https://openalex.org/I4210131288"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5059385138"],"corresponding_institution_ids":["https://openalex.org/I119865316","https://openalex.org/I4210131288"],"apc_list":null,"apc_paid":null,"fwci":0.3448,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.67818131,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"48","issue":null,"first_page":"794","last_page":"799"},"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.9976000189781189,"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.9882000088691711,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.9125640392303467},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7563661336898804},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.68280428647995},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.679589569568634},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6368953585624695},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.606770396232605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6046132445335388},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4863467812538147},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.46156731247901917},{"id":"https://openalex.org/keywords/offset","display_name":"Offset (computer science)","score":0.4420608580112457},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4408777952194214},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3092840313911438},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.11063647270202637}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9125640392303467},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7563661336898804},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.68280428647995},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.679589569568634},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6368953585624695},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.606770396232605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6046132445335388},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4863467812538147},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.46156731247901917},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.4420608580112457},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4408777952194214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3092840313911438},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.11063647270202637},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"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/icmcs.2014.6911170","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmcs.2014.6911170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Multimedia Computing and Systems (ICMCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W206997066","https://openalex.org/W1518608438","https://openalex.org/W1573665190","https://openalex.org/W1956090263","https://openalex.org/W1966336366","https://openalex.org/W2046091144","https://openalex.org/W2101147641","https://openalex.org/W2102169767","https://openalex.org/W2118203851","https://openalex.org/W2119858605","https://openalex.org/W2126419525","https://openalex.org/W2128765501","https://openalex.org/W2135764410","https://openalex.org/W2139164285","https://openalex.org/W2142657012","https://openalex.org/W2151296558","https://openalex.org/W2162212880","https://openalex.org/W2339307522","https://openalex.org/W2538989200","https://openalex.org/W4300188436","https://openalex.org/W6675326518","https://openalex.org/W6683619271"],"related_works":["https://openalex.org/W2090897912","https://openalex.org/W2030180258","https://openalex.org/W4303096056","https://openalex.org/W4206131153","https://openalex.org/W1526609637","https://openalex.org/W2150639697","https://openalex.org/W3087284767","https://openalex.org/W2122913048","https://openalex.org/W2996745071","https://openalex.org/W2083917443"],"abstract_inverted_index":{"Layered":[0,22,98],"decoding":[1,112,132],"is":[2,39,60],"well":[3],"appreciated":[4],"in":[5,53],"Low-Density":[6],"Parity-Check":[7],"(LDPC)":[8],"decoder":[9],"implementation":[10,17],"since":[11],"it":[12],"provides":[13],"efficient":[14],"and":[15,27,57,78,81,102,167],"high-throughput":[16],"of":[18,42,75,85,146,154,176],"LDPC":[19,32,113],"decoders.":[20],"Variable-Node":[21],"Belief":[23,43],"Propagation":[24,44],"(VL-BP)":[25,100],"algorithm":[26,38,45,101,110,124],"their":[28],"reduced-complexity":[29],"derivatives":[30],"for":[31,111,140],"codes":[33],"are":[34,51],"presented.":[35],"The":[36],"VL-BP":[37,107,123],"a":[40,144,151,178],"modification":[41],"(BP),":[46],"where":[47],"the":[48,73,83,86,141,155,174],"variable":[49,147],"nodes":[50,148],"divided":[52],"subgroups":[54],"called":[55],"layers":[56],"each":[58],"iteration":[59],"broken":[61],"into":[62],"multiple":[63],"sub-iterations.":[64],"Some":[65],"simplifications":[66],"can":[67,164,169],"also":[68,126],"be":[69,165,171],"made":[70],"to":[71],"lower":[72],"complexity":[74,84],"both":[76],"BP":[77,99,128],"CL-BP":[79],"algorithms,":[80,137],"particularly":[82],"check":[87],"node":[88],"update":[89],"rule.":[90],"In":[91,130],"this":[92,131],"paper,":[93],"we":[94,138],"consider":[95,139],"Variable":[96],"Node":[97],"propose":[103],"an":[104,182],"optimized":[105],"min-sum":[106],"(MS":[108],"VL-BP)":[109],"code":[114],"which":[115,168],"has":[116,150],"better":[117],"performance":[118,163],"not":[119],"only":[120],"from":[121,127],"MS":[122],"but":[125],"algorithm.":[129],"method,":[133],"unlike":[134],"other":[135],"layered":[136],"first":[142],"layer":[143],"set":[145],"that":[149,161],"low":[152],"value":[153],"intrinsic":[156],"information.":[157],"Simulation":[158],"results":[159],"show":[160],"good":[162],"achieved,":[166],"even":[170],"improved":[172],"by":[173],"addition":[175],"either":[177],"normalization":[179],"term":[180],"or":[181],"additive":[183],"offset":[184],"term.":[185]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}