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

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

筛选
英文 中文
Achievable performance and limiting factors of echo cancellation in wireless communications 无线通信中可实现的回波消除性能及限制因素
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804210
F. Ling
{"title":"Achievable performance and limiting factors of echo cancellation in wireless communications","authors":"F. Ling","doi":"10.1109/ITA.2014.6804210","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804210","url":null,"abstract":"Self-interference cancellation for wireless communications, similar to its wireline counterpart echo cancellation, is considered in this paper. We analyze the factors that impacts echo/self-interference canceller performance. It is shown that the main factors limiting its performance are the excess MSE, echo-channel estimation error, and various nonlinear effects. By establishing a linearized model of the channel estimator, we derive expressions of the errors at the echo canceller output as functions of the estimator's time constant, the bandwidth of channel variation, the receiver SNR and the echo level. The optimal adaptation time constant are derived. Non-linearities in the transmitter and receiver are shown to be the main limiting factor. Finally, implementations considerations of echo cancellers are discussed.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"3 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":"116856331","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
Decoding of quasi-cyclic LDPC codes with section-wise cyclic structure 具有分段循环结构的准循环LDPC码的解码
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804221
Juane Li, Keke Liu, Shu Lin, K. Abdel-Ghaffar
{"title":"Decoding of quasi-cyclic LDPC codes with section-wise cyclic structure","authors":"Juane Li, Keke Liu, Shu Lin, K. Abdel-Ghaffar","doi":"10.1109/ITA.2014.6804221","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804221","url":null,"abstract":"Presented in this paper is a reduced-complexity iterative decoding scheme for quasi-cyclic (QC) LDPC codes. This decoding scheme is devised based on the section-wise cyclic structure of the parity-check matrix of a QC-LDPC code. Using this decoding scheme, the hardware implementation complexity of a QC-LDPC decoder can be significantly reduced without performance degradation. A high-rate QC-LDPC code that can achieve a very low error-rate without a visible error-floor is used to demonstrate the effectiveness of the proposed decoding scheme. Also presented in this paper are two other high-rate QC-LDPC codes and a method for constructing rate -1/2 QC-LDPC codes whose Tanner graphs have girth 8. All the codes constructed perform well with low error-floor using the proposed decoding scheme.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"87 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":"127035551","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
Modeling wireless channels under spherical invariance assumptions 球形不变性假设下的无线信道建模
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804253
Cheng-An Yang, K. Yao, E. Biglieri
{"title":"Modeling wireless channels under spherical invariance assumptions","authors":"Cheng-An Yang, K. Yao, E. Biglieri","doi":"10.1109/ITA.2014.6804253","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804253","url":null,"abstract":"We look for the probability distribution of the fading envelope yielding the worst and the best performance of digital transmission in a wireless channel. We assume that the underlying fading process is spherically invariant. Using a general representation theorem for such a process in conjunction with semidefinite programming techniques, we derive the envelope densities yielding the maximum and minimum error probability P(e) of uncoded binary modulation, as well as the maximum and minimum outage probability Pout. In particular, for P(e) we show that the worst fading yields P(e) = 0.5, while if the fading process has zero mean the most benign fading has a Rayleigh density, while if its mean is nonzero it has a Rice density with the appropriate Rice coefficient K. The situation for Pout is more complicated: the worst fading yields Pout = 1, while the best fading has a Rayleigh or Rice density only for high SNR values.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"114 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":"124172427","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
Link failure recovery in large arbitrary networks via network coding 基于网络编码的大型任意网络链路故障恢复
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804248
Serhat Nazim Avci, E. Ayanoglu
{"title":"Link failure recovery in large arbitrary networks via network coding","authors":"Serhat Nazim Avci, E. Ayanoglu","doi":"10.1109/ITA.2014.6804248","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804248","url":null,"abstract":"Network coding-based link failure recovery techniques provide near-hitless recovery and offer high capacity efficiency. In this paper, we propose a simple column generation-based design algorithm and a novel advanced diversity (network) coding technique to achieve near-hitless recovery in large networks. The main problem is solved with Linear Programming (LP) and Integer Linear Programming (ILP), whereas the subproblem can be solved with different methods. Simulation results suggest that both the novel coding structure and the novel design algorithm lead to higher capacity efficiency for near-hitless recovery. The novel design algorithm simplifies the capacity placement problem which enables implementing diversity coding-based techniques in large networks with arbitrary topology.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"13 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":"116491294","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
Interpolation-based Chase BCH decoder 基于插值的大通BCH解码器
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804245
Xinmiao Zhang
{"title":"Interpolation-based Chase BCH decoder","authors":"Xinmiao Zhang","doi":"10.1109/ITA.2014.6804245","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804245","url":null,"abstract":"BCH codes are adopted in many applications, such as flash memory and optical communications. Compared to hard-decision decoders, the soft-decision Chase BCH decoder can achieve significant coding gain by trying multiple test vectors. Previously, one-pass Chase BCH decoding schemes based on the Berlekamp's algorithm are used to share intermediate results among the decoding trials. In this paper, it will be shown that the interpolation-based one-pass Chase BCH decoder has much lower hardware complexity. Techniques for simplifying the implementation architecture for each step of the interpolation-based decoder are summarized. For a (4200, 4096) BCH code, the interpolation-based Chase decoder with 16 test vectors has 2.2 times higher hardware efficiency than that based on the Berlekamp's algorithm in terms of throughput-over-area ratio.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"110 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":"127995570","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
Information spread in networks: Control, games, and equilibria 网络中的信息传播:控制、博弈和平衡
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804244
A. Khanafer, T. Başar
{"title":"Information spread in networks: Control, games, and equilibria","authors":"A. Khanafer, T. Başar","doi":"10.1109/ITA.2014.6804244","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804244","url":null,"abstract":"We design intervention schemes to control information spread in multi-agent systems. We consider two information spread models: linear distributed averaging and virus spread dynamics. Using the framework of differential games, we design a dynamical optimization framework that produces strategies that are robust to adversarial intervention. For linear dynamics, we show that optimal strategies make connection to potential-theory. In the virus spread case, we show that optimal controllers exhibit multiple switches. Moreover, we establish a connection between game theory and dynamical descriptions of network epidemics, which provides insights into decision making in infected networks. Finally, we present initial building blocks for network controllability using a limited number of controls.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"89 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":"115910854","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}
引用次数: 15
Optimal policies for two-user energy harvesting device networks with imperfect state-of-charge knowledge 具有不完全充电状态知识的双用户能量收集设备网络的最优策略
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804264
D. Testa, M. Zorzi
{"title":"Optimal policies for two-user energy harvesting device networks with imperfect state-of-charge knowledge","authors":"D. Testa, M. Zorzi","doi":"10.1109/ITA.2014.6804264","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804264","url":null,"abstract":"Energy Harvesting Devices (EHDs) are enjoying continuously increasing popularity in Wireless Sensor Network research, due to their ability to “harvest” energy from the environment, thus allowing long-term and autonomous operation. Traditional approaches generally assume that the exact energy value of the State-of-Charge (SOC) of an EHD is known. In reality, batteries are practically composed by electro-chemical rechargeable elements or super-capacitors, where the estimation of the energy levels is a complex task. In this paper, we analyze operation policies able to maximize the long-term reward for a network consisting of a pair of EHDs and a central controller (CC), under imperfect knowledge of the SOC. More precisely, we suppose that the CC only knows whether each EHD is “LOW” or ”HIGH,”and has to determine the amount of energy devoted to the transmission over a shared wireless channel. We show that the performance degradation due to the imperfect knowledge of the SOC decreases with the battery capacity of the two nodes, and is practically negligible when this value is sufficiently high.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"148 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":"132029591","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}
引用次数: 9
On the riddle of coding equality function in the garden hose model 论花园水管模型中编码等式函数的谜题
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804262
Oded Margalit
{"title":"On the riddle of coding equality function in the garden hose model","authors":"Oded Margalit","doi":"10.1109/ITA.2014.6804262","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804262","url":null,"abstract":"Recently, Harry Buhrman et al introduced a novel communication complexity model, called “garden-hose”. This model sprout from a research on using quantum properties to allow for position based cryptography. SAT is one of the fundamental NP-Complete problem - finding a satisfying assignment to a CNF (conjunctive Normal Form) formula, or proving that none exists. We will not get into the details of the quantum physics, neither we are going to explain the internal work of SAT solver. Instead we will start from the mathematical garden hose model; describe the way we used SAT solver as a tool; give some lower and upper bounds on implementing the equality function; and conclude with open questions.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"68 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":"125003101","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}
引用次数: 2
Secrecy coverage in two dimensions 两个维度的保密范围
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1017/apr.2015.3
Amites Sarkar
{"title":"Secrecy coverage in two dimensions","authors":"Amites Sarkar","doi":"10.1017/apr.2015.3","DOIUrl":"https://doi.org/10.1017/apr.2015.3","url":null,"abstract":"Imagine a sensor network consisting of base stations scattered at random over a large circular region R. Suppose that, in addition, R contains a smaller number of eavesdroppers, also scattered at random. Now suppose that each base station bean monitor a circular area whose radius is given by the distance from b to the nearest eavesdropper e. What is the probability that the entire region R can be monitored securely by the base stations? Extending work in [14], we estimate this probability, and thus provide detailed information on the maximum density of eavesdroppers that can be accommodated, while preserving complete coverage of R. From an engineering perspective, such coverage guarantees a scheme by which mobile stations can roam everywhere in R, and retain communication with a base station. From a mathematical perspective, the results reveal a new and surprising phenomenon, that the obstructions to coverage occur on a wide range of scales.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"53 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":"127275016","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}
引用次数: 0
Fast multi-dimensional polar encoding and decoding 快速多维极性编码和解码
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804236
Hessam Mahdavifar, Mostafa El-Khamy, Jungwon Lee, Inyup Kang
{"title":"Fast multi-dimensional polar encoding and decoding","authors":"Hessam Mahdavifar, Mostafa El-Khamy, Jungwon Lee, Inyup Kang","doi":"10.1109/ITA.2014.6804236","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804236","url":null,"abstract":"New decoding methods for polar codes are derived from a multi-dimensional realization of polar codes. The notion of polar transformation is extended into higher dimensional polar transformations. It is shown that two dimensional polar transformation leads to a rate-adaptive doubly concatenated polar code. The results are generalized to n-dimensional construction and decoding of polar codes, where N = 2n is the length of the code. The proposed structure for successive cancellation decoding, based on the n-dimensional construction of polar codes, results in efficient decoding latency and space complexity. Soft successive decoding of polar codes and iterative detection and decoding of compound polar codes are implemented using the proposed structure for multi-dimensional decoding of polar codes.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"68 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":"130654852","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
下一页 尾页
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学术官方微信