2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献_第4页

Utility of beamforming strategies for secrecy in multiuser MIMO wiretap channels 多用户MIMO窃听信道中保密性波束形成策略的应用

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394865

A. Mukherjee, A. L. Swindlehurst

{"title":"Utility of beamforming strategies for secrecy in multiuser MIMO wiretap channels","authors":"A. Mukherjee, A. L. Swindlehurst","doi":"10.1109/ALLERTON.2009.5394865","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394865","url":null,"abstract":"This paper examines linear beamforming methods for secure communications in a multiuser wiretap channel with a single transmitter, multiple legitimate receivers, and a single eavesdropper, where all nodes are equipped with multiple antennas. No information regarding the eavesdropper is presumed at the transmitter, and we examine both the broadcast MIMO downlink with independent information, and the multicast MIMO downlink with common information for all legitimate receivers. In both cases the information signal is transmitted with just enough power to guarantee a certain SINR at the desired receivers, while the remainder of the power is used to broadcast artificial noise. The artificial interference selectively degrades the passive eavesdropper's signal while remaining orthogonal to the desired receivers. We analyze the confidentiality provided by zero-forcing and optimal minimum-power beamforming designs for the broadcast channel, and optimal minimum-MSE beamformers for the multicast channel. Numerical simulations for the relative SINR and BER performance of the eavesdropper demonstrate the effectiveness of the proposed physical-layer security schemes.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125168327","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}

引用次数: 62

Distributed strategies for making a digraph weight-balanced 使有向图权重平衡的分布式策略

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394936

Bahman Gharesifard, Jorge Cortés

{"title":"Distributed strategies for making a digraph weight-balanced","authors":"Bahman Gharesifard, Jorge Cortés","doi":"10.1109/ALLERTON.2009.5394936","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394936","url":null,"abstract":"A digraph is weight-balanced if, at each node, the sum of the weights of the incoming edges (in-degree) equals the sum of the weights of the outgoing edges (out-degree). Weight-balanced digraphs play an important role in a variety of cooperative control problems, including formation control, distributed averaging and optimization. We call a digraph weight-balanceable if it admits an edge weight assignment that makes it weight-balanced. It is known that semiconnectedness is a necessary and sufficient condition for a digraph to be weight-balanceable. However, to our knowledge, the available approaches to compute the appropriate set of weights are centralized. In this paper, we propose a distributed algorithm running synchronously on a directed communication network that allows individual agents to balance their in- and out-degrees. We also develop a systematic centralized algorithm for constructing a weight-balanced digraph and compute its time complexity. Finally, we modify the distributed procedure to design an algorithm which is distributed over the mirror digraph and has a time complexity much smaller than the centralized algorithm.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122680152","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}

引用次数: 31

Interactive encoding and decoding based on syndrome accumulation over binary LDPC ensembles: Universality and rate-adaptivity 基于二进制LDPC集成证候积累的交互编解码:通用性和速率自适应

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394496

Jin Meng, E. Yang

{"title":"Interactive encoding and decoding based on syndrome accumulation over binary LDPC ensembles: Universality and rate-adaptivity","authors":"Jin Meng, E. Yang","doi":"10.1109/ALLERTON.2009.5394496","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394496","url":null,"abstract":"In this paper we investigate the performance of linear interactive encoding and decoding based on syndrome accumulation(SA-IED) over binary LDPC ensembles. Assume that the source alphabet is GF(2), and the side information alphabet is finite. It is shown that we can construct universal SA-IED schemes, which are asymptotically optimal for any stationary ergodic source-side information pair. Our analysis further shows that the word error probability will approach 0 sub-exponentially with respect to the block length, while at the same time, the rate approaches H(X|Y) as the average variable node degree of the LDPC ensemble approaches ∞. Further, if the source and side information are correlated through a binary symmetrical memoryless channel, but the cross-over probability of the channel is not known to either the encoder or the decoder, our result on the performance of SA-IED can be further improved for LDPC ensembles with finite average variable node degree. Simulation results on binary source-side information pairs confirm the theoretical analysis above, and further show that SA-IED schemes using LDPC codes coupled with linear time belief propagation decoding consistently outperform Slepian-Wolf coding schemes based on LDPC codes.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134045268","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

On the capacity of the symbol-asynchronous relay channel 符号异步中继信道容量的研究

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394511

Chiranjib Choudhuri, U. Mitra

{"title":"On the capacity of the symbol-asynchronous relay channel","authors":"Chiranjib Choudhuri, U. Mitra","doi":"10.1109/ALLERTON.2009.5394511","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394511","url":null,"abstract":"The capacity of the symbol-asynchronous single-relay channel is investigated. Symbol asynchronism implies that the codewords transmitted from the relay and the source do not coincide in time at the destination. Due to propagation or implementation effects (e.g. mis-synchronized clocks), symbol asynchronism occurs in many practical situations. In ad hoc scenarios, such as sensor networks, achieving perfect synchronism is challenging (due to the distributed nature of the network). Herein it is shown that the symbol-asynchronous single-relay channel can be modeled as a MIMO relay channel with memory. First, lower and upper bounds on the capacity are derived under the assumption that the receivers know the symbol epochs and the transmitters know their mutual offset. Next, the case where the transmitters only know that the mutual offsets that parameterize the channel belong to an uncertainty set and receivers have no knowledge of the symbol epochs is examined. Conditions for characterizing capacity (when the upper and lower bounds match) are also derived. Simple asynchronous coding schemes for the relay channel are also explored. The proposed coding scheme can be extended to the relay with memory. Bilayer LDPC codes are used to replicate the binning strategy of the relay and MLC coding with MSD decoding is used to counter the effect of memory.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"170 1 Pt 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132220372","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

Model-based compressive sensing for signal ensembles 基于模型的信号集成压缩感知

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394807

Marco F. Duarte, V. Cevher, Richard Baraniuk

引用次数: 53

A single-letter characterization of optimal noisy compressed sensing 最优噪声压缩感知的单字母表征

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394838

Dongning Guo, D. Baron, S. Shamai

{"title":"A single-letter characterization of optimal noisy compressed sensing","authors":"Dongning Guo, D. Baron, S. Shamai","doi":"10.1109/ALLERTON.2009.5394838","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394838","url":null,"abstract":"Compressed sensing deals with the reconstruction of a high-dimensional signal from far fewer linear measurements, where the signal is known to admit a sparse representation in a certain linear space. The asymptotic scaling of the number of measurements needed for reconstruction as the dimension of the signal increases has been studied extensively. This work takes a fundamental perspective on the problem of inferring about individual elements of the sparse signal given the measurements, where the dimensions of the system become increasingly large. Using the replica method, the outcome of inferring about any fixed collection of signal elements is shown to be asymptotically decoupled, i.e., those elements become independent conditioned on the measurements. Furthermore, the problem of inferring about each signal element admits a single-letter characterization in the sense that the posterior distribution of the element, which is a sufficient statistic, becomes asymptotically identical to the posterior of inferring about the same element in scalar Gaussian noise. The result leads to simple characterization of all other elemental metrics of the compressed sensing problem, such as the mean squared error and the error probability for reconstructing the support set of the sparse signal. Finally, the single-letter characterization is rigorously justified in the special case of sparse measurement matrices where belief propagation becomes asymptotically optimal.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114788814","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}

引用次数: 119

Modulation codes for flash memory based on load-balancing theory 基于负载均衡理论的快闪存储器调制码

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394880

Fan Zhang, H. Pfister

{"title":"Modulation codes for flash memory based on load-balancing theory","authors":"Fan Zhang, H. Pfister","doi":"10.1109/ALLERTON.2009.5394880","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394880","url":null,"abstract":"In this paper, we consider modulation codes for practical multilevel flash memory storage systems with q cell levels. Instead of maximizing the lifetime of the device [7], [1], [2], [4], we maximize the average amount of information stored per cell-level, which is defined as storage efficiency. Using this framework, we show that the worst-case criterion [7], [1], [2] and the average-case criterion [4] are two extreme cases of our objective function. A self-randomized modulation code is proposed which is asymptotically optimal, as q → ∞, for an arbitrary input alphabet and i.i.d. input distribution. In practical flash memory systems, the number of cell-levels q is only moderately large. So the asymptotic performance as q → ∞ may not tell the whole story. Using the tools from load-balancing theory, we analyze the storage efficiency of the self-randomized modulation code. The result shows that only a fraction of the cells are utilized when the number of cell-levels q is only moderately large. We also propose a load-balancing modulation code, based on a phenomenon known as “the power of two random choices” [10], to improve the storage efficiency of practical systems. Theoretical analysis and simulation results show that our load-balancing modulation codes can provide significant gain to practical flash memory storage systems. Though pseudo-random, our approach achieves the same load-balancing performance, for i.i.d. inputs, as a purely random approach based on the power of two random choices.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"7 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114108094","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

Stability of networks under general file size distribution with alpha fair rate allocation 基于alpha公平速率分配的一般文件大小分布下网络的稳定性

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394857

F. Paganini, Andres Ferragut Ao Tangt, L. Andrew, L. Andrew

引用次数: 5

Generalizing Kronecker graphs in order to model searchable networks 泛化Kronecker图以建立可搜索网络模型

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394816

E. Bodine, B. Hassibi, A. Wierman

引用次数: 4

Distributed localization and tracking with coordinated and uncoordinated motion models 基于协调和不协调运动模型的分布式定位和跟踪

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394801

U. Khan, S. Kar, J. Moura

引用次数: 12