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

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
On code design for simultaneous energy and information transfer 能量与信息同时传递的代码设计
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804257
Anshoo Tandon, M. Motani, L. Varshney
{"title":"On code design for simultaneous energy and information transfer","authors":"Anshoo Tandon, M. Motani, L. Varshney","doi":"10.1109/ITA.2014.6804257","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804257","url":null,"abstract":"We consider the problem of binary code design for simultaneous energy and information transfer where the receiver completely relies on the received signal for fulfilling its real-time power requirements. The receiver, in this scenario, would need a certain amount of energy (derived from the received signal) within a sliding time window for its continuous operation. In order to meet this energy requirement at the receiver, the transmitter should use only those codewords which carry sufficient energy. In this paper, we assume that the transmitter uses on-off keying where bit one corresponds to transmission of a high energy signal. The transmitter uses only those codewords which have at least d ones in a sliding window of W = d + 1 bits. We show that with this constraint, the noiseless code capacity is achieved by sequences generated from a finite state Markov machine. We also investigate achievable rates when such constrained codes are used on noisy communication channels. Although a few of these results are well known for run-length limited codes used for data storage, they do not seem to appear in literature in the form presented here.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"122 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":"114014567","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}
引用次数: 23
Low complexity encoding algorithm of RS-based QC-LDPC codes 基于rs的QC-LDPC码低复杂度编码算法
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804249
Mu Zhang, Li Tang, Qin Huang, Zulin Wang
{"title":"Low complexity encoding algorithm of RS-based QC-LDPC codes","authors":"Mu Zhang, Li Tang, Qin Huang, Zulin Wang","doi":"10.1109/ITA.2014.6804249","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804249","url":null,"abstract":"This paper presents a novel encoding algorithm for QC-LDPC codes constructed from Reed-Solomon codes. The encoding is performed in the transform domain via Galois Fourier transformation. Message bits are encoded in sections corresponding to sub-matrices of the parity-check matrix in the transform domain. Because of the structure of the parity-check matrices of these LDPC codes, the encoding can be easily implemented with some linear-feedback shift registers, thus efficiently reduces the hardware cost.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"12 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":"116028294","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}
引用次数: 6
An asymptotic approximation of the ISI channel capacity ISI信道容量的渐近逼近
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804211
G. Taricco, J. Boutros
{"title":"An asymptotic approximation of the ISI channel capacity","authors":"G. Taricco, J. Boutros","doi":"10.1109/ITA.2014.6804211","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804211","url":null,"abstract":"An asymptotic method to calculate the information rate of an ISI channel is presented in this work. The method is based on an integral representation of the mutual information, which is then calculated by using a saddlepoint approximation along with an asymptotic expansion stemming from the Hubbard-Stratonovich transform. This asymptotic result is evaluated repeatedly to generate a large number of samples required for the Monte-Carlo approximation of the final result. The proposed method has the advantage of being manageable even when the channel memory becomes very large since the complexity grows with polynomial order in the memory length.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"72 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":"116245252","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}
引用次数: 3
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信