{"title":"半双工协作通信的联合典型性分析","authors":"Ahmad Abu Al Haija, M. Vu","doi":"10.1109/CWIT.2011.5872137","DOIUrl":null,"url":null,"abstract":"We propose a half-duplex cooperative scheme for a discrete memoryless channel (DMC) consisting of two users communicating with one destination. The half-duplex constraint is satisfied by performing the communication over 3 time slots with variable durations in each code block. Each user alternatively transmits and receives during the first 2 time slots, then both of them transmit during the last one. Different from [1], here we use joint typicality instead of maximum likelihood (ML) decoding to derive the rate region. The main contribution is in the joint decoding and proof techniques that concurrently combine code segments of different lengths.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Joint typicality analysis for half-duplex cooperative communication\",\"authors\":\"Ahmad Abu Al Haija, M. Vu\",\"doi\":\"10.1109/CWIT.2011.5872137\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a half-duplex cooperative scheme for a discrete memoryless channel (DMC) consisting of two users communicating with one destination. The half-duplex constraint is satisfied by performing the communication over 3 time slots with variable durations in each code block. Each user alternatively transmits and receives during the first 2 time slots, then both of them transmit during the last one. Different from [1], here we use joint typicality instead of maximum likelihood (ML) decoding to derive the rate region. The main contribution is in the joint decoding and proof techniques that concurrently combine code segments of different lengths.\",\"PeriodicalId\":250626,\"journal\":{\"name\":\"2011 12th Canadian Workshop on Information Theory\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 12th Canadian Workshop on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CWIT.2011.5872137\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 12th Canadian Workshop on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CWIT.2011.5872137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Joint typicality analysis for half-duplex cooperative communication
We propose a half-duplex cooperative scheme for a discrete memoryless channel (DMC) consisting of two users communicating with one destination. The half-duplex constraint is satisfied by performing the communication over 3 time slots with variable durations in each code block. Each user alternatively transmits and receives during the first 2 time slots, then both of them transmit during the last one. Different from [1], here we use joint typicality instead of maximum likelihood (ML) decoding to derive the rate region. The main contribution is in the joint decoding and proof techniques that concurrently combine code segments of different lengths.