Pub Date : 2016-08-11DOI: 10.1109/ISIT.2016.7541801
Subhajit Majhi, P. Mitran
We consider a two-transmitter two-receiver dual-band Gaussian interference channel (GIC) which is motivated by the simultaneous use of both the conventional microwave band and the unconventional millimeter wave (mm-wave) band in future wireless networks where the traditional microwave band is complemented by additional spectrum in the mm-wave band. A key modeling feature of the mm-wave band is that due to severe path loss and relatively small wavelength, it must be used with highly directional antennas, and thus the transmitter is able to transmit to its intended receiver with negligible to no interference to other receivers. For this model, we derive some sufficient conditions on the channel gains under which the capacity of this type of dual-band GIC is determined. Specifically, these conditions are classified as when microwave band channel gains have (a) weak interference, i.e., both the cross channel gains are less than 1 and (b) mixed interference, i.e., only one of the cross channel gains is less than 1, while the channel gains in the dual-band GIC satisfy certain additional conditions in each case.
{"title":"On the capacity of a class of dual-band interference channels","authors":"Subhajit Majhi, P. Mitran","doi":"10.1109/ISIT.2016.7541801","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541801","url":null,"abstract":"We consider a two-transmitter two-receiver dual-band Gaussian interference channel (GIC) which is motivated by the simultaneous use of both the conventional microwave band and the unconventional millimeter wave (mm-wave) band in future wireless networks where the traditional microwave band is complemented by additional spectrum in the mm-wave band. A key modeling feature of the mm-wave band is that due to severe path loss and relatively small wavelength, it must be used with highly directional antennas, and thus the transmitter is able to transmit to its intended receiver with negligible to no interference to other receivers. For this model, we derive some sufficient conditions on the channel gains under which the capacity of this type of dual-band GIC is determined. Specifically, these conditions are classified as when microwave band channel gains have (a) weak interference, i.e., both the cross channel gains are less than 1 and (b) mixed interference, i.e., only one of the cross channel gains is less than 1, while the channel gains in the dual-band GIC satisfy certain additional conditions in each case.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115991370","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 : 2016-08-11DOI: 10.1109/ISIT.2016.7541865
R. Schaefer, H. Boche, H. Poor
The question of additivity of the capacity of a channel goes back to Shannon who asked this for the zero error capacity function. Despite the common sense that the capacity is usually additive, there is surprisingly little known for non-trivial channels. This paper addresses this question for the arbitrarily varying wiretap channel (AVWC) which models secure communication in the presence of arbitrarily varying channel (AVC) conditions. For orthogonal AVWCs it has been shown that the non-additivity phenomenon of super-activation occurs; that is, there are orthogonal AVWCs, each having zero secrecy capacity, which allow for transmission with positive secrecy rate if they are used together. It is shown that for such orthogonal AVWCs super-activation is generic in the sense that whenever super-activation is possible, it is possible for all AVWCs in a certain neighborhood as well. Moreover, it is shown that the issue of super-activation and the continuity of the secrecy capacity solely depend on the legitimate link. Accordingly, the single-user AVC is studied and it is shown that in this case, super-activation for non-secure message transmission is not possible, making it a unique feature of secure communication over AVWCs. However, the capacity for message transmission of the single-user AVC is shown to be super-additive including a complete characterization.
{"title":"Super-activation as a unique feature of arbitrarily varying wiretap channels","authors":"R. Schaefer, H. Boche, H. Poor","doi":"10.1109/ISIT.2016.7541865","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541865","url":null,"abstract":"The question of additivity of the capacity of a channel goes back to Shannon who asked this for the zero error capacity function. Despite the common sense that the capacity is usually additive, there is surprisingly little known for non-trivial channels. This paper addresses this question for the arbitrarily varying wiretap channel (AVWC) which models secure communication in the presence of arbitrarily varying channel (AVC) conditions. For orthogonal AVWCs it has been shown that the non-additivity phenomenon of super-activation occurs; that is, there are orthogonal AVWCs, each having zero secrecy capacity, which allow for transmission with positive secrecy rate if they are used together. It is shown that for such orthogonal AVWCs super-activation is generic in the sense that whenever super-activation is possible, it is possible for all AVWCs in a certain neighborhood as well. Moreover, it is shown that the issue of super-activation and the continuity of the secrecy capacity solely depend on the legitimate link. Accordingly, the single-user AVC is studied and it is shown that in this case, super-activation for non-secure message transmission is not possible, making it a unique feature of secure communication over AVWCs. However, the capacity for message transmission of the single-user AVC is shown to be super-additive including a complete characterization.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124029975","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 : 2016-08-11DOI: 10.1109/ISIT.2016.7541785
Anit Kumar Sahu, S. Kar
This paper focuses on the problem of distributed composite hypothesis testing in a noisy network of sparsely interconnected agents in which a pair of agents exchange information over an additive noise channel. The network objective is to test a simple null hypothesis against a composite alternative concerning the state of the field, modeled as a vector of (continuous) unknown parameters determining the parametric family of probability measures induced on the agents' observation spaces under the hypotheses. A recursive generalized likelihood ratio test (GLRT) type algorithm in a distributed setup of the consensus+innovations form is proposed, in which the agents update their parameter estimates and decision statistics by simultaneously processing the latest sensed information (innovations) and information obtained from neighboring agents (consensus). This paper characterizes the conditions and the testing algorithm design parameters which ensure that the probabilities of decision errors decay to zero asymptotically in the large sample limit.
{"title":"Distributed recursive composite hypothesis testing: Imperfect communication","authors":"Anit Kumar Sahu, S. Kar","doi":"10.1109/ISIT.2016.7541785","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541785","url":null,"abstract":"This paper focuses on the problem of distributed composite hypothesis testing in a noisy network of sparsely interconnected agents in which a pair of agents exchange information over an additive noise channel. The network objective is to test a simple null hypothesis against a composite alternative concerning the state of the field, modeled as a vector of (continuous) unknown parameters determining the parametric family of probability measures induced on the agents' observation spaces under the hypotheses. A recursive generalized likelihood ratio test (GLRT) type algorithm in a distributed setup of the consensus+innovations form is proposed, in which the agents update their parameter estimates and decision statistics by simultaneously processing the latest sensed information (innovations) and information obtained from neighboring agents (consensus). This paper characterizes the conditions and the testing algorithm design parameters which ensure that the probabilities of decision errors decay to zero asymptotically in the large sample limit.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121584629","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 : 2016-08-11DOI: 10.1109/ISIT.2016.7541803
Gozde Ozcan, Mustafa Ozmen, M. C. Gursoy
This paper proposes optimal power adaptation schemes that maximize the energy efficiency (EE) in the presence of Markovian sources and finite-alphabet inputs subject to quality of service (QoS) constraints. First, maximum average arrival rates supported by transmitting signals with arbitrary input distributions are characterized in closed-form by employing the effective bandwidth of time-varying sources (e.g., discrete-time Markov and Markov fluid sources) and effective capacity of the time-varying wireless channel. Subsequently, EE is defined as the ratio of the maximum average arrival rate to the total power consumption, in which circuit power is also taken into account. Following these characterizations, an optimization problem is formulated to maximize the EE of the system, and optimal power control schemes are determined. Through numerical results, the performance of the optimal power control policies is evaluated for different signal constellations and is also compared with that of constant power transmission. The impact of QoS constraints, source characteristics, input distributions on the maximum achievable EE and the throughput is analyzed.
{"title":"QoS-driven energy-efficient power control with Markov arrivals and finite-alphabet inputs","authors":"Gozde Ozcan, Mustafa Ozmen, M. C. Gursoy","doi":"10.1109/ISIT.2016.7541803","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541803","url":null,"abstract":"This paper proposes optimal power adaptation schemes that maximize the energy efficiency (EE) in the presence of Markovian sources and finite-alphabet inputs subject to quality of service (QoS) constraints. First, maximum average arrival rates supported by transmitting signals with arbitrary input distributions are characterized in closed-form by employing the effective bandwidth of time-varying sources (e.g., discrete-time Markov and Markov fluid sources) and effective capacity of the time-varying wireless channel. Subsequently, EE is defined as the ratio of the maximum average arrival rate to the total power consumption, in which circuit power is also taken into account. Following these characterizations, an optimization problem is formulated to maximize the EE of the system, and optimal power control schemes are determined. Through numerical results, the performance of the optimal power control policies is evaluated for different signal constellations and is also compared with that of constant power transmission. The impact of QoS constraints, source characteristics, input distributions on the maximum achievable EE and the throughput is analyzed.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133196527","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 : 2016-08-11DOI: 10.1109/ISIT.2016.7541624
Malcolm Egan, Mauro L. de Freitas, L. Clavier, A. Goupil, G. Peters, Nourddine Azzaoui
Impulsive noise arises in many communication systems - ranging from wireless to molecular - and is often modeled via the α-stable distribution. In this paper, we investigate properties of the capacity of complex isotropic α-stable noise channels, which can arise in the context of wireless cellular communications and are not well understood at present. In particular, we derive a tractable lower bound, as well as prove existence and uniqueness of the optimal input distribution. We then apply our lower bound to study the case of parallel α-stable noise channels and derive a bound that provides insight into the effect of the tail index α on the achievable rate.
{"title":"Achievable rates for additive isotropic α-stable noise channels","authors":"Malcolm Egan, Mauro L. de Freitas, L. Clavier, A. Goupil, G. Peters, Nourddine Azzaoui","doi":"10.1109/ISIT.2016.7541624","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541624","url":null,"abstract":"Impulsive noise arises in many communication systems - ranging from wireless to molecular - and is often modeled via the α-stable distribution. In this paper, we investigate properties of the capacity of complex isotropic α-stable noise channels, which can arise in the context of wireless cellular communications and are not well understood at present. In particular, we derive a tractable lower bound, as well as prove existence and uniqueness of the optimal input distribution. We then apply our lower bound to study the case of parallel α-stable noise channels and derive a bound that provides insight into the effect of the tail index α on the achievable rate.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"63 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123252009","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 : 2016-08-11DOI: 10.1109/ISIT.2016.7541684
Khalil Elkhalil, A. Kammoun, T. Al-Naffouri, Mohamed-Slim Alouini
In this paper, we derive a closed-form expression for the inverse moments of one sided-correlated random Gram matrices. Such a question is mainly motivated by applications in signal processing and wireless communications for which evaluating this quantity is a question of major interest. This is for instance the case of the best linear unbiased estimator, in which the average estimation error corresponds to the first inverse moment of a random Gram matrix.
{"title":"Exact closed-form expression for the inverse moments of one-sided correlated Gram matrices","authors":"Khalil Elkhalil, A. Kammoun, T. Al-Naffouri, Mohamed-Slim Alouini","doi":"10.1109/ISIT.2016.7541684","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541684","url":null,"abstract":"In this paper, we derive a closed-form expression for the inverse moments of one sided-correlated random Gram matrices. Such a question is mainly motivated by applications in signal processing and wireless communications for which evaluating this quantity is a question of major interest. This is for instance the case of the best linear unbiased estimator, in which the average estimation error corresponds to the first inverse moment of a random Gram matrix.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121867844","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 : 2016-08-11DOI: 10.1109/ISIT.2016.7541550
Nuwan S. Ferdinand, M. Nokleby, B. Aazhang
This paper proposes a low-complexity scheme to construct Voronoi constellations for the shaping of high-dimensional lattice codes. The Voronoi region of a low-dimensional lattice is used as a prototype for the shaping region for a high-dimensional lattice codebook. The proposed scheme retains the shaping and coding gains of the respective lattices. Further, the proposed scheme provides a general approach for shaping popular high-dimensional lattices, including LDA lattices, for which no practical shaping algorithm exists to our knowledge. Finally, the proposed scheme preserves the algebraic properties of nested lattice codes, making it suitable for compute-and-forward applications. Using E8 and BW16 as prototype shaping lattices, we numerically show that the proposed scheme results in 0:65 dB and 0:86 dB shaping gains.
{"title":"Voronoi constellations for high-dimensional lattice codes","authors":"Nuwan S. Ferdinand, M. Nokleby, B. Aazhang","doi":"10.1109/ISIT.2016.7541550","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541550","url":null,"abstract":"This paper proposes a low-complexity scheme to construct Voronoi constellations for the shaping of high-dimensional lattice codes. The Voronoi region of a low-dimensional lattice is used as a prototype for the shaping region for a high-dimensional lattice codebook. The proposed scheme retains the shaping and coding gains of the respective lattices. Further, the proposed scheme provides a general approach for shaping popular high-dimensional lattices, including LDA lattices, for which no practical shaping algorithm exists to our knowledge. Finally, the proposed scheme preserves the algebraic properties of nested lattice codes, making it suitable for compute-and-forward applications. Using E8 and BW16 as prototype shaping lattices, we numerically show that the proposed scheme results in 0:65 dB and 0:86 dB shaping gains.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125349784","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 : 2016-08-11DOI: 10.1109/ISIT.2016.7541544
P. Mukherjee, S. Ulukus
We present a real interference alignment technique for multiple-input multiple-output (MIMO) networks. This technique is based on a theorem due to Dirichlet and Khintchine for simultaneous Diophantine approximation and uses the outputs of all the antennas at the receiver simultaneously for decoding, instead of using them in an antenna-by-antenna basis. This allows us to forgo asymptotic real interference alignment for several multi-user scenarios such as the two-user MIMO interference channel with confidential messages and the two-user MIMO multiple access wiretap channel.
{"title":"Real interference alignment for vector channels","authors":"P. Mukherjee, S. Ulukus","doi":"10.1109/ISIT.2016.7541544","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541544","url":null,"abstract":"We present a real interference alignment technique for multiple-input multiple-output (MIMO) networks. This technique is based on a theorem due to Dirichlet and Khintchine for simultaneous Diophantine approximation and uses the outputs of all the antennas at the receiver simultaneously for decoding, instead of using them in an antenna-by-antenna basis. This allows us to forgo asymptotic real interference alignment for several multi-user scenarios such as the two-user MIMO interference channel with confidential messages and the two-user MIMO multiple access wiretap channel.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125524386","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 : 2016-08-11DOI: 10.1109/ISIT.2016.7541756
A. K. Pradhan, A. Thangaraj
Protograph doubly-generalized low-density parity-check (DGLDPC) codes, which allow for arbitrary component codes at the variable and check nodes of a protograph, are considered. Exact density evolution is derived over the binary erasure channel. Conditions on the protograph and component codes to ensure equality of block-error threshold and density evolution threshold for large-girth ensembles are established. Conditions for stability of density evolution are derived, and block-error threshold property is extended to binary-input symmetric channels. Optimized low-rate protographs for DGLDPC codes over the erasure channel are presented.
{"title":"Near-capacity protograph doubly-generalized LDPC codes with block thresholds","authors":"A. K. Pradhan, A. Thangaraj","doi":"10.1109/ISIT.2016.7541756","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541756","url":null,"abstract":"Protograph doubly-generalized low-density parity-check (DGLDPC) codes, which allow for arbitrary component codes at the variable and check nodes of a protograph, are considered. Exact density evolution is derived over the binary erasure channel. Conditions on the protograph and component codes to ensure equality of block-error threshold and density evolution threshold for large-girth ensembles are established. Conditions for stability of density evolution are derived, and block-error threshold property is extended to binary-input symmetric channels. Optimized low-rate protographs for DGLDPC codes over the erasure channel are presented.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115497560","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 : 2016-08-11DOI: 10.1109/ISIT.2016.7541814
Y. M. Chee, H. M. Kiah, S. Ling, T. T. Nguyen, Van Khu Vu, Xiande Zhang
We construct codes for the Chebyshev permutation channels whose study was initiated by Langberg et al. (2015). We establish several recursive code constructions and present efficient decoding algorithms for our codes. In particular, our constructions yield a family of binary codes of rate 0.643 when r = 1. The upper bound on the rate in this case is 2/3 and the previous highest rate is 0.609.
{"title":"String concatenation construction for Chebyshev permutation channel codes","authors":"Y. M. Chee, H. M. Kiah, S. Ling, T. T. Nguyen, Van Khu Vu, Xiande Zhang","doi":"10.1109/ISIT.2016.7541814","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541814","url":null,"abstract":"We construct codes for the Chebyshev permutation channels whose study was initiated by Langberg et al. (2015). We establish several recursive code constructions and present efficient decoding algorithms for our codes. In particular, our constructions yield a family of binary codes of rate 0.643 when r = 1. The upper bound on the rate in this case is 2/3 and the previous highest rate is 0.609.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":" 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113950989","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
扫码关注我们
求助内容：
应助结果提醒方式：