Harikumar Krishnamurthy, Parikshit Hegde, A. Thangaraj
{"title":"Conditions for Optimality of Superposition Coding in Discrete Memoryless Broadcast Channels","authors":"Harikumar Krishnamurthy, Parikshit Hegde, A. Thangaraj","doi":"10.1109/NCC.2019.8732209","DOIUrl":null,"url":null,"abstract":"The capacity region of general discrete-memoryless broadcast channels (DMBCs) with two receivers is an open problem of considerable research interest. The optimality of superposition coding in three specific cases of the DMBC is considered. For a DMBC with binary input, symmetric output and output cardinality at most 3, superposition coding is shown to be optimal. For equal-capacity DMBCs with any input cardinality, superposition coding is shown to be suboptimal if each channel has a capacity-achieving input distribution that is not capacity-achieving for the other channel. For an equal-capacity DMBC with binary input, superposition coding is shown to be optimal if and only if the two channels are more-capable comparable even without utput symmetry. These results improve upon the previously known conditions for optimality of superposition coding in DMBCs.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"108 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2019.8732209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The capacity region of general discrete-memoryless broadcast channels (DMBCs) with two receivers is an open problem of considerable research interest. The optimality of superposition coding in three specific cases of the DMBC is considered. For a DMBC with binary input, symmetric output and output cardinality at most 3, superposition coding is shown to be optimal. For equal-capacity DMBCs with any input cardinality, superposition coding is shown to be suboptimal if each channel has a capacity-achieving input distribution that is not capacity-achieving for the other channel. For an equal-capacity DMBC with binary input, superposition coding is shown to be optimal if and only if the two channels are more-capable comparable even without utput symmetry. These results improve upon the previously known conditions for optimality of superposition coding in DMBCs.