{"id":"https://openalex.org/W3125541785","doi":"https://doi.org/10.1109/globecom42002.2020.9322183","title":"Approximated EM Algorithms for Estimation of Unknown Coded Discrete Memoryless Channels","display_name":"Approximated EM Algorithms for Estimation of Unknown Coded Discrete Memoryless Channels","publication_year":2020,"publication_date":"2020-12-01","ids":{"openalex":"https://openalex.org/W3125541785","doi":"https://doi.org/10.1109/globecom42002.2020.9322183","mag":"3125541785"},"language":"en","primary_location":{"id":"doi:10.1109/globecom42002.2020.9322183","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom42002.2020.9322183","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5080980452","display_name":"Naoaki Kokubun","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Naoaki Kokubun","raw_affiliation_strings":["University of California, San Diego, La Jolla, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, San Diego, La Jolla, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063870634","display_name":"Daiki Watanabe","orcid":"https://orcid.org/0000-0002-1278-3773"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daiki Watanabe","raw_affiliation_strings":["Institute of Memory Technology Research & Development, Kioxia Corporation, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Memory Technology Research & Development, Kioxia Corporation, Japan","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085619623","display_name":"Hironori Uchikawa","orcid":"https://orcid.org/0000-0001-7517-445X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hironori Uchikawa","raw_affiliation_strings":["Institute of Memory Technology Research & Development, Kioxia Corporation, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Memory Technology Research & Development, Kioxia Corporation, Japan","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060049531","display_name":"Paul H. Siegel","orcid":"https://orcid.org/0000-0001-5850-0874"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul H. Siegel","raw_affiliation_strings":["University of California, San Diego, La Jolla, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, San Diego, La Jolla, USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20248751,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9995999932289124,"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.9995999932289124,"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.9993000030517578,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9983999729156494,"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/algorithm","display_name":"Algorithm","score":0.7623500823974609},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.6588030457496643},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6516450047492981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6038196086883545},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5940108895301819},{"id":"https://openalex.org/keywords/expectation\u2013maximization-algorithm","display_name":"Expectation\u2013maximization algorithm","score":0.5146452188491821},{"id":"https://openalex.org/keywords/maximum-a-posteriori-estimation","display_name":"Maximum a posteriori estimation","score":0.4907459020614624},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4677567481994629},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32818493247032166},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3205495774745941},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.24459925293922424}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7623500823974609},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.6588030457496643},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6516450047492981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6038196086883545},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5940108895301819},{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.5146452188491821},{"id":"https://openalex.org/C9810830","wikidata":"https://www.wikidata.org/wiki/Q635384","display_name":"Maximum a posteriori estimation","level":3,"score":0.4907459020614624},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4677567481994629},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32818493247032166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3205495774745941},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.24459925293922424},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globecom42002.2020.9322183","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom42002.2020.9322183","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W628021441","https://openalex.org/W1536930200","https://openalex.org/W1601795611","https://openalex.org/W1607980066","https://openalex.org/W1663973292","https://openalex.org/W2039284087","https://openalex.org/W2047997537","https://openalex.org/W2049633694","https://openalex.org/W2115540782","https://openalex.org/W2138129780","https://openalex.org/W2158234251","https://openalex.org/W2947452299","https://openalex.org/W2948179157","https://openalex.org/W2962685383","https://openalex.org/W2962702487","https://openalex.org/W4253515568","https://openalex.org/W4256264271","https://openalex.org/W6660409595"],"related_works":["https://openalex.org/W1783992599","https://openalex.org/W2114899076","https://openalex.org/W2045588782","https://openalex.org/W2124697778","https://openalex.org/W2135468550","https://openalex.org/W2133422797","https://openalex.org/W2181917637","https://openalex.org/W1503775322","https://openalex.org/W2162040150","https://openalex.org/W1591800537"],"abstract_inverted_index":{"Mismatch":[0],"between":[1],"the":[2,6,10,27,37,54,72,81,85,90,97,110,117,143,146,151,160,165],"true":[3,152],"channel":[4,7,21,111,122,130,153],"and":[5,23,45,61,93,157],"assumed":[8],"in":[9,80,119,145,159],"design":[11],"of":[12,53,71,84,105],"a":[13,76,120,127,133],"communication":[14],"system":[15,18],"can":[16,31,40,46,149,163],"degrade":[17],"performance.":[19],"Joint":[20],"estimation":[22],"data":[24],"recovery":[25],"via":[26],"Expectation-Maximization":[28],"(EM)":[29],"algorithm":[30,39,56],"overcome":[32],"this":[33],"problem.":[34],"Though":[35],"stable,":[36],"EM":[38,55,86],"be":[41],"complex":[42],"to":[43,108,115],"implement":[44],"exhibit":[47],"slow":[48],"convergence.":[49],"We":[50],"present":[51],"approximations":[52,118,144],"that":[57,142],"reduce":[58],"computational":[59],"complexity":[60],"accelerate":[62,164],"convergence":[63,166],"for":[64],"LDPC-coded":[65],"discrete":[66],"memoryless":[67],"channels.":[68],"In":[69,96,113],"place":[70],"exact":[73],"bit-wise":[74],"maximum":[75],"posteriori":[77],"probability":[78],"decoder":[79,92],"E":[82,147],"step":[83,148,162],"algorithm,":[87],"we":[88,100,125],"use":[89,101,126],"sum-product":[91],"min-sum":[94],"decoder.":[95],"M":[98,161],"step,":[99],"hard":[102],"information":[103,107],"instead":[104],"soft":[106],"estimate":[109,150],"parameter.":[112],"order":[114],"evaluate":[116],"practical":[121],"mismatch":[123],"scenario,":[124],"flash":[128],"memory":[129],"described":[131],"by":[132],"quantized":[134],"Normal-Laplace":[135],"mixture":[136],"model.":[137],"The":[138],"simulation":[139],"results":[140],"demonstrate":[141],"with":[154,167],"low-complexity":[155],"decoding":[156],"those":[158],"reduced":[168],"measurement":[169],"precision.":[170]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}