2008 46th Annual Allerton Conference on Communication, Control, and Computing最新文献_第2页

Robust dimensionality reduction for high-dimension data 高维数据的鲁棒降维

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797709

Huan Xu, C. Caramanis, Shie Mannor

引用次数: 2

Reduced-complexity transmit power optimization techniques for multiuser MIMO with per-antenna power constraint 具有单天线功率约束的多用户MIMO低复杂度发射功率优化技术

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797532

Y. Ohwatari, A. Benjebbour, J. Hagiwara, T. Ohya

引用次数: 4

Anytime reliable transmission of real-valued information through digital noisy channels 通过数字噪声信道，随时可靠地传输实值信息

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1137/09074601X

G. Como, F. Fagnani, S. Zampieri

引用次数: 51

Toward an optimal 1+N protection strategy 向着最优的1+N保护策略

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797550

A. Kamal, O. Al-Kofahi

{"title":"Toward an optimal 1+N protection strategy","authors":"A. Kamal, O. Al-Kofahi","doi":"10.1109/ALLERTON.2008.4797550","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797550","url":null,"abstract":"This paper introduces an implementation of the network coding-based generalized 1+N protection technique presented earlier by the author in [1] to protect against single link failures. Instead of using two protection circuits for a group of connections which are to be protected together as in [1], only one protection circuit is used, which takes the form of a tree. The protection circuit carries linear combinations of the data units originally transmitted on the working circuits, and these linear combinations can be used to recover lost data due to link failures. This recovery is carried out with the assistance of one node on the protection tree, which is chosen to reduce the recovery time. Moreover, unlike the scheme in [1] which protects unidirectional connections, this scheme is used to protect bidirectional connections. This protection technique requires exactly the same amount of protection resources used by 1:N protection, and can therefore be considered as a step towards achieving optimal 1+N protection. The paper also makes a number of other contributions. It introduces an integer linear program (ILP) formulation to evaluate the cost of protection using this technique, and compares it to the cost of 1+1 protection. The comparison shows that a significant saving in cost can be achieved, while still recovering from failures within a short time.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124744227","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

Optimized puncturing and shortening distributions for nonbinary LDPC codes over the binary erasure channel 非二进制LDPC码在二进制擦除信道上的优化穿刺和缩短分布

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797675

D. Klinc, J. Ha, S. McLaughlin

引用次数: 7

Broadcasting with receiver message side information: A deterministic approach 使用接收方消息端的信息进行广播:一种确定性方法

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797632

Jae Won Yoo, Tie Liu, F. Xue

引用次数: 3

Convergence analysis of distributed subgradient methods over random networks 随机网络上分布亚梯度方法的收敛性分析

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797579

I. Lobel, A. Ozdaglar

引用次数: 57

Transmission of correlated sources over a fading multiple access channel 在衰落多址信道上相关源的传输

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797647

R. Rajesh, V. Sharma

引用次数: 7

Secure broadcasting : The secrecy rate region 安全广播:保密速率区域

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797644

Ghadamali Bagherikaram, A. Motahari, A. Khandani

{"title":"Secure broadcasting : The secrecy rate region","authors":"Ghadamali Bagherikaram, A. Motahari, A. Khandani","doi":"10.1109/ALLERTON.2008.4797644","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797644","url":null,"abstract":"In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, where individual secure messages are broadcast over open media and can be received by any illegitimate receiver. The secrecy level is measured by equivocation rate at the eavesdropper. We first study the general (non-degraded) broadcast channel with confidential messages. We present an inner bound on the secrecy capacity region for this model. The inner bound coding scheme is based on a combination of random binning and the Gelfand-Pinsker bining. This scheme matches the Marton's inner bound on the broadcast channel without confidentiality constraint. We further study the situation where the channels are degraded. For the degraded broadcast channel with confidential messages, we present the secrecy capacity region. Our achievable coding scheme is based on Cover's superposition scheme and random binning. We refer to this scheme as secret superposition scheme. In this scheme, we show that randomization in the first layer increases the secrecy rate of the second layer. This capacity region matches the capacity region of the degraded broadcast channel without security constraint. It also matches the secrecy capacity for the conventional wire-tap channel. Our converse proof is based on a combination of the converse proof of the conventional degraded broadcast channel and Csiszar lemma.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127386833","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}

引用次数: 39

Modeling distributed beamforming in wireless networks 无线网络中的分布式波束形成建模

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797596

K. Hardwick, D. Goeckel, D. Towsley

引用次数: 6