2014 Information Theory and Applications Workshop (ITA)最新文献_第5页

On the capacity of HetNets 关于HetNets的容量

2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804260

S. Hanly, P. Whiting

引用次数: 8

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

引用次数: 14

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ú

引用次数: 54

Low complexity power and scheduling policies for wireless networks to provide quality of service 低复杂度的功率和调度策略为无线网络提供高质量的服务

2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804250

V. Kumar, V. Sharma

引用次数: 3

Zeta functions of finite-type-Dyck shifts are N-algebraic 有限型dyck位移的Zeta函数是n代数的

2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804286

Marie-Pierre Béal, Michel Blockelet, C. Dima

引用次数: 5

Parallel algorithms for addition in non-standard number systems 非标准数字系统中的并行加法算法

2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804265

Christiane Frougny, P. Heller, E. Pelantová, Milena Svobodová

引用次数: 0

Efficient homomorphic encryption on integer vectors and its applications 整数向量的高效同态加密及其应用

2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804228

Hongchao Zhou, G. Wornell

{"title":"Efficient homomorphic encryption on integer vectors and its applications","authors":"Hongchao Zhou, G. Wornell","doi":"10.1109/ITA.2014.6804228","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804228","url":null,"abstract":"Homomorphic encryption, aimed at enabling computation in the encrypted domain, is becoming important to a wide and growing range of applications, from cloud computing to distributed sensing. In recent years, a number of approaches to fully (or nearly fully) homomorphic encryption have been proposed, but to date the space and time complexity of the associated schemes has precluded their use in practice. In this work, we demonstrate that more practical homomorphic encryption schemes are possible when we require that not all encrypted computations be supported, but rather only those of interest to the target application. More specifically, we develop a homomorphic encryption scheme operating directly on integer vectors that supports three operations of fundamental interest in signal processing applications: addition, linear transformation, and weighted inner products. Moreover, when used in combination, these primitives allow us to efficiently and securely compute arbitrary polynomials. Some practically relevant examples of the computations supported by this framework are described, including feature extraction, recognition, classification, and data aggregation.","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":"115482515","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}

引用次数: 77

Experiences building network-coding-based distributed storage systems 有构建基于网络编码的分布式存储系统的经验

2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804234

P. Lee

{"title":"Experiences building network-coding-based distributed storage systems","authors":"P. Lee","doi":"10.1109/ITA.2014.6804234","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804234","url":null,"abstract":"Large-scale distributed storage systems are prone to node failures. To provide fault tolerance, data is often encoded to maintain data redundancy over multiple storage nodes. If a node fails, it can be repaired by downloading data from surviving nodes and regenerating the lost data in a new node. Network coding has recently been proposed (e.g., see [2]) to generate data redundancy. It is shown that network coding can minimize the amount of data being transferred for repair, while maintaining the same fault tolerance as in conventional erasure coding schemes. Its idea is to have storage nodes first encode their stored data and then send the encoded data for regeneration. On the other hand, the topic of network coding in storage systems is mostly investigated in theoretical studies. Its performance in real deployment remains an open issue. This motivates us to study the practicality of deploying network coding in real-world distributed storage systems. We highlight two of our implementation projects of network-coding-based storage systems at the Chinese University of Hong Kong, namely NCCloud and CORE. Both of them target different storage applications, while building on network coding to enable high availability and efficient recovery of storage systems.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"7 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":"114968422","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

A continuum limit for non-dominated sorting 非支配排序的连续统极限

2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804207

J. Calder, S. Esedoglu, A. Hero

引用次数: 6