{"id":"https://openalex.org/W1971465713","doi":"https://doi.org/10.1109/sips.2013.6674486","title":"A semi-analytical bivariate Gaussian model of the approximation error impact on the Min-Sum LDPC decoding algorithm","display_name":"A semi-analytical bivariate Gaussian model of the approximation error impact on the Min-Sum LDPC decoding algorithm","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W1971465713","doi":"https://doi.org/10.1109/sips.2013.6674486","mag":"1971465713"},"language":"en","primary_location":{"id":"doi:10.1109/sips.2013.6674486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips.2013.6674486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SiPS 2013 Proceedings","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/A5073972617","display_name":"Nikos Kanistras","orcid":"https://orcid.org/0000-0002-7337-1107"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Nikos Kanistras","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Patras, Patras, Greece","Electr. & Comput. Eng. Dept., Univ. of Patras, Patras, Greece"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Electr. & Comput. Eng. Dept., Univ. of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021252086","display_name":"Vassilis Paliouras","orcid":"https://orcid.org/0000-0002-1414-7500"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Vassilis Paliouras","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Patras, Patras, Greece","Electr. & Comput. Eng. Dept., Univ. of Patras, Patras, Greece"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Electr. & Comput. Eng. Dept., Univ. of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073972617"],"corresponding_institution_ids":["https://openalex.org/I174878644"],"apc_list":null,"apc_paid":null,"fwci":0.3625,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62549184,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"89","last_page":"94"},"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.9955000281333923,"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.9850000143051147,"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/decoding-methods","display_name":"Decoding methods","score":0.8646539449691772},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7095584869384766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.66986483335495},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.599991500377655},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5652120113372803},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.5321654081344604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.52675861120224},{"id":"https://openalex.org/keywords/offset","display_name":"Offset (computer science)","score":0.5178049802780151},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.4565713703632355},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45453718304634094},{"id":"https://openalex.org/keywords/bivariate-analysis","display_name":"Bivariate analysis","score":0.433923602104187},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3553210496902466},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.21442800760269165},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.13241302967071533}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8646539449691772},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7095584869384766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.66986483335495},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.599991500377655},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5652120113372803},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.5321654081344604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.52675861120224},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.5178049802780151},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4565713703632355},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45453718304634094},{"id":"https://openalex.org/C64341305","wikidata":"https://www.wikidata.org/wiki/Q4919225","display_name":"Bivariate analysis","level":2,"score":0.433923602104187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3553210496902466},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.21442800760269165},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.13241302967071533},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sips.2013.6674486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips.2013.6674486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SiPS 2013 Proceedings","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5799999833106995,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W7241855","https://openalex.org/W1484692004","https://openalex.org/W2046091144","https://openalex.org/W2086516084","https://openalex.org/W2126259959","https://openalex.org/W2127342417","https://openalex.org/W2128765501","https://openalex.org/W2139164285","https://openalex.org/W2140837262","https://openalex.org/W2156938362","https://openalex.org/W4285719527","https://openalex.org/W6628810906"],"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/W2357077655"],"abstract_inverted_index":{"In":[0,24],"this":[1,142],"paper,":[2],"a":[3,104],"new":[4],"theoretical":[5,27],"model":[6,28,86,113,134],"that":[7,106],"describes":[8],"the":[9,12,16,26,34,40,44,47,53,57,67,100,108,111,118,128,132,136,139],"impact":[10],"of":[11,38,46,91,99,110,130,141],"approximation":[13,41],"error":[14,42],"on":[15,66,152],"decisions":[17,45,54],"taken":[18,55],"by":[19,36,56],"LDPC":[20,72],"decoders":[21],"is":[22,87,121],"discussed.":[23],"particular,":[25],"extends":[29],"previous":[30],"results":[31,126],"and":[32,76,82,135],"reconstructs":[33],"mechanism,":[35],"means":[37],"which":[39,95],"alters":[43],"decoding":[48,59,93,119,147],"algorithm,":[49,60],"with":[50],"respect":[51],"to":[52,89,116],"optimal":[58],"namely":[61,74],"Log":[62,101],"Sum-Product.":[63,102],"We":[64],"focus":[65],"most":[68],"popular":[69,79],"algorithm":[70],"for":[71],"decoding,":[73],"Min-Sum":[75],"its":[77],"also":[78,122],"modifications,":[80],"normalized":[81],"offset":[83],"Min-Sum.":[84],"The":[85],"applied":[88],"all":[90],"these":[92],"algorithms,":[94],"are":[96],"actually":[97],"approximations":[98],"Moreover":[103],"method":[105],"exploits":[107],"output":[109],"proposed":[112,133],"in":[114],"order":[115],"estimate":[117],"performance":[120],"proposed.":[123],"Finally,":[124],"experimental":[125],"prove":[127],"validity":[129],"both":[131],"method,":[137],"demonstrating":[138],"usefulness":[140],"contribution":[143],"towards":[144],"achieving":[145],"accurate":[146],"behavior":[148],"prediction":[149],"without":[150],"relying":[151],"time-consuming":[153],"simulations.":[154]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}