发布求助
文献互助 智能选刊 最新文献

2014 Information Theory and Applications Workshop (ITA)最新文献

筛选
英文 中文
A generalized Boolean function generator for complementary sequences 互补序列的广义布尔函数生成器
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804208
S. Budisin, P. Spasojevic
{"title":"A generalized Boolean function generator for complementary sequences","authors":"S. Budisin, P. Spasojevic","doi":"10.1109/ITA.2014.6804208","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804208","url":null,"abstract":"We present a general algorithm for generating arbitrary standard complementary pairs of sequences (including binary, polyphase, M-PSK and QAM) of length 2N using Boolean functions. The algorithm follows our earlier paraunitary algorithm, but does not require matrix multiplications. The algorithm can be easily and efficiently implemented in hardware. As a special case, it reduces to the non-recursive (direct) algorithm for generating binary sequences given by Golay, to the algorithm for generating M-PSK sequences given by Davis and Jedwab (and later improved by Paterson) and to all published algorithms for generating QAM sequences. The Boolean index form of the algorithm can directly be generalized to complementary sets.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122113892","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}
引用次数: 5
Energy harvesting communications with continuous energy arrivals 能量收集通信与持续的能量到达
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804231
Burak Varan, Kaya Tutuncuoglu, A. Yener
{"title":"Energy harvesting communications with continuous energy arrivals","authors":"Burak Varan, Kaya Tutuncuoglu, A. Yener","doi":"10.1109/ITA.2014.6804231","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804231","url":null,"abstract":"This work considers an energy harvesting transmitter that gathers a continuous flow of energy from intermittent sources, thus relaxing the modeling assumption of discrete amounts of harvested energy present in all previous work on energy harvesting communications. Tools from convex analysis are utilized to describe the optimal transmission policy as the boundary of a properly defined region based on the energy profile. The results are extended to include models where the transmitter has a finite capacity battery with various imperfections, as well as those that incorporate a processing cost (circuit power) at the transmitter whenever it is in operation.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122806060","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}
引用次数: 19
Some refelections about the Lambert W function as inverse of x · log(x) 关于Lambert W函数作为x·log(x)的逆函数的一些反思
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804273
U. Tamm
{"title":"Some refelections about the Lambert W function as inverse of x · log(x)","authors":"U. Tamm","doi":"10.1109/ITA.2014.6804273","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804273","url":null,"abstract":"The Lambert W function fulfills W(y)· eW(y) = y. With the choice y = log (x) it can hence be applied to invert the function f (x) = x · log(x), which is of some interest in the problems discussed. Further applications of the Lambert W function in information theory are briefly surveyed.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125537120","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}
引用次数: 8
Codes and lattices in the lp metric lp度规中的码和格
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804217
S. Costa, A. Campello, G. C. Jorge, J. Strapasson, Claudio M. Qureshi
{"title":"Codes and lattices in the lp metric","authors":"S. Costa, A. Campello, G. C. Jorge, J. Strapasson, Claudio M. Qureshi","doi":"10.1109/ITA.2014.6804217","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804217","url":null,"abstract":"Codes and associated lattices are studied in the l<sub>p</sub> metric, particularly in the l<sub>1</sub> (Lee) and the l<sub>∞</sub> (maximum) distances. Discussions and results on decoding processes, classification and analysis of perfect or dense codes in these metrics are presented.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127135307","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}
引用次数: 5
Hybrid compression and message-sharing strategy for the downlink cloud radio-access network 下行云无线接入网络的混合压缩和消息共享策略
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804240
Pratik Patil, Wei Yu
{"title":"Hybrid compression and message-sharing strategy for the downlink cloud radio-access network","authors":"Pratik Patil, Wei Yu","doi":"10.1109/ITA.2014.6804240","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804240","url":null,"abstract":"Cloud radio-access network (CRAN) is a wireless cellular network architecture in which the base-stations are connected to a cloud-computing based central processor with digital backhaul links. In this setting, the base-stations can be thought of as relays between the central processor and the user terminals. This paper considers the downlink of a cloud radio-access network with finite-capacity backhaul links. We model the overall network as a broadcast-relay channel, and propose a hybrid compression and message-sharing strategy for the downlink transmission. This paper further proposes numerical techniques for optimizing the quantization noise level in the compression part of the hybrid precoding scheme. We compare the system-level performance of the proposed scheme with the pure compression and the pure message sharing schemes to show the benefit of the hybrid strategy for the downlink CRAN.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127069433","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}
引用次数: 40
Information exchange for routing protocols 路由协议的信息交换
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804243
A. Barbero, Øyvind Ytrehus
{"title":"Information exchange for routing protocols","authors":"A. Barbero, Øyvind Ytrehus","doi":"10.1109/ITA.2014.6804243","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804243","url":null,"abstract":"Distance vector routing is a classic distributed algorithm for obtaining routing tables in a communication network. The algorithm relies on message exchange between neighbor routers. This paper studies the amount of routing data that needs to be stored and exchanged. On a static network, a variation of the algorithm that exchanges routing trees or pseudotrees is slightly more information theoretically efficient than a traditional implementation that exchanges tables. Knowledge of an underlying graph model and proper estimation of parameters allow more efficient coding schemes, including schemes related to Slepian-Wolf coding. Further improvements can be obtained on a dynamic network.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"367 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134517423","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}
引用次数: 1
Encoding of cellular positional information and maximum capacity of parallel coupled channels 蜂窝位置信息的编码与并行耦合信道的最大容量
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804230
Eduard Axel Jorswieck, A. Reppas, H. Hatzikirou
{"title":"Encoding of cellular positional information and maximum capacity of parallel coupled channels","authors":"Eduard Axel Jorswieck, A. Reppas, H. Hatzikirou","doi":"10.1109/ITA.2014.6804230","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804230","url":null,"abstract":"Inspired by the parallels between information coding in morphogenesis and information coding in computer communication, we introduce a new model for coupled discrete memoryless channels in which the error probability of one channel depends on the output of the other channel. The model is motivated by a type of cell-cell communication. It is shown that coupling will lead to higher sum capacities with both optimal input distribution and with uniform input distribution under joint coding. Thereby, nature can achieve more than the sum of the individual capacities (synergistic effect). We compare this result with the maximum achievable sum capacity by arbitrary ideal coupling using Majorization theory. Finally, we illustrate the model with applications from wireless communications.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133247535","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}
引用次数: 1
Complexity reduced zero-forcing beamforming in massive MIMO systems 复杂性降低了大规模MIMO系统中的零强迫波束形成
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804219
Chan-Sic Park, Yong-Suk Byun, A. Bokiye, Yong-Hwan Lee
{"title":"Complexity reduced zero-forcing beamforming in massive MIMO systems","authors":"Chan-Sic Park, Yong-Suk Byun, A. Bokiye, Yong-Hwan Lee","doi":"10.1109/ITA.2014.6804219","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804219","url":null,"abstract":"Data gathering is one of the most popular applications in multi-hop wireless sensor networks. Since resources are limited, it is important to efficiently allocate the resource Massive multi-input multi-output (m-MIMO) systems can provide a high degree of freedom in signal transmission, enabling to simultaneously serve a number of users with high transmission capacity. Conventional zero-forcing beamforming (ZFBF) techniques can transmit multi-user signal while completely canceling out interbeam interference. However, they may have implementation difficulty when applied to m-MIMO systems mainly due to hugh processing complexity. In this paper, we design a complexity reduced ZFBF scheme by means of sequential interference cancellation. We first determine the beam weight according to the use of conventional maximum ratio transmission (MRT) scheme and calculate the corresponding interbeam interference. We calculate so-called an interference cancellation vector by sequentially cancelling out a predetermined number of interference sources in an order of the strongest interference. Finally, we determine the beam weight by adding the interference cancellation vector to the MRT beam weight. The number of interbeam interferences to be cancelled out can be pre-determined taking into consideration of the processing complexity and required performance. As the number of interbeam interferences to be cancelled out increases, the performance of the proposed scheme approaches to that of ZFBF. The numerical and simulation results show that the proposed scheme can achieve about 90 % capacity of ZFBF while requiring 2~7% processing complexity of ZFBF in various operating environments with the use of 32 128 transmit antennas.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114726153","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}
引用次数: 29
Total variation distance and the distribution of relative information 总变异距离和相对信息的分布
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804281
S. Verdú
{"title":"Total variation distance and the distribution of relative information","authors":"S. Verdú","doi":"10.1109/ITA.2014.6804281","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804281","url":null,"abstract":"We give explicit expressions, upper and lower bounds on the total variation distance between P and Q in terms of the distribution of the random variables log dP/dQ (X) and log dP/dQ(Y), where X and Y are distributed accorκding to P and Q respectively.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115808449","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}
引用次数: 54
Unconventional behavior of the noisy min-sum decoder over the binary symmetric channel 噪声最小和解码器在二进制对称信道上的非常规行为
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804283
Christiane L. Kameni Ngassa, V. Savin, D. Declercq
{"title":"Unconventional behavior of the noisy min-sum decoder over the binary symmetric channel","authors":"Christiane L. Kameni Ngassa, V. Savin, D. Declercq","doi":"10.1109/ITA.2014.6804283","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804283","url":null,"abstract":"This paper investigates the behavior of the noisy Min-Sum decoder over binary symmetric channels. A noisy decoder is a decoder running on a noisy device, which may introduce errors during the decoding process. We show that in some particular cases, the noise introduce by the device can help the Min-Sum decoder to escape from fixed points attractors, and may actually result in an increased correction capacity with respect to the noiseless decoder. We also reveal the existence of a specific threshold phenomenon, referred to as functional threshold. The behavior of the noisy decoder is demonstrated in the asymptotic limit of the code-length, by using “noisy” density evolution equations, and it is also verified in the finite-length case by Monte-Carlo simulation.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114879918","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}
引用次数: 14
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书