{"title":"Linear source coding over rings and applications","authors":"Sheng Huang, M. Skoglund","doi":"10.1109/Swe-CTW.2012.6376282","DOIUrl":"https://doi.org/10.1109/Swe-CTW.2012.6376282","url":null,"abstract":"This paper studies linear coding (LC) techniques in the setting of computing functions of correlated memoryless sources. Instead of linear mappings over finite fields, we consider using linear mappings over finite rings as encoders. It is shown that generally the region c×R, where c ≥ 1 is a constant and R is the Slepian-Wolf (SW) region, is achievable with LC over ring (LCoR) when the function to compute is the identity function. c = 1 if the ring used is a field. Hence, LCoR could be suboptimal in terms of achieving the best coding rates (the SW region) for computing the identity function. In spite of that, the ring version shows several advantages. It is demonstrated that there exists a function that is neither linear nor can be linearized over any finite field. Thus, LC over field (LCoF) does not apply directly for computing such a function unless the polynomial approach [1], [2] is used. On the contrary, such a function is linear over some ring. Using LCoR, an achievable region containing the SW region can be obtained for computing this function. In addition, the alphabet sizes of the encoders are strictly smaller than using LCoF. More interestingly, LCoF is not useful if some special requirement is imposed.","PeriodicalId":348396,"journal":{"name":"2012 Swedish Communication Technologies Workshop (Swe-CTW)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125477637","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}
{"title":"Power allocation for multi-hop decode-and-forward cognitive radio networks with line topology","authors":"Maksym A. Girnyk, Ming Xiao, L. Rasmussen","doi":"10.1109/Swe-CTW.2012.6376291","DOIUrl":"https://doi.org/10.1109/Swe-CTW.2012.6376291","url":null,"abstract":"In the present paper we study the power allocation for multi-hop underlay cognitive radio networks (CRNs) with line topology. That is, we consider a scenario, where a CRN operates in parallel to the primary network provided that the interference created to the primary network is limited by an acceptable threshold. The CNR is assumed to be a multi-hop relay network and hence before reaching the destination information from the source node may pass several hops from node to node. At each hop, the information is decoded and forwarded to the following node. It is further assumed that transmissions can be overheard by neighboring nodes, thereby creating interference. The power at each node can be optimally adjusted so that the end-to-end throughput of the CRN is maximized, while the constraint on interference towards the primary network is satisfied. In this paper, we show that for line CRNs the optimal power allocation is achieved when capacities of all intermediate links are equal and the interference constraint of the most disturbed primary user is fulfilled with equality. To simplify the computation of the optimal power allocation we derive two approximate solutions as well as several distributed power allocation schemes. The numerical results illustrate the interplay between the proposed solutions and the optimal power allocation.","PeriodicalId":348396,"journal":{"name":"2012 Swedish Communication Technologies Workshop (Swe-CTW)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123626589","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}
{"title":"Feedback capacity of the bidirectional broadcast channel","authors":"M. N. Khormuji, M. Skoglund","doi":"10.1109/Swe-CTW.2012.6376287","DOIUrl":"https://doi.org/10.1109/Swe-CTW.2012.6376287","url":null,"abstract":"This paper shows that feedback does not increase the capacity of the two-receiver discrete memoryless bidirectional broadcast channel.","PeriodicalId":348396,"journal":{"name":"2012 Swedish Communication Technologies Workshop (Swe-CTW)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114170940","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}
{"title":"Multilayer network-coded ARQ for multiple unicast flows","authors":"P. Larsson, L. Rasmussen, M. Skoglund","doi":"10.1109/Swe-CTW.2012.6376280","DOIUrl":"https://doi.org/10.1109/Swe-CTW.2012.6376280","url":null,"abstract":"The notion of joint network-coded ARQ for multiple unicast flows and superposition coding (multilayering) is introduced. We consider a single sender and multiple receiving users with feedback channels. Much like in a cellular system downlink, each user expects to receive different information. Superposition coding transforms each fading channel into several (or infinite number of) layers of packet erasure channels, and network-coded ARQ is utilized on groups of layers over the users. The expected sum-rate is considered, and optimized. Numerically optimized results indicate roughly additive gains due to layering and network coding. Some analytical results on special cases regarding number of users and layers, are given. For instance, for NC unicast ARQ, one layer and arbitrary number of users, we derive the optimal expected sum-rate in a novel parameterized closed form.","PeriodicalId":348396,"journal":{"name":"2012 Swedish Communication Technologies Workshop (Swe-CTW)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124817158","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}
{"title":"Fast identification of control signaling aided by please-decode-blindly (PDB) messages","authors":"Reza Moosavi, E. Larsson","doi":"10.1109/Swe-CTW.2012.6376289","DOIUrl":"https://doi.org/10.1109/Swe-CTW.2012.6376289","url":null,"abstract":"Blind decoding of control information is used in some wireless multiple access systems such as LTE to achieve adaptive modulation and coding, as well as to address the multiple access problem on the control channel. Blind decoding incurs high computational complexity in mobile terminals. In this paper, we describe a scheme to reduce the computational complexity associated with the blind decoding. The main idea is to broadcast a “please-decode-blindly” message to all terminals that are eligible for scheduling, to instruct a subset of the terminals to perform the blind search. We propose two schemes to implement our idea and we investigate their performances via system simulations.","PeriodicalId":348396,"journal":{"name":"2012 Swedish Communication Technologies Workshop (Swe-CTW)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126341060","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}
{"title":"FROGS: A serial reversible greedy search algorithm","authors":"D. Sundman, S. Chatterjee, M. Skoglund","doi":"10.1109/Swe-CTW.2012.6376286","DOIUrl":"https://doi.org/10.1109/Swe-CTW.2012.6376286","url":null,"abstract":"For compressed sensing, in the framework of greedy search reconstruction algorithms, we introduce the notion of initial support-set. The initial support-set is an estimate given to a reconstruction algorithm to improve the performance of the reconstruction. Furthermore, we classify existing greedy search algorithms as being serial or parallel. Based on this classification and the goal of robustness to errors in the initial support-sets we develop a new greedy search algorithm called FROGS. We end the paper with careful numerical experiments concluding that FROGS perform well compared to existing algorithms (both in terms of performance and execution time) and that it is robust against errors in the initial support-set.","PeriodicalId":348396,"journal":{"name":"2012 Swedish Communication Technologies Workshop (Swe-CTW)","volume":"43 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126082893","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}
{"title":"Unequal error protection of LT codes over noisy channels","authors":"Iqbal Hussain, Ming Xiao, L. Rasmussen","doi":"10.1109/Swe-CTW.2012.6376281","DOIUrl":"https://doi.org/10.1109/Swe-CTW.2012.6376281","url":null,"abstract":"We propose a new unequal error protection (UEP) scheme for Luby Transform (LT) codes over additive white Gaussian noise (AWGN) channels. In contrast to the state-of-the-art UEP scheme for LT codes where the effective code rates are exploited for UEP, we characterize the variable-node degree distribution to achieve UEP for LT codes. For performance analysis, we compare the lower bounds on bit error rate for our proposed scheme and a conventional UEP-based LT codes over AWGN channels for various parameters. Moreover, it is demonstrated through numerical examples that our proposed UEP scheme has better performance than the conventional UEP-based LT codes over a wide range of code rates and channel conditions.","PeriodicalId":348396,"journal":{"name":"2012 Swedish Communication Technologies Workshop (Swe-CTW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131137157","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}
Shoaib Amin, E. Zenteno, P. Landin, D. Rönnow, M. Isaksson, P. Händel
{"title":"Noise impact on the identification of digital predistorter parameters in the indirect learning architecture","authors":"Shoaib Amin, E. Zenteno, P. Landin, D. Rönnow, M. Isaksson, P. Händel","doi":"10.1109/Swe-CTW.2012.6376285","DOIUrl":"https://doi.org/10.1109/Swe-CTW.2012.6376285","url":null,"abstract":"The indirect learning architecture (ILA) is the most used methodology for the identification of Digital Predistorter (DPD) functions for nonlinear systems, particularly for high power amplifiers. The ILA principle works in black box modeling relying on the inversion of input and output signals of the nonlinear system, such that the inverse is estimated. This paper presents the impact of disturbances, such as noise in the DPD identification. Experiments were performed with a state-of-art Doherty power amplifier intended for base station operation in current telecommunication wireless networks. As expected, a degradation in the performance of the DPD (measured in normalized mean square error (NMSE)) is found in our experiments. However, adjacent channel power ratio (ACPR) can be a misleading figure of merit showing improvement in the performance for wrongly estimated DPD functions.","PeriodicalId":348396,"journal":{"name":"2012 Swedish Communication Technologies Workshop (Swe-CTW)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132963170","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}
D. Kang, Zhe Li, Qiuchan Luo, Farnaz Fathali, Alexandre Vizcaino, J. Zander
{"title":"Impact of asymmetric transmission power on operator competition in shared spectrum","authors":"D. Kang, Zhe Li, Qiuchan Luo, Farnaz Fathali, Alexandre Vizcaino, J. Zander","doi":"10.1109/Swe-CTW.2012.6376283","DOIUrl":"https://doi.org/10.1109/Swe-CTW.2012.6376283","url":null,"abstract":"To maintain affordable access for the rapidly increasing mobile traffic, base station deployment has to be tailored to hot-spot areas and primarily indoors where facility owners, e.g., shopping malls or hotels, mostly provide wireless service. Since such local access providers (LAPs) do not have access to exclusive spectrum, one proposed option is sharing spectrum with other nearby LAPs, e.g. unlicensed or secondary spectrum. Due to limited or no coordination between the LAPs, they selfishly access the spectrum, causing harmful interference to the neighboring networks. Especially by increasing transmission power, one operator may attempt to improve its own throughput at the expense of its neighbors. In this paper, we explore the impact of power asymmetry on competition between LAPs. We model the competition between two networks with different maximum power constraints as a network-wide power control game. By analyzing the pure Nash equilibria, we find that a lower power (LP) network becomes more aggressive to overcome the inter-network interference. Due to the aggressive behavior, sharing spectrum can out-perform fixed spectrum split even for the LP network, provided that the power asymmetry is below a certain limit. On the other hand, a higher power (HP) network is mainly affected by its own “self-interference” so that it has little incentive to employ complicated inter-operator interference management schemes. In addition, we demonstrate that the power asymmetry limit strongly depends on the inter-network propagation conditions, e.g., inter-building distance or building penetration loss.","PeriodicalId":348396,"journal":{"name":"2012 Swedish Communication Technologies Workshop (Swe-CTW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130655038","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}
{"title":"On the achievable rate region of a state-dependent MAC with cooperating encoders","authors":"M. Emadi, M. N. Khormuji, M. Skoglund, M. Aref","doi":"10.1109/Swe-CTW.2012.6376288","DOIUrl":"https://doi.org/10.1109/Swe-CTW.2012.6376288","url":null,"abstract":"The two-user discrete memoryless state-dependent multiple-access channel with cooperating encoders is considered. It is assumed that the channel is controlled with two independent states such that each of the channel state information is noncausally available at one encoder. Moreover, based on the intrinsic characteristic of wireless networks, it is assumed that each encoder strictly causally receive a noisy version of the transmitted signal of the other encoder. Hence, the encoders can cooperate in transmitting the message to the receiver. An achievable rate region for the channel is derived by use of rate splitting, block Markov encoding and Gelfand-Pinsker multilevel encoding along with partial decoding at the encoders and backward decoding at the receiver. Finally, for a Gaussian channel model the proposed achievable rate region is evaluated and discussed.","PeriodicalId":348396,"journal":{"name":"2012 Swedish Communication Technologies Workshop (Swe-CTW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121228053","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}