Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282892
M. Bande, A. E. Gamal, V. Veeravalli
We propose a novel interference management framework for the cellular downlink through cooperative transmission. A sectored cellular network is studied where the interference is only due to sectors in neighboring cells and intra cell interference is ignored. We first explore the potential degrees of freedom (DoF) gain in a scenario where mobile receivers can be associated to any neighboring cell but no cooperative transmission is allowed. We show that the maximum achievable per user DoF for orthogonal schemes is between 1/3 and 3/7. On the other hand, if cooperative transmission is combined with flexible message assignment to the transmitters, we show that it is possible to achieve a per user DoF of 7/15. In addition, the proposed cooperative transmission scheme does not require extra backhaul capacity, as it uses a smart assignment of messages to transmitters to meet an average backhaul load constraint of one message per transmitter.
{"title":"Flexible backhaul design with cooperative transmission in cellular interference networks","authors":"M. Bande, A. E. Gamal, V. Veeravalli","doi":"10.1109/ISIT.2015.7282892","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282892","url":null,"abstract":"We propose a novel interference management framework for the cellular downlink through cooperative transmission. A sectored cellular network is studied where the interference is only due to sectors in neighboring cells and intra cell interference is ignored. We first explore the potential degrees of freedom (DoF) gain in a scenario where mobile receivers can be associated to any neighboring cell but no cooperative transmission is allowed. We show that the maximum achievable per user DoF for orthogonal schemes is between 1/3 and 3/7. On the other hand, if cooperative transmission is combined with flexible message assignment to the transmitters, we show that it is possible to achieve a per user DoF of 7/15. In addition, the proposed cooperative transmission scheme does not require extra backhaul capacity, as it uses a smart assignment of messages to transmitters to meet an average backhaul load constraint of one message per transmitter.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"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":"127949016","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.7282513
Xiaochen Zhao, Wei Dai
This work is motivated by a distributed compressed sensing (DCS) scenario where multiple sensors independently perform compressed sensing and the sparse signals share a common support. The heterogeneous case is considered where the numbers of measurements and the noise levels at different sensors may be different. To analyse the performance, we focus on a probability model for sparse signals and use the state evolution tool developed for the approximate message passing (AMP) technique. In the noise free case, we are able to quantify the asymptotic rate region for exact recovery. The rate region has a shape that is significantly different from that by information theoretic analysis and provides a guidance for resource allocation in practice. It shows that an equal allocation of the number of measurements across sensors is strictly suboptimal. Finally, we also study the effect of the correlation among nonzero components from different sparse signals, which appears in many practical scenarios.
{"title":"On joint recovery of sparse signals with common supports","authors":"Xiaochen Zhao, Wei Dai","doi":"10.1109/ISIT.2015.7282513","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282513","url":null,"abstract":"This work is motivated by a distributed compressed sensing (DCS) scenario where multiple sensors independently perform compressed sensing and the sparse signals share a common support. The heterogeneous case is considered where the numbers of measurements and the noise levels at different sensors may be different. To analyse the performance, we focus on a probability model for sparse signals and use the state evolution tool developed for the approximate message passing (AMP) technique. In the noise free case, we are able to quantify the asymptotic rate region for exact recovery. The rate region has a shape that is significantly different from that by information theoretic analysis and provides a guidance for resource allocation in practice. It shows that an equal allocation of the number of measurements across sensors is strictly suboptimal. Finally, we also study the effect of the correlation among nonzero components from different sparse signals, which appears in many practical scenarios.","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":"130119859","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.7282979
Nan Liu, Wei Kang
In this paper, we study the multiple access diamond channel, where each relay has cached a part of the message intended for the destination node. It is assumed that the cached information at the two relays are independent. We propose an achievability scheme and show that the scheme of sending correlated codewords through the multiple access channel with the superposition structure proposed for the multiple access diamond channel can be easily adapted to the case where there are cached information at the relays. We further show the optimality of our proposed scheme when the channel satisfies certain conditions. Under these conditions, it is suboptimal for the source node to inform each relay the cached message of the other relay to form common data, rather it is optimal to have no common data and use the cached message at each relay to form the correlated codewords.
{"title":"The multiple access diamond channel with caching relays","authors":"Nan Liu, Wei Kang","doi":"10.1109/ISIT.2015.7282979","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282979","url":null,"abstract":"In this paper, we study the multiple access diamond channel, where each relay has cached a part of the message intended for the destination node. It is assumed that the cached information at the two relays are independent. We propose an achievability scheme and show that the scheme of sending correlated codewords through the multiple access channel with the superposition structure proposed for the multiple access diamond channel can be easily adapted to the case where there are cached information at the relays. We further show the optimality of our proposed scheme when the channel satisfies certain conditions. Under these conditions, it is suboptimal for the source node to inform each relay the cached message of the other relay to form common data, rather it is optimal to have no common data and use the cached message at each relay to form the correlated codewords.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"83 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":"130258339","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.7282683
Jhelum Chakravorty, Aditya Mahajan
The problem of optimal real-time transmission of a Gauss-Markov source under constraints on the expected number of transmissions is considered. This setup is motivated by applications where transmission is sporadic and the cost of switching on the radio and transmitting is significantly more important than the size of the transmitted data packet. The structure of optimal transmission and estimation strategies had been established in the literature. We use these structural results to determine the distortion-transmission function, i.e., the minimum expected distortion that can be achieved when the expected number of transmissions is less than or equal to a particular value. We characterize how the distortion-transmission function scales with the variance of the source and show that it can be computed numerically by solving two Fredholm integral equations of the second kind.
{"title":"Distortion-transmission trade-off in real-time transmission of Gauss-Markov sources","authors":"Jhelum Chakravorty, Aditya Mahajan","doi":"10.1109/ISIT.2015.7282683","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282683","url":null,"abstract":"The problem of optimal real-time transmission of a Gauss-Markov source under constraints on the expected number of transmissions is considered. This setup is motivated by applications where transmission is sporadic and the cost of switching on the radio and transmitting is significantly more important than the size of the transmitted data packet. The structure of optimal transmission and estimation strategies had been established in the literature. We use these structural results to determine the distortion-transmission function, i.e., the minimum expected distortion that can be achieved when the expected number of transmissions is less than or equal to a particular value. We characterize how the distortion-transmission function scales with the variance of the source and show that it can be computed numerically by solving two Fredholm integral equations of the second kind.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"61 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":"127582452","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.7282780
Pengfei Huang, Eitan Yaakobi, H. Uchikawa, P. Siegel
In this work, we present a new upper bound on the minimum distance d of linear locally repairable codes (LRCs) with information locality and availability. The bound takes into account the code length n, dimension k, locality r, availability t, and field size q. We use tensor product codes to construct several families of LRCs with information locality, and then we extend the construction to design LRCs with information locality and availability. Some of these codes are shown to be optimal with respect to their minimum distance, achieving the new bound. Finally, we study the all-symbol locality and availability properties of several classes of one-step majority-logic decodable codes, including cyclic simplex codes, cyclic difference-set codes, and 4-cycle free regular low-density parity-check (LDPC) codes. We also investigate their optimality using the new bound.
{"title":"Linear locally repairable codes with availability","authors":"Pengfei Huang, Eitan Yaakobi, H. Uchikawa, P. Siegel","doi":"10.1109/ISIT.2015.7282780","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282780","url":null,"abstract":"In this work, we present a new upper bound on the minimum distance d of linear locally repairable codes (LRCs) with information locality and availability. The bound takes into account the code length n, dimension k, locality r, availability t, and field size q. We use tensor product codes to construct several families of LRCs with information locality, and then we extend the construction to design LRCs with information locality and availability. Some of these codes are shown to be optimal with respect to their minimum distance, achieving the new bound. Finally, we study the all-symbol locality and availability properties of several classes of one-step majority-logic decodable codes, including cyclic simplex codes, cyclic difference-set codes, and 4-cycle free regular low-density parity-check (LDPC) codes. We also investigate their optimality using the new bound.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"9 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":"130864010","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.7282474
N. B. Rached, A. Kammoun, Mohamed-Slim Alouini, R. Tempone
The outage capacity (OC) is among the most important performance metrics of communication systems over fading channels. The evaluation of the OC, when Equal Gain Combining (EGC) or Maximum Ratio Combining (MRC) diversity techniques are employed, boils down to computing the Cumulative Distribution Function (CDF) of the sum of channel envelopes (equivalently amplitudes) for EGC or channel gain (equivalently squared enveloped/amplitudes) for MRC. Closed-form expressions of the CDF of the sum of many generalized fading variates are generally unknown and constitute open problems. In this paper, we develop a unified hazard rate twisting Importance Sampling (IS) based approach to efficiently estimate the CDF of the sum of independent arbitrary variates. The proposed IS estimator is shown to achieve an asymptotic optimality criterion, which clearly guarantees its efficiency. Some selected simulation results are also shown to illustrate the substantial computational gain achieved by the proposed IS scheme over crude Monte-Carlo simulations.
{"title":"A unified simulation approach for the fast outage capacity evaluation over generalized fading channels","authors":"N. B. Rached, A. Kammoun, Mohamed-Slim Alouini, R. Tempone","doi":"10.1109/ISIT.2015.7282474","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282474","url":null,"abstract":"The outage capacity (OC) is among the most important performance metrics of communication systems over fading channels. The evaluation of the OC, when Equal Gain Combining (EGC) or Maximum Ratio Combining (MRC) diversity techniques are employed, boils down to computing the Cumulative Distribution Function (CDF) of the sum of channel envelopes (equivalently amplitudes) for EGC or channel gain (equivalently squared enveloped/amplitudes) for MRC. Closed-form expressions of the CDF of the sum of many generalized fading variates are generally unknown and constitute open problems. In this paper, we develop a unified hazard rate twisting Importance Sampling (IS) based approach to efficiently estimate the CDF of the sum of independent arbitrary variates. The proposed IS estimator is shown to achieve an asymptotic optimality criterion, which clearly guarantees its efficiency. Some selected simulation results are also shown to illustrate the substantial computational gain achieved by the proposed IS scheme over crude Monte-Carlo simulations.","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":"131000255","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.7282971
J. Jose, Chong Li, Xinzhou Wu, Lei Ying, Kai Zhu
The focus of this paper is on rate and power control algorithms in DSRC. We first design a utility maximization framework by leveraging the well-developed network congestion control, and formulate two subproblems, one on rate control with fixed transmit powers and the other on power control with fixed rates. Distributed rate control and power control algorithms are developed to solve these two subproblems, respectively, and are proved to be asymptotically optimal. Joint rate and power control can be done by using the two algorithms in an alternating fashion. The performance enhancement of our algorithms compared with a recent rate control algorithm, called EMBARC [1], is evaluated by using the network simulator ns2.
{"title":"Distributed rate and power control in DSRC","authors":"J. Jose, Chong Li, Xinzhou Wu, Lei Ying, Kai Zhu","doi":"10.1109/ISIT.2015.7282971","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282971","url":null,"abstract":"The focus of this paper is on rate and power control algorithms in DSRC. We first design a utility maximization framework by leveraging the well-developed network congestion control, and formulate two subproblems, one on rate control with fixed transmit powers and the other on power control with fixed rates. Distributed rate control and power control algorithms are developed to solve these two subproblems, respectively, and are proved to be asymptotically optimal. Joint rate and power control can be done by using the two algorithms in an alternating fashion. The performance enhancement of our algorithms compared with a recent rate control algorithm, called EMBARC [1], is evaluated by using the network simulator ns2.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"62 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":"131205413","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.7282455
T. Mittelholzer, Thomas Parnell, N. Papandreou, H. Pozidis
Recently, a new type of product-like codes, known as half-product codes, have been studied for OTN applications. Motivated by these codes, new classes of symmetry-invariant subproduct codes are proposed and investigated under iterative hard-decision decoding. A subset of the new class of quarter product codes has lower error floors than comparable half-product codes in terms of length, rate and performance.
{"title":"Symmetry-based subproduct codes","authors":"T. Mittelholzer, Thomas Parnell, N. Papandreou, H. Pozidis","doi":"10.1109/ISIT.2015.7282455","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282455","url":null,"abstract":"Recently, a new type of product-like codes, known as half-product codes, have been studied for OTN applications. Motivated by these codes, new classes of symmetry-invariant subproduct codes are proposed and investigated under iterative hard-decision decoding. A subset of the new class of quarter product codes has lower error floors than comparable half-product codes in terms of length, rate and performance.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"27 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132830747","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.7282633
Rajeev Gangula, Deniz Gündüz, D. Gesbert
We determine the achievable distortion region when the correlated source samples are transmitted by two energy harvesting (EH) sensor nodes to the destination over orthogonal fading channels. A time slotted system is considered in which the energy and the source samples arrive at the beginning of each time slot (TS), and both the correlation between source samples at the two nodes and fading coefficients change over time but remain constant in each TS. Assuming non-causal knowledge of these time-varying source statistics, energy arrivals and the channel gains, i.e., under the offline optimization framework, we obtain the optimal transmission and coding schemes that achieve the points on the Pareto boundary of the total distortion region. An iterative directional 2D waterfilling algorithm is proposed to obtain two specific points on this boundary.
{"title":"Distributed compression and transmission with energy harvesting sensors","authors":"Rajeev Gangula, Deniz Gündüz, D. Gesbert","doi":"10.1109/ISIT.2015.7282633","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282633","url":null,"abstract":"We determine the achievable distortion region when the correlated source samples are transmitted by two energy harvesting (EH) sensor nodes to the destination over orthogonal fading channels. A time slotted system is considered in which the energy and the source samples arrive at the beginning of each time slot (TS), and both the correlation between source samples at the two nodes and fading coefficients change over time but remain constant in each TS. Assuming non-causal knowledge of these time-varying source statistics, energy arrivals and the channel gains, i.e., under the offline optimization framework, we obtain the optimal transmission and coding schemes that achieve the points on the Pareto boundary of the total distortion region. An iterative directional 2D waterfilling algorithm is proposed to obtain two specific points on this boundary.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"127 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":"132092099","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.7282940
A. Emran, M. Elsabrouty, O. Muta, H. Furukawa
In this paper, we apply an efficient scaling strategy on layered scaled min-sum LDPC decoder. In addition, we propose a joint optimization strategy for the quantization and scaling parameters of layered scaled min-sum LDPC decoder. The study of our optimization results, for DVB-S2 LDPC codes with different constellation sizes and code rates, shows that each constellation size code rate pair has different optimal scaling and quantization parameters. In order to maximize the achievable performance, we propose using the different scaling and quantization parameters for each constellation size code rate pair. The simulation results show the performance improvement of separately using optimal scaling parameters or optimal quantization parameters, and the overall performance enhancement of using both optimal scaling and quantization parameters.
{"title":"Optimized quantization and scaling of layered LDPC scaled min-sum decoder","authors":"A. Emran, M. Elsabrouty, O. Muta, H. Furukawa","doi":"10.1109/ISIT.2015.7282940","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282940","url":null,"abstract":"In this paper, we apply an efficient scaling strategy on layered scaled min-sum LDPC decoder. In addition, we propose a joint optimization strategy for the quantization and scaling parameters of layered scaled min-sum LDPC decoder. The study of our optimization results, for DVB-S2 LDPC codes with different constellation sizes and code rates, shows that each constellation size code rate pair has different optimal scaling and quantization parameters. In order to maximize the achievable performance, we propose using the different scaling and quantization parameters for each constellation size code rate pair. The simulation results show the performance improvement of separately using optimal scaling parameters or optimal quantization parameters, and the overall performance enhancement of using both optimal scaling and quantization parameters.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"2610 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":"132752500","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
扫码关注我们
求助内容：
应助结果提醒方式：