2009 IEEE International Symposium on Information Theory最新文献_第7页

One family of algebraic codes for network coding 网络编码的一类代数码

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205280

M. Bossert, E. Gabidulin

引用次数: 16

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205812

Naveen Goela, M. Gastpar

{"title":"Linear compressive networks","authors":"Naveen Goela, M. Gastpar","doi":"10.1109/ISIT.2009.5205812","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205812","url":null,"abstract":"A linear compressive network (LCN) is defined as a graph of sensors in which each encoding sensor compresses incoming jointly Gaussian random signals and transmits (potentially) low-dimensional linear projections to neighbors over a noisy uncoded channel. Each sensor has a maximum power to allocate over signal subspaces. The networks of focus are acyclic, directed graphs with multiple sources and multiple destinations. LCN pathways lead to decoding leaf nodes that estimate linear functions of the original high dimensional sources by minimizing a mean squared error (MSE) distortion cost function. An iterative optimization of local compressive matrices for all graph nodes is developed using an optimal quadratically constrained quadratic program (QCQP) step. The performance of the optimization is marked by power-compression-distortion spectra, with converse bounds based on cut-set arguments. Examples include single layer and multi-layer (e.g. p-layer tree cascades, butterfly) networks. The LCN is a generalization of the Karhunen-Loève Transform to noisy multi-layer networks, and extends previous approaches for point-to-point and distributed compression-estimation of Gaussian signals. The framework relates to network coding in the noiseless case, and uncoded transmission in the noisy case.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115789789","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

Communication by sleeping: Optimizing a relay channel under wake and transmit power costs 休眠通信:在唤醒和传输功耗下优化中继信道

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205616

V. Prabhakaran, P. Kumar

引用次数: 4

On the capacity of multi-user cognitive radio networks 多用户认知无线网络容量研究

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205697

S. Vishwanath, A. Jafarian

引用次数: 14

Eigen-beamforming with delayed feedback and channel prediction 具有延迟反馈和信道预测的本征波束形成

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205744

T. Ramya, S. Bhashyam

{"title":"Eigen-beamforming with delayed feedback and channel prediction","authors":"T. Ramya, S. Bhashyam","doi":"10.1109/ISIT.2009.5205744","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205744","url":null,"abstract":"Adaptive transmit beamforming based on channel state information (CSI) is a key feature in next generation wireless cellular systems. However, CSI available for adaptation is imperfect due to feedback delay and estimation errors. In this work, we analyze the outage performance of maximum eigen-mode beamforming with imperfect CSI. First we analyze the outage probability in terms of the correlation coefficient ρ between the CSI available at the transmitter (CSIT) and the CSI available at the receiver (CSIR). The analysis shows that feedback delay leads to significant degradation at medium and high signal-to-noise ratios (SNR). Furthermore, the effect of delay can be overcome only if ρ tends to one with increasing SNR. Then, we study whether linear minimum mean squared error (MMSE) prediction can achieve the required behavior in ρ. The length of the prediction filter required is numerically evaluated and shown to increase with SNR. Finally, the asymptotic diversity order is analyzed as a function of the rate at which 1 − ρ approaches 0 as the SNR → ∞. Results show that for 1 − ρ proportional to SNR−1, the asymptotic diversity order remains unaltered.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123798514","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

An algorithm for computing bidirectional minimal polynomials for multisequences 一种计算多序列双向最小多项式的算法

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205701

Li-Ping Wang

引用次数: 1

Design of close to optimal Euclidean distance MIMO-precoders 接近最优欧氏距离mimo预编码器的设计

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205956

F. Rusek, Dzevdan Kapetanovic

引用次数: 10

Delay-optimal distributed power and transmission threshold control for S-ALOHA network with FSMC fading channels 基于FSMC衰落信道的S-ALOHA网络延迟最优分布式功率和传输阈值控制

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205689

Huang Huang, V. Lau

{"title":"Delay-optimal distributed power and transmission threshold control for S-ALOHA network with FSMC fading channels","authors":"Huang Huang, V. Lau","doi":"10.1109/ISIT.2009.5205689","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205689","url":null,"abstract":"This paper considers the delay-optimal power and transmission threshold control design in S-ALOHA network with FSMC fading channels. The random access system consists of an access point with K competing users, each has access to the local channel state information (CSI) and queue state information (QSI) as well as the common feedback (ACK/NAK/Collision) from the access point. We seek to derive the delay-optimal control policy (composed of threshold and power control) in symmetric network. The optimization problem belongs to the special memoryless policy case of K-agent infinite horizon decentralized Markov decision process (DEC-MDP), and finding the optimal memoryless policy is shown to be computationally challenging. To obtain a feasible and low complexity solution, we recast the optimization problem into two subproblems, namely the power control problem and the threshold control problem. For a given threshold control policy, the power control problem is decomposed into a reduced state MDP for single user so that the overall complexity is O(NJ), where N and J are the buffer size and the cardinality of the CSI states. For the threshold control problem, we exploit some special structure of the collision channel and common feedback information to derive a low complexity solution. The delay performance of the proposed design is shown to have substantial gain relative to conventional throughput optimal approaches for S-ALOHA.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127924827","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

Secure coding over networks 网络上的安全编码

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205251

Jin Xu, Biao Chen

引用次数: 2

New quaternary sequences with ideal autocorrelation constructed from binary sequences with ideal autocorrelation 从具有理想自相关的二值序列出发，构造了新的具有理想自相关的四元序列

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205807

Jiwoong Jang, Jong-Seon No, Young-Sik Kim, Sang-Hyo Kim

引用次数: 32