{"title":"Optimal Source-Channel Decoder for Correlated Markov Sources over Additive Markov Channels","authors":"M. A. Haleem, K.P. Subbalakshmi","doi":"10.1109/DCC.2007.64","DOIUrl":null,"url":null,"abstract":"In this paper we propose an optimal joint source channel decoder (JSCD) for two mutually correlated sources each having memory that can be represented by first order Markov processes, and are transmitted through channels with memory representing slow fading wireless channels. We use the additive Markov channel (AMC) model and multiple access source codes (MASC)","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Data Compression Conference (DCC'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.2007.64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper we propose an optimal joint source channel decoder (JSCD) for two mutually correlated sources each having memory that can be represented by first order Markov processes, and are transmitted through channels with memory representing slow fading wireless channels. We use the additive Markov channel (AMC) model and multiple access source codes (MASC)