Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282917
Shuhang Wu, Shuangqing Wei, Yue Wang, R. Vaidyanathan, Jian Yuan, Xiqin Wang
In this paper, we propose a novel model to study the efficiency of detecting latent connection relationships, represented by a given set of graphs, among N users. A subset of active nodes transmit following a common codebook over a multiple access Boolean channel. To maximize the error exponent of the structure detection, we formulate an optimization problem whose objective is to max-minimize the pairwise Chernoff information, and the constraint is a probability simplex due to the users' multiple dependency relationships, which are further shown to have close relationship to the internal connectivity of graphs. Case studies are provided to show certain inherent properties of the optimal solution. In addition, we present a particular case with two equally weighted complementary Paley graphs of prime square order, whose optimal solution for the codebook is proved and the resulting exponent is shown to be O(1/N). The case study demonstrates how the fundamental graph discrepancy property affects the solution to the problem.
{"title":"Detection of graph structures via communications over a multiaccess Boolean channel","authors":"Shuhang Wu, Shuangqing Wei, Yue Wang, R. Vaidyanathan, Jian Yuan, Xiqin Wang","doi":"10.1109/ISIT.2015.7282917","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282917","url":null,"abstract":"In this paper, we propose a novel model to study the efficiency of detecting latent connection relationships, represented by a given set of graphs, among N users. A subset of active nodes transmit following a common codebook over a multiple access Boolean channel. To maximize the error exponent of the structure detection, we formulate an optimization problem whose objective is to max-minimize the pairwise Chernoff information, and the constraint is a probability simplex due to the users' multiple dependency relationships, which are further shown to have close relationship to the internal connectivity of graphs. Case studies are provided to show certain inherent properties of the optimal solution. In addition, we present a particular case with two equally weighted complementary Paley graphs of prime square order, whose optimal solution for the codebook is proved and the resulting exponent is shown to be O(1/N). The case study demonstrates how the fundamental graph discrepancy property affects the solution to the problem.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122935338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282799
P. Mukherjee, R. Tandon, S. Ulukus
We consider the two-user multiple-input single-output (MISO) broadcast channel with confidential messages (BCCM), in which the nature of channel state information at the transmitter (CSIT) from each user can be of the form P, D and N, corresponding to perfect and instantaneous, completely delayed, and no CSIT, respectively. We focus on the cases with heterogeneous CSIT from the users, that is, the states PD, PN and DN. The main contribution of this paper is to establish the exact secure degrees of freedom (s.d.o.f.) regions of the MISO BCCM in all of these three heterogeneous states. The results highlight the impact of availability of CSIT on the s.d.o.f. region.
{"title":"Secrecy for MISO broadcast channels with heterogeneous CSIT","authors":"P. Mukherjee, R. Tandon, S. Ulukus","doi":"10.1109/ISIT.2015.7282799","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282799","url":null,"abstract":"We consider the two-user multiple-input single-output (MISO) broadcast channel with confidential messages (BCCM), in which the nature of channel state information at the transmitter (CSIT) from each user can be of the form P, D and N, corresponding to perfect and instantaneous, completely delayed, and no CSIT, respectively. We focus on the cases with heterogeneous CSIT from the users, that is, the states PD, PN and DN. The main contribution of this paper is to establish the exact secure degrees of freedom (s.d.o.f.) regions of the MISO BCCM in all of these three heterogeneous states. The results highlight the impact of availability of CSIT on the s.d.o.f. region.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122495777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282689
Wenbo He, Chen Feng, Corina I. Ionita, B. Nazer
Consider a cellular network composed of several base stations with overlapping coverage areas. Conventional scheduling algorithms ensure that each base station hears only a single user over each orthogonal sub-channel, i.e., collisions are avoided. Recent work on compute-and-forward has demonstrated that it is possible for a receiver to decode a linear combination of interfering codewords. We examine how the adoption of the compute-and-forward technique affects the scheduling problem for cellular networks. Specifically, instead of avoiding collisions, the base stations can schedule collisions to obtain a set of linear combinations that can be solved for the original messages. For the special case of two base stations, we propose a simple scheduling algorithm that finds the minimal number of sub-channels needed for each user to successfully communicate one packet. For the general case, we formulate an integer program that can be solved using dynamic programming with pseudo-polynomial complexity with respect to the number of users.
{"title":"Collision scheduling for cellular networks","authors":"Wenbo He, Chen Feng, Corina I. Ionita, B. Nazer","doi":"10.1109/ISIT.2015.7282689","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282689","url":null,"abstract":"Consider a cellular network composed of several base stations with overlapping coverage areas. Conventional scheduling algorithms ensure that each base station hears only a single user over each orthogonal sub-channel, i.e., collisions are avoided. Recent work on compute-and-forward has demonstrated that it is possible for a receiver to decode a linear combination of interfering codewords. We examine how the adoption of the compute-and-forward technique affects the scheduling problem for cellular networks. Specifically, instead of avoiding collisions, the base stations can schedule collisions to obtain a set of linear combinations that can be solved for the original messages. For the special case of two base stations, we propose a simple scheduling algorithm that finds the minimal number of sub-channels needed for each user to successfully communicate one packet. For the general case, we formulate an integer program that can be solved using dynamic programming with pseudo-polynomial complexity with respect to the number of users.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122898418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282622
S. Sharifi, A. Tanc, T. Duman
In this paper, we explore code optimization for two-user discrete memoryless interference channels (DMICs) wherein the inputs and outputs of the channel are from a finite alphabet. For encoding, we employ irregular low-density parity-check (LDPC) codes combined with non-linear trellis codes (NLTCs) to satisfy the desired distribution of zeros and ones in the transmitted codewords. At the receiver sides, we adopt BCJR algorithm based decoders to compute the symbol-by-symbol log-likelihood ratios (LLRs) of LDPC coded bits to be fed to message passing decoders. As a specific example, we consider the binary-input binary-output Z interference channel (BIBO ZIC) for which the transmitted and received signals are binary and one of the receivers is interference free. For a specific example of a BIBO ZIC, we examine the Han-Kobayashi inner bound on the achievable rate pairs and show that with a simple scheme of sending the messages as private one can achieve the sum-capacity of the channel. We also perform code optimization and demonstrate that the jointly optimized codes outperform the optimal single user codes with time sharing.
{"title":"LDPC code design for binary-input binary-output Z interference channels","authors":"S. Sharifi, A. Tanc, T. Duman","doi":"10.1109/ISIT.2015.7282622","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282622","url":null,"abstract":"In this paper, we explore code optimization for two-user discrete memoryless interference channels (DMICs) wherein the inputs and outputs of the channel are from a finite alphabet. For encoding, we employ irregular low-density parity-check (LDPC) codes combined with non-linear trellis codes (NLTCs) to satisfy the desired distribution of zeros and ones in the transmitted codewords. At the receiver sides, we adopt BCJR algorithm based decoders to compute the symbol-by-symbol log-likelihood ratios (LLRs) of LDPC coded bits to be fed to message passing decoders. As a specific example, we consider the binary-input binary-output Z interference channel (BIBO ZIC) for which the transmitted and received signals are binary and one of the receivers is interference free. For a specific example of a BIBO ZIC, we examine the Han-Kobayashi inner bound on the achievable rate pairs and show that with a simple scheme of sending the messages as private one can achieve the sum-capacity of the channel. We also perform code optimization and demonstrate that the jointly optimized codes outperform the optimal single user codes with time sharing.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123004535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282573
Jiantao Jiao, K. Venkat, Yanjun Han, T. Weissman
The Maximum Likelihood Estimator (MLE) is widely used in estimating information measures, and involves “plugging-in” the empirical distribution of the data to estimate a given functional of the unknown distribution. In this work we propose a general framework and procedure to analyze the nonasymptotic performance of the MLE in estimating functionals of discrete distributions, under the worst-case mean squared error criterion. We show that existing theory is insufficient for analyzing the bias of the MLE, and propose to apply the theory of approximation using positive linear operators to study this bias. The variance is controlled using the well-known tools from the literature on concentration inequalities. Our techniques completely characterize the maximum L2 risk incurred by the MLE in estimating the Shannon entropy H(P) = Σi=1S -piln pi, and Fα(P) = Σi=1Spiα up to a multiplicative constant. As a corollary, for Shannon entropy estimation, we show that it is necessary and sufficient to have n ≪ S observations for the MLE to be consistent, where S represents the support size. In addition, we obtain that it is necessary and sufficient to consider n ≪ S1/α samples for the MLE to consistently estimate Fα(P); 0 <;α <; 1. The minimax rate-optimal estimators for both problems require S/ln S and S1/α / ln S samples, which implies that the MLE is strictly sub-optimal. When 1 <; α <; 3/2, we show that the maximum L2 rate of convergence for the MLE is n-2(α-1) for infinite support size, while the minimax L2 rate is (n ln n)-2(α-1). When α ≥ 3/2, the MLE achieves the minimax optimal L2 convergence rate n-1 regardless of the support size.
{"title":"Maximum Likelihood Estimation of information measures","authors":"Jiantao Jiao, K. Venkat, Yanjun Han, T. Weissman","doi":"10.1109/ISIT.2015.7282573","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282573","url":null,"abstract":"The Maximum Likelihood Estimator (MLE) is widely used in estimating information measures, and involves “plugging-in” the empirical distribution of the data to estimate a given functional of the unknown distribution. In this work we propose a general framework and procedure to analyze the nonasymptotic performance of the MLE in estimating functionals of discrete distributions, under the worst-case mean squared error criterion. We show that existing theory is insufficient for analyzing the bias of the MLE, and propose to apply the theory of approximation using positive linear operators to study this bias. The variance is controlled using the well-known tools from the literature on concentration inequalities. Our techniques completely characterize the maximum L<sub>2</sub> risk incurred by the MLE in estimating the Shannon entropy H(P) = Σ<sub>i=1</sub><sup>S</sup> -p<sub>i</sub>ln p<sub>i</sub>, and F<sub>α</sub>(P) = Σ<sub>i=1</sub><sup>S</sup>p<sub>i</sub><sup>α</sup> up to a multiplicative constant. As a corollary, for Shannon entropy estimation, we show that it is necessary and sufficient to have n ≪ S observations for the MLE to be consistent, where S represents the support size. In addition, we obtain that it is necessary and sufficient to consider n ≪ S<sup>1/α</sup> samples for the MLE to consistently estimate F<sub>α</sub>(P); 0 <;α <; 1. The minimax rate-optimal estimators for both problems require S/ln S and S<sup>1/α</sup> / ln S samples, which implies that the MLE is strictly sub-optimal. When 1 <; α <; 3/2, we show that the maximum L<sub>2</sub> rate of convergence for the MLE is n<sup>-2(α-1)</sup> for infinite support size, while the minimax L<sub>2</sub> rate is (n ln n)<sup>-2(α-1)</sup>. When α ≥ 3/2, the MLE achieves the minimax optimal L<sub>2</sub> convergence rate n<sup>-1</sup> regardless of the support size.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114297006","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282442
P. Charpin, Sihem Mesnager, Sumanta Sarkar
In this paper we study involutions over a finite field of order 2n. We present some classes, several constructions of involutions and we study the set of their fixed points.
本文研究了2n阶有限域上的渐开线。给出了对合圈的若干类、几种构造，并研究了它们不动点的集合。
{"title":"On involutions of finite fields","authors":"P. Charpin, Sihem Mesnager, Sumanta Sarkar","doi":"10.1109/ISIT.2015.7282442","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282442","url":null,"abstract":"In this paper we study involutions over a finite field of order 2n. We present some classes, several constructions of involutions and we study the set of their fixed points.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114392722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282792
Y. M. Chee, Yang Li, Xiande Zhang
Perfect deletion-correcting codes of the same length over the same alphabet can have different sizes. The interesting problem of determining the possible sizes of perfect deletion-correcting codes has previously been studied. In this paper, we study the corresponding problem for burst deletion-correcting codes. We completely determine the spectrum of sizes for perfect burst deletion-correcting codes for certain classes of parameters and also construct new classes of perfect deletion-correcting codes.
{"title":"Spectrum of sizes for perfect burst deletion-correcting codes","authors":"Y. M. Chee, Yang Li, Xiande Zhang","doi":"10.1109/ISIT.2015.7282792","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282792","url":null,"abstract":"Perfect deletion-correcting codes of the same length over the same alphabet can have different sizes. The interesting problem of determining the possible sizes of perfect deletion-correcting codes has previously been studied. In this paper, we study the corresponding problem for burst deletion-correcting codes. We completely determine the spectrum of sizes for perfect burst deletion-correcting codes for certain classes of parameters and also construct new classes of perfect deletion-correcting codes.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"18 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122223001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282803
Shota Saito, Nozomi Miya, T. Matsushima
This paper considers universal lossless variable-length source coding problem and deals with one of the fundamental limits and pointwise asymptotics of the Bayes code for stationary ergodic finite order Markov sources. As investigation of the fundamental limits, we show upper and lower bounds of the minimum rate such that the probability which exceeds it is less than ε ∈ (0, 1). Furthermore, we prove that the codeword length of the Bayes code satisfies the asymptotic normality (pointwise √n asymptotics) and the law of the iterated logarithm (pointwise √n log log n asymptotics), where n represents length of a source sequence and “log” is the natural logarithm.
{"title":"Fundamental limit and pointwise asymptotics of the Bayes code for Markov sources","authors":"Shota Saito, Nozomi Miya, T. Matsushima","doi":"10.1109/ISIT.2015.7282803","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282803","url":null,"abstract":"This paper considers universal lossless variable-length source coding problem and deals with one of the fundamental limits and pointwise asymptotics of the Bayes code for stationary ergodic finite order Markov sources. As investigation of the fundamental limits, we show upper and lower bounds of the minimum rate such that the probability which exceeds it is less than ε ∈ (0, 1). Furthermore, we prove that the codeword length of the Bayes code satisfies the asymptotic normality (pointwise √n asymptotics) and the law of the iterated logarithm (pointwise √n log log n asymptotics), where n represents length of a source sequence and “log” is the natural logarithm.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129757592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282739
Si-Hui Tan, Z. Dutton, R. Nair, S. Guha
The conditions for a quantum measurement to discriminate a set of states with the minimum probability of error were specified by Yuen, Kennedy and Lax, and are often termed the YKL conditions [1]. Since light is quantum mechanical, the ultimate limit on minimum-error discrimination of an optical modulation constellation is determined by the YKL bound. Standard optical receivers (i.e., direct, homodyne or heterodyne detection)-even at their respective ideal operation limits-cannot achieve this performance. Recently, it was shown that a `sequential waveform nulling' (SWN) receiver can, not only discriminate an arbitrary M-ary coherent-state (ideal laser-light) constellation asymptotically at the YKL bound in the high-power limit, but that it achieves a factor of 4 better in the asymptotic error-probability exponent compared with heterodyne detection-the only conventional optical receiver that can in principle be employed for detecting an arbitrary phase-and-amplitude modulated constellation [2]. The SWN receiver can be built with standard optical components; i.e., beamsplitters, local-oscillator lasers, delay loops and single-photon detectors. However on the other hand, in the high power regime, heterodyne detection is known to achieve a reliable communication rate that asymptotically approaches the Holevo capacity of a lossy-noisy optical channel (the ultimate limit to the classical capacity of a quantum channel) [3]. In fact, in the high power regime, heterodyne detection was also shown recently to achieve the optimal second-order coding rate, when using the optimal (Gaussian) input distribution [4]. In this paper, we show that when restricted to the M-ary phase-shift keying (PSK) ensemble, that the SWN receiver's superiority over heterodyne detection in its asymptotic error exponent of the demodulation error probability, translates to a slightly higher capacity and a pronouncedly higher finite blocklength reliable-communication rate. We also quantify, via a numerical calculation, the dependence of the SWN receiver's capacity on the order in which the PSK constellation points are nulled. Our results suggest that for short-latency PSK-modulated optical communication in the high spectral efficiency regime-for which heterodyne detection is the conventional receiver choice-that it may be beneficial to employ the SWN receiver, despite the widely-regarded capacity optimality of heterodyne detection in this operating regime.
{"title":"Finite codelength analysis of the sequential waveform nulling receiver for M-ary PSK","authors":"Si-Hui Tan, Z. Dutton, R. Nair, S. Guha","doi":"10.1109/ISIT.2015.7282739","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282739","url":null,"abstract":"The conditions for a quantum measurement to discriminate a set of states with the minimum probability of error were specified by Yuen, Kennedy and Lax, and are often termed the YKL conditions [1]. Since light is quantum mechanical, the ultimate limit on minimum-error discrimination of an optical modulation constellation is determined by the YKL bound. Standard optical receivers (i.e., direct, homodyne or heterodyne detection)-even at their respective ideal operation limits-cannot achieve this performance. Recently, it was shown that a `sequential waveform nulling' (SWN) receiver can, not only discriminate an arbitrary M-ary coherent-state (ideal laser-light) constellation asymptotically at the YKL bound in the high-power limit, but that it achieves a factor of 4 better in the asymptotic error-probability exponent compared with heterodyne detection-the only conventional optical receiver that can in principle be employed for detecting an arbitrary phase-and-amplitude modulated constellation [2]. The SWN receiver can be built with standard optical components; i.e., beamsplitters, local-oscillator lasers, delay loops and single-photon detectors. However on the other hand, in the high power regime, heterodyne detection is known to achieve a reliable communication rate that asymptotically approaches the Holevo capacity of a lossy-noisy optical channel (the ultimate limit to the classical capacity of a quantum channel) [3]. In fact, in the high power regime, heterodyne detection was also shown recently to achieve the optimal second-order coding rate, when using the optimal (Gaussian) input distribution [4]. In this paper, we show that when restricted to the M-ary phase-shift keying (PSK) ensemble, that the SWN receiver's superiority over heterodyne detection in its asymptotic error exponent of the demodulation error probability, translates to a slightly higher capacity and a pronouncedly higher finite blocklength reliable-communication rate. We also quantify, via a numerical calculation, the dependence of the SWN receiver's capacity on the order in which the PSK constellation points are nulled. Our results suggest that for short-latency PSK-modulated optical communication in the high spectral efficiency regime-for which heterodyne detection is the conventional receiver choice-that it may be beneficial to employ the SWN receiver, despite the widely-regarded capacity optimality of heterodyne detection in this operating regime.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128483225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282798
T. Berger, Mustafa Sungkar
The classic problem for a channel with inputs X, outputs Y, and conditional probability pY |X(y|x) is to find the distribution pX(x) that maximizes Shannon's I(X; Y) subject perhaps to constraints imposed on pX(x). Here, we seek instead, for a specified pX(x), the channel pY|X(y|x) that maximizes I(X; Y) subject to constraints on pY |X(y|x). That is, we investigate the part of joint source-channel coding that matches channels to sources. We assume that pX(x) and pY |X(y|x) are pdfs, eventually relaxing this assumption somewhat. We consider only time-discrete memoryless channels. Our motivation for studying this problem stems from neuroscience. Energy costs therefore must be analyzed and addressed in detail if one hopes to understand how Nature has built neuron “channels” that are so astoundingly energy efficient. However, our general theory is not limited to neuroscience nor limited solely to constraints on energy expenditure.
对于输入X，输出Y，条件概率pY |X(Y |X)的通道，经典问题是找到最大化香农I(X;Y)可能受到pX(x)的约束。这里，对于指定的pX(x)，我们寻求通道pY| x (y|x)使I(x;Y)受pY |X(Y |x)的约束。也就是说，我们研究了将信道与源匹配的联合信源编码部分。我们假设pX(x)和pY |x (y|x)是pdf，最终稍微放松了这个假设。我们只考虑时间离散的无记忆信道。我们研究这个问题的动机源于神经科学。因此，如果人们希望了解大自然如何建立如此惊人的节能神经元“通道”，就必须详细分析和解决能源成本问题。然而，我们的一般理论并不局限于神经科学，也不局限于能量消耗的限制。
{"title":"Design of efficient channels with given input statistics","authors":"T. Berger, Mustafa Sungkar","doi":"10.1109/ISIT.2015.7282798","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282798","url":null,"abstract":"The classic problem for a channel with inputs X, outputs Y, and conditional probability pY |X(y|x) is to find the distribution pX(x) that maximizes Shannon's I(X; Y) subject perhaps to constraints imposed on pX(x). Here, we seek instead, for a specified pX(x), the channel pY|X(y|x) that maximizes I(X; Y) subject to constraints on pY |X(y|x). That is, we investigate the part of joint source-channel coding that matches channels to sources. We assume that pX(x) and pY |X(y|x) are pdfs, eventually relaxing this assumption somewhat. We consider only time-discrete memoryless channels. Our motivation for studying this problem stems from neuroscience. Energy costs therefore must be analyzed and addressed in detail if one hopes to understand how Nature has built neuron “channels” that are so astoundingly energy efficient. However, our general theory is not limited to neuroscience nor limited solely to constraints on energy expenditure.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124763095","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：