{"id":"https://openalex.org/W2151740590","doi":"https://doi.org/10.1109/tit.2008.2009581","title":"Optimization of Information Rate Upper and Lower Bounds for Channels With Memory","display_name":"Optimization of Information Rate Upper and Lower Bounds for Channels With Memory","publication_year":2009,"publication_date":"2009-02-01","ids":{"openalex":"https://openalex.org/W2151740590","doi":"https://doi.org/10.1109/tit.2008.2009581","mag":"2151740590"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2008.2009581","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2008.2009581","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0711.4406","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Parastoo Sadeghi","orcid":null},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Parastoo Sadeghi","raw_affiliation_strings":["Department of Information Engineering, Research School of Information Science and Engineering, Australian National University, Canberra, ACT, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Research School of Information Science and Engineering, Australian National University, Canberra, ACT, Australia","institution_ids":["https://openalex.org/I118347636"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Pascal O. Vontobel","orcid":null},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pascal O. Vontobel","raw_affiliation_strings":["Hewlett Packard Laboratories, Palo Alto, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ramtin Shams","orcid":null},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ramtin Shams","raw_affiliation_strings":["Department of Information Engineering, Research School of Information Science and Engineering, Australian National University, Canberra, ACT, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Research School of Information Science and Engineering, Australian National University, Canberra, ACT, Australia","institution_ids":["https://openalex.org/I118347636"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7466,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.90735754,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"55","issue":"2","first_page":"663","last_page":"688"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.8718000054359436,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.8718000054359436,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.026900000870227814,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.025100000202655792,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.730400025844574},{"id":"https://openalex.org/keywords/fading","display_name":"Fading","score":0.593999981880188},{"id":"https://openalex.org/keywords/channel-state-information","display_name":"Channel state information","score":0.5587999820709229},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.5263000130653381},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.49630001187324524},{"id":"https://openalex.org/keywords/ergodic-theory","display_name":"Ergodic theory","score":0.46709999442100525},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.4478999972343445},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43860000371932983}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.730400025844574},{"id":"https://openalex.org/C81978471","wikidata":"https://www.wikidata.org/wiki/Q1196572","display_name":"Fading","level":3,"score":0.593999981880188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5716000199317932},{"id":"https://openalex.org/C148063708","wikidata":"https://www.wikidata.org/wiki/Q5072511","display_name":"Channel state information","level":3,"score":0.5587999820709229},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5347999930381775},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.5263000130653381},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.49630001187324524},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49050000309944153},{"id":"https://openalex.org/C122044880","wikidata":"https://www.wikidata.org/wiki/Q5498822","display_name":"Ergodic theory","level":2,"score":0.46709999442100525},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.4478999972343445},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43860000371932983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43320000171661377},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4268999993801117},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.31779998540878296},{"id":"https://openalex.org/C152139883","wikidata":"https://www.wikidata.org/wiki/Q252973","display_name":"Mutual information","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C160562895","wikidata":"https://www.wikidata.org/wiki/Q7239557","display_name":"Precoding","level":4,"score":0.2964000105857849},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.28870001435279846},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C29406490","wikidata":"https://www.wikidata.org/wiki/Q1420659","display_name":"Fisher information","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.2655999958515167},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2574000060558319}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tit.2008.2009581","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2008.2009581","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0711.4406","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0711.4406","pdf_url":"https://arxiv.org/pdf/0711.4406","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/50674","is_oa":false,"landing_page_url":"http://hdl.handle.net/1885/50674","pdf_url":null,"source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"Journal article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0711.4406","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0711.4406","pdf_url":"https://arxiv.org/pdf/0711.4406","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1943431639","https://openalex.org/W1972228175","https://openalex.org/W2044986946","https://openalex.org/W2045407304","https://openalex.org/W2049633694","https://openalex.org/W2053742104","https://openalex.org/W2063142364","https://openalex.org/W2068518213","https://openalex.org/W2070432296","https://openalex.org/W2097939017","https://openalex.org/W2098257210","https://openalex.org/W2098630121","https://openalex.org/W2099111195","https://openalex.org/W2103331763","https://openalex.org/W2108033855","https://openalex.org/W2108131375","https://openalex.org/W2111604404","https://openalex.org/W2111774205","https://openalex.org/W2119683335","https://openalex.org/W2141021549","https://openalex.org/W2141859951","https://openalex.org/W2144098478","https://openalex.org/W2146318236","https://openalex.org/W2148643041","https://openalex.org/W2153623795","https://openalex.org/W2157721994","https://openalex.org/W2163619651","https://openalex.org/W2165808853","https://openalex.org/W6634270078","https://openalex.org/W6679966601","https://openalex.org/W6682094878"],"related_works":[],"abstract_inverted_index":{"We":[0,52,97,111],"consider":[1,26],"the":[2,87,90,105,120,125,141,147,162,172,178,187,194,201,211,218,224,232,235,240,246],"problem":[3],"of":[4,15,32,65,89,127,134,171,181,227],"minimizing":[5],"upper":[6,106,149],"bounds":[7,11,58],"and":[8,17,137,150,167,191,243],"maximizing":[9],"lower":[10,121,151,212],"on":[12],"information":[13,56,221,225],"rates":[14],"stationary":[16],"ergodic":[18],"discrete-time":[19],"channels":[20,24,69,139],"with":[21,158],"memory.":[22],"The":[23],"we":[25,130,154],"can":[27,41],"have":[28,42],"a":[29,206,228],"finite":[30],"number":[31],"states,":[33],"such":[34,47,60],"as":[35,48],"partial":[36,135],"response":[37,136],"channels,":[38,61],"or":[39],"they":[40],"an":[43,99,114,168],"infinite":[44],"state":[45],"space,":[46],"time-varying":[49],"fading":[50,138],"channels.":[51],"optimize":[53,86],"recently":[54],"proposed":[55,142],"rate":[57,226],"for":[59,117],"which":[62],"make":[63],"use":[64],"auxiliary":[66,91,241],"finite-state":[67],"machine":[68],"(FSMCs).":[70],"Our":[71],"main":[72],"contribution":[73],"in":[74],"this":[75],"paper":[76],"is":[77,214,237],"to":[78,85,93,186,216,239,245],"provide":[79,98,113,131],"iterative":[80,101],"expectation-maximization":[81],"(EM)":[82],"type":[83],"algorithms":[84,183,198],"parameters":[88],"FSMC":[92],"tighten":[94,146],"these":[95],"bounds.":[96,152,203],"explicit,":[100],"algorithm":[102,166],"that":[103],"improves":[104],"bound":[107,213],"at":[108,234],"each":[109],"iteration.":[110],"also":[112],"effective":[115],"method":[116,190],"iteratively":[118],"optimizing":[119,210],"bound.":[122],"To":[123],"demonstrate":[124],"effectiveness":[126],"our":[128,156,182,197],"algorithms,":[129],"several":[132],"examples":[133],"where":[140,231],"optimization":[143,165],"techniques":[144],"significantly":[145],"initial":[148],"Finally,":[153],"compare":[155],"results":[157,159],"obtained":[160],"by":[161],"conjugate":[163,188],"gradient":[164,189],"improved":[169],"variation":[170],"simplex":[173],"algorithm,":[174,196],"called":[175],"Soblex.":[176],"While":[177],"computational":[179],"complexities":[180],"are":[184],"similar":[185],"less":[192],"than":[193],"Soblex":[195],"robustly":[199],"find":[200],"tightest":[202],"Interestingly,":[204],"from":[205],"channel":[207],"coding/decoding":[208],"perspective,":[209],"related":[215],"increasing":[217],"achievable":[219],"mismatched":[220],"rate,":[222],"i.e.,":[223],"communication":[229],"system":[230],"decoder":[233],"receiver":[236],"matched":[238],"channel,":[242],"not":[244],"original":[247],"channel.":[248]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":6}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}