发布求助
文献互助 智能选刊 最新文献

2009 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Capacity of compound state-dependent channels with states known at the transmitter 在发射机已知状态的复合状态相关信道的容量
2009 IEEE International Symposium on Information Theory Pub Date : 2010-04-27 DOI: 10.1109/ISIT.2009.5205682
P. Piantanida, S. Shamai
{"title":"Capacity of compound state-dependent channels with states known at the transmitter","authors":"P. Piantanida, S. Shamai","doi":"10.1109/ISIT.2009.5205682","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205682","url":null,"abstract":"The problem of sending information over compound state-dependent channels with non-causal state information available at only the transmitter is investigated. We prove a coding theorem and its strong converse establishing the capacity of this scenario for the case of discrete memoryless channels. Specific results are derived for additive white Gaussian noise channels corrupted by an additive Gaussian interference which is available at the transmitter only. We focus on the case where such interference may be absent on the channel, but the transmitter is unaware of this. Applications of the compound channels with non-causal state information arise in the context of multicast and cognitive radio channels, broadcast channels with imperfect channel knowledge and robust dirty-paper coding.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127741498","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}
引用次数: 11
Small-sample distribution estimation over sticky channels 粘性通道上的小样本分布估计
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5206020
Farzad Farnoud, O. Milenkovic, N. Santhanam
{"title":"Small-sample distribution estimation over sticky channels","authors":"Farzad Farnoud, O. Milenkovic, N. Santhanam","doi":"10.1109/ISIT.2009.5206020","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5206020","url":null,"abstract":"We consider the problem of estimating unknown source distributions based on a small number of possibly erroneous observations. Errors are modeled as arising from sticky channels, which introduce repetitions of transmitted source symbols. Both the problems of estimating the distribution for known and unknown channel parameters are considered. We propose three heuristic algorithms and a method based on Expectation-Maximization for solving the problem. These algorithms represent a combination of iterative optimization techniques and Good-Turing estimators.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"251 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":"115590245","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}
引用次数: 10
On multicasting with streaming burst-erasure codes 用流式突发擦除码进行多播
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205380
J. Singh, A. Khisti
{"title":"On multicasting with streaming burst-erasure codes","authors":"J. Singh, A. Khisti","doi":"10.1109/ISIT.2009.5205380","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205380","url":null,"abstract":"We study a multicast extension of streaming burst-erasure codes previously proposed for the single user setting. There are two receivers each interested in the common stream. Each receiver's channel however has a different burst parameter and likewise each receiver tolerates a different delay; both receivers are interested in a common stream. We develop two upper bounding approaches on the streaming multicast capacity. The first upper bound is developed by introducing an erasure channel that introduces periodic erasure bursts, which can corrected due to the multicast property. The second upper bound is based on information theoretic inequalities and is tight at the minimum delay point. Finally we propose a simple multicast code construction by combining the parity checks of two single-user codes.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"18 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":"115607989","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}
引用次数: 16
On secrecy capacity per unit cost 单位成本保密能力
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205922
Mustafa El-Halabi, Tie Liu, C. Georghiades
{"title":"On secrecy capacity per unit cost","authors":"Mustafa El-Halabi, Tie Liu, C. Georghiades","doi":"10.1109/ISIT.2009.5205922","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205922","url":null,"abstract":"The concept of channel capacity per unit cost was introduced by Verdú in 1990 to study the limits of wideband communication. It was shown that an orthogonal coding scheme achieves the channel capacity per unit cost of memoryless stationary channels with a zero-cost input letter. This paper introduces the concept of secrecy capacity per unit cost to study wideband secrecy communications. For degraded memoryless stationary wiretap channels, it is shown that an orthogonal coding scheme achieves the secrecy capacity per unit cost with a zero-cost input letter. For general memoryless stationary wiretap channels, the performance of orthogonal codes is studied and lower and upper bounds on the secrecy capacity per unit cost are provided.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"82 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":"115705197","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}
引用次数: 4
Quadrature partial response signaling based on Alamouti Code 基于Alamouti代码的正交部分响应信令
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205629
Kyoung-Young Song, Jae-Dong Yang, Xianglan Jin, Jong-Seon No, Habong Chung
{"title":"Quadrature partial response signaling based on Alamouti Code","authors":"Kyoung-Young Song, Jae-Dong Yang, Xianglan Jin, Jong-Seon No, Habong Chung","doi":"10.1109/ISIT.2009.5205629","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205629","url":null,"abstract":"In this paper, the Alamouti code combined with partial response signaling (PRS) is proposed. The bit error rate of the proposed quadrature PRS (QPRS) Alamouti code is derived for the quasi-static Rayleigh fading and additive white Gaussian noise channel. Furthermore, its performance in a severely bandlimited channel is simulated by using chopping filter and compared with the conventional Alamouti code. The numerical results show that the proposed QPRS Alamouti code outperforms the conventional Alamouti code under the chopping environment.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"124 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":"124798186","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
Bounds and capacity results for the cognitive Z-interference channel 认知z干扰信道的边界和容量结果
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5206030
Nan Liu, I. Marić, A. Goldsmith, S. Shamai
{"title":"Bounds and capacity results for the cognitive Z-interference channel","authors":"Nan Liu, I. Marić, A. Goldsmith, S. Shamai","doi":"10.1109/ISIT.2009.5206030","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5206030","url":null,"abstract":"We study the discrete memoryless Z-interference channel (ZIC) where the transmitter of the pair that suffers from interference is cognitive. We first provide upper and lower bounds on the capacity of this channel. We then show that, when the channel of the transmitter-receiver pair that does not face interference is noiseless, the two bounds coincide and therefore define the capacity region. The obtained results imply that, unlike in the Gaussian cognitive ZIC, in the considered channel superposition encoding at the non-cognitive transmitter as well as Gel'fand-Pinsker encoding at the cognitive transmitter are needed in order to minimize the impact of interference. As a byproduct of the obtained capacity region, we obtain the capacity result for a generalized Gel'fand-Pinsker problem.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"36 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":"125078387","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}
引用次数: 24
On channel estimation in fast fading mobile coded MIMO OFDM 快衰落移动编码MIMO OFDM中的信道估计
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205639
D. Liu, M. Fitz, U. Mitra
{"title":"On channel estimation in fast fading mobile coded MIMO OFDM","authors":"D. Liu, M. Fitz, U. Mitra","doi":"10.1109/ISIT.2009.5205639","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205639","url":null,"abstract":"Channel estimation of coded multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) in fast time-varying channels are considered. Maintaining high performance with manageable complexity relies on iterative soft-in soft-out equalization and decoding. Conventional frequency domain channel estimation methods have an irreducible error floor due to unaccounted intercarrier interference (ICI). This paper proposes an efficient and high performance time domain pilot symbol assisted modulation (PSAM) system for channel estimation. Simulation results are reported for the iterative receiver with application to the mobile worldwide interoperability for microwave access (WiMAX).","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"22 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":"123773969","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
Rank-constrained separable semidefinite programming for optimal beamforming design 最优波束形成设计的秩约束可分半定规划
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5206038
Yongwei Huang, D. Palomar
{"title":"Rank-constrained separable semidefinite programming for optimal beamforming design","authors":"Yongwei Huang, D. Palomar","doi":"10.1109/ISIT.2009.5206038","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5206038","url":null,"abstract":"Consider a downlink communication system where multi-antenna base stations transmit independent data streams to decentralized single-antenna users over a common frequency band. The goal of the base stations is to jointly adjust the beamforming vectors so as to minimize the transmission powers while ensuring the signal-to-interference-noise ratio (SINR) requirement of individual users within the system, and keeping lower interference level to other systems which operate in the same frequency band and in the same region. This optimal beamforming problem is a separable homogeneous quadratically constrained quadratical programming (QCQP), and it is difficult to solve in general. In this paper, we give conditions under which strong duality holds, and propose an efficient algorithm for the optimal beamforming problem. First, we study rank-constrained solutions of a general separable semidefinite programming (SDP), and propose a rank reduction procedure to achieve a lower rank solution. Then we show that the SDP relaxation of a class of the optimal beamforming problem has a rank-one solution, which can be obtained by invoking the rank reduction procedure.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"80 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":"125493766","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}
引用次数: 0
Nonlinear network code for high throughput broadcasting with retransmissions 具有重传的高吞吐量广播的非线性网络代码
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205268
Qiang Li, S. Ting, Chin Keong Ho
{"title":"Nonlinear network code for high throughput broadcasting with retransmissions","authors":"Qiang Li, S. Ting, Chin Keong Ho","doi":"10.1109/ISIT.2009.5205268","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205268","url":null,"abstract":"In a typical network coding scenario, a node has to broadcast a set of messages to a group of receiver nodes who have already received a subset of the messages through other links. In this paper, we will first present the achievable rate region for this broadcasting scenario, and then extend the result to the case with retransmissions. With the proposed nonlinear network coding strategy, the achievable rate region can be achieved without requiring the exact knowledge of a priori information available at the receiver nodes. The broadcasting node simply performs retransmissions with independent codebooks until every receiver node has received the whole set of messages. Through the analysis of network throughput, we will show that each receiver node is able to effectively accumulate mutual information over the multiple transmissions thus achieving higher overall throughput than the conventional random linear network coding strategy.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"21 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":"114908238","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}
引用次数: 12
Adaptive network coded retransmission scheme for wireless multicast 无线组播自适应网络编码重传方案
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205995
Sameh Sorour, S. Valaee
{"title":"Adaptive network coded retransmission scheme for wireless multicast","authors":"Sameh Sorour, S. Valaee","doi":"10.1109/ISIT.2009.5205995","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205995","url":null,"abstract":"In wireless multicast, the receivers are interested in obtaining only a subset of the packets transmitted by the access node. Consequently, it is intuitively assumed that random network coded packet retransmissions will result in a lower bandwidth efficiency compared to opportunistic network coded retransmissions as the former involves the delivery of unwanted packets. In the first part of this paper, we show, through simulations, that the random network coded retransmission (RNCR) scheme outperforms the opportunistic network coded retransmission (ONCR) scheme in terms of bandwidth efficiency in a wide range of multicast settings. Motivated by this result, we propose an adaptive algorithm that can dynamically select, from the RNCR and ONCR schemes, the one that is expected to achieve a better performance for each multicast frame. Simulation results show that the proposed algorithm almost achieves the optimal performance that can be obtained by combining these two retransmission schemes.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"96 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":"116105852","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
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信