加性马尔可夫信道上相关马尔可夫信源的最优信道解码器

2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI:10.1109/DCC.2007.64

M. A. Haleem, K.P. Subbalakshmi

{"title":"加性马尔可夫信道上相关马尔可夫信源的最优信道解码器","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":"{\"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}","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

摘要

在本文中，我们提出了一种最优的联合信源信道解码器(JSCD)，用于两个相互相关的信源，每个信源都具有可由一阶马尔可夫过程表示的存储器，并且通过存储器表示慢衰落无线信道的信道传输。我们使用加性马尔可夫信道(AMC)模型和多址源代码(MASC)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Optimal Source-Channel Decoder for Correlated Markov Sources over Additive Markov Channels

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)

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 Data Compression Conference (DCC'07)

自引率

0.00%

发文量