{"title":"Distributed storage systems with secure and exact repair — New results","authors":"R. Tandon, Saidhiraj Amuru, T. Clancy, R. Buehrer","doi":"10.1109/ITA.2014.6804226","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804226","url":null,"abstract":"Distributed storage systems (DSS) in the presence of a passive eavesdropper are considered in this paper. A typical DSS is characterized by 3 parameters (n, k, d) where, a file is stored in a distributed manner across n nodes such that it can be recovered entirely from any k out of n nodes. Whenever a node fails, d ϵ [k, n) nodes participate in the repair process. In this paper, we study the exact repair capabilities of a DSS, where a failed node is replaced with its exact replica. Securing this DSS from a passive eavesdropper capable of wiretapping the repair process of any l <; k nodes, is the main focus of this paper. Specifically, we characterize the optimal secure storage-vs-exact-repair-bandwidth tradeoff region for the (4, 2, 3) DSS when l = 1 and the (n, n - 1, n - 1) DSS when l = n - 2.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"141 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":"132868524","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":"Performance improvement with decoder output smoothing in differential predictive coding","authors":"J. Gibson, Malavika Bhaskaranand","doi":"10.1109/ITA.2014.6804266","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804266","url":null,"abstract":"We provide a theoretical analysis of the performance of differential predictive coding using fixed-lag smoothing of the standard decoder output. This performance is compared to related results for coding using latency at the encoder, and causal encoding with delayed decoding, as well as with some prior theoretical analyses of these methods. Surprisingly, it is shown that fixed-lag smoothing of the standard decoder output with causal encoding achieves the asymptotic and finite lag performance promised by a completely reoptimized decoder.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"44 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":"130886102","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":"Domain adaptation methods for robust pattern recognition","authors":"D. A. Shaw, R. Chellappa","doi":"10.1109/ITA.2014.6804227","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804227","url":null,"abstract":"The large majority of classical and modern estimation techniques assume the data seen at the testing phase of statistical inference come from the same process that generated the training data. In many real-world applications this can be a restrictive assumption. We outline two solutions to overcome this heterogeneity: instance-weighting and dimension reduction. The instance-weighting methods estimate weights to use in a loss function in an attempt to make the weighted training distribution “look like” the testing distribution, whereas dimension reduction methods seek transformations of the training and testing data to place them both into a latent space where their distributions will be similar. We use synthetic datasets and a real data example to test the methods against one another.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"263 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":"116239207","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":"Generalized weights and bounds for error probability over erasure channels","authors":"Leandro Cruvinel Lemes, Marcelo Firer","doi":"10.1109/ITA.2014.6804237","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804237","url":null,"abstract":"New upper and lower bounds for the error probability over an erasure channel are provided, making use of Wei's generalized weights, hierarchy and spectra. In many situations the upper and lower bounds coincide and this allows us to improve the existing bounds. Results concerning MDS and AMDS codes are deduced from those bounds.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"4 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":"125219518","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":"LDPC code designs based on √I matrices","authors":"S. G. Srinivasa","doi":"10.1109/ITA.2014.6804247","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804247","url":null,"abstract":"LDPC codes can be constructed by tiling permutation matrices that belong to the square root of identity type and similar algebraic structures. We investigate into the properties of such codes. We also present code structures that are amenable for efficient encoding.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"42 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":"132983359","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":"Neural shaping with joint optimization of controller and plant under restricted dynamics","authors":"Bryan D. He, L. Srinivasan","doi":"10.1109/ITA.2014.6804254","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804254","url":null,"abstract":"The prototypical brain-computer interface (BCI) algorithm translates brain activity into changes in the states of a computer program, for typing or cursor movement. Most approaches use neural decoding which learns how the user has encoded their intent in their noisy neural signals. Recent adaptive decoders for cursor movement improved BCI performance by modeling the user as a feedback controller; when this model accounts for adaptive control, the neural decoder is termed co-adaptive. This recent collection of control-inspired neural decoding strategies disregards a major antecedent conceptual realization, whereby the user could be induced to adopt an encoding strategy (control policy) such that the encoder-decoder pair (or equivalently, controller-plant pair) is optimal under a desired cost function. We call this alternate conceptual approach neural shaping, in contradistinction to neural decoding. Previous work illuminated the general form of optimal controller-plant pair under a cost representing information gain. For BCI applications requiring the user to issue discrete-valued commands, the information-gain-optimal pair, based on the posterior matching scheme, can be user-friendly. In this paper, we discuss the application of neural shaping to cursor control with continuous-valued states based on continuous-valued user commands. We examine the problem of jointly optimizing controller and plant under quadratic expected cost and restricted linear plant dynamics. This simplification reduces joint controller-plant selection to a static optimization problem, similar to approaches in structural engineering and other areas. This perspective suggests that recent BCI approaches that alternate between adaptive neural decoders and static neural decoders could be local Pareto-optimal, representing a suboptimal iterative-type solution to the optimal joint controller-plant problem.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"42 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":"116866234","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":"Massive MIMO and inter-tier interference coordination","authors":"Ansuman Adhikary, E. A. Safadi, G. Caire","doi":"10.1109/ITA.2014.6804251","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804251","url":null,"abstract":"We study the performance of a two-tier system where a large number of small cells is deployed under a macro-cellular “umbrella”. The macro-cellular tier provides coverage and handles mobile users, while the small cell tier provides high rate locally to nomadic users. While the standard approach consists of operating the two tiers in different frequency bands, for various reasons (e.g., lack of licensed spectrum), it may be useful to operate both tiers in the whole available spectrum. Hence, we consider schemes for inter-tier interference coordination that do not assume any explicit data or channel state information sharing between tiers. In particular, we consider co-channel TDD and reverse TDD schemes, when the macro (tier-1) base station has a very large number of antennas and the tier-2 base stations have a moderately large number of antennas. We show that by exploiting the spatial directionality of the channel vectors, very efficient inter-tier interference management can be obtained with relatively low complexity. Our approach consists of a sort of “spatial blanking” of certain angle-of-departure of the tier-1 base station at given scheduled time-frequency slots, in order to create transmission opportunities for the corresponding tier-2 small cells. In particular, such “spatial blanking” is significantly more efficient than isotropic slot blanking (enhanced Inter-Cell Interference Coordination, eICIC) currently proposed in LTE standardization.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"84 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":"116144440","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}
Upamanyu Madhow, D. Brown, S. Dasgupta, R. Mudumbai
{"title":"Distributed massive MIMO: Algorithms, architectures and concept systems","authors":"Upamanyu Madhow, D. Brown, S. Dasgupta, R. Mudumbai","doi":"10.1109/ITA.2014.6804225","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804225","url":null,"abstract":"Making MIMO truly “massive” involves liberating it from the shackles of form factor constraints, by allowing arbitrarily large groups of neighboring nodes to opportunistically form virtual antenna arrays for both transmission and reception. Moving such distributed MIMO (DMIMO) systems from the realm of information theory to practice requires synchronization of the cooperating nodes at multiple levels. We are interested in all-wireless systems which are severely constrained in the amount of information that can be exchanged among the cooperating nodes, in contrast to recent proposals in massive MIMO (co-located antennas) or base station cooperation (which relies on a high-speed wired backhaul). The goal of this paper is to point out some of the research issues unique to scaling up such DMIMO systems. We briefly review the significant technical progress in design and demonstration over the past few years, and describe a research agenda for the next few years based on fundamental questions in attaining the “distributed coherence” required to realize concept systems such as DMIMO communication at large carrier wavelengths (e.g., white space frequencies for which standard antenna arrays are too bulky) and distributed 911 for emergency and rescue scenarios.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"14 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":"128015736","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":"Fair resource allocation for OFDMA multi-cell networks","authors":"Wuwen Li, G. Pottie","doi":"10.1109/ITA.2014.6804235","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804235","url":null,"abstract":"Fair resource allocation in OFDMA networks is studied in this paper. We propose a distributed algorithm requiring minimum inter-cell information that embodies the principle of balancing advantaged and disadvantaged user traffic flows. A simple interference deterministic channel model assuming zero queuing delay is used. We propose a hybrid power and bandwidth allocation algorithm. A two-dimensional simulation conducted on both uniform and random-sized-cells shows the benefits are significant when fair allocations are desired.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"64 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":"124373168","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}
Dilip Bethanabhotla, Ozgun Y. Bursalioglu, H. Papadopoulos, G. Caire
{"title":"User association and load balancing for cellular massive MIMO","authors":"Dilip Bethanabhotla, Ozgun Y. Bursalioglu, H. Papadopoulos, G. Caire","doi":"10.1109/ITA.2014.6804284","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804284","url":null,"abstract":"Massive MIMO is expected to play a key role in coping with the predicted mobile-data traffic explosion. Indeed, in combination with small cells and TDD operation, it promises large throughputs per unit area with low latency. In this paper we focus on the problem of balancing the load across networks with massive MIMO base-stations (BSs). The need for load balancing arises from variations in the user population density and is more pronounced in small cells due to the large variability in coverage area. We consider methods for load balancing over networks with small and large massive MIMO BSs. As we show, the distinct operation and properties of massive MIMO enable practical resource-efficient load-balancing methods with near-optimal performance.","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":"132475789","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}