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

2009 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
On the rate-limited Gelfand-Pinsker problem 关于速率受限的Gelfand-Pinsker问题
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205681
R. Tandon, S. Ulukus
{"title":"On the rate-limited Gelfand-Pinsker problem","authors":"R. Tandon, S. Ulukus","doi":"10.1109/ISIT.2009.5205681","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205681","url":null,"abstract":"We study a rate-limited version of the well known problem of coding for channels with random parameters which was studied by Gelfand and Pinsker [1]. In particular, we consider a state-dependent channel when the transmitter is supplied with the state information at a rate Re. We obtain a new upper bound on the capacity, C(Re), for this channel. We explicitly evaluate this upper bound for the rate-limited dirty paper coding (DPC) problem and show that it strictly improves upon the DPC capacity for certain values of Re.","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":"129999786","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
Binary weight distribution of non-binary LDPC codes 非二进制 LDPC 码的二进制权重分布
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205662
I. Andriyanova, V. Rathi, Vishwambhar Tillich
{"title":"Binary weight distribution of non-binary LDPC codes","authors":"I. Andriyanova, V. Rathi, Vishwambhar Tillich","doi":"10.1109/ISIT.2009.5205662","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205662","url":null,"abstract":"This paper is the first part of an investigation if the capacity of a binary-input memoryless symmetric channel under ML decoding can be achieved asymptotically by using non-binary LDPC codes. We consider (l, r)-regular LDPC codes both over finite fields and over the general linear group and compute their asymptotic binary weight distributions in the limit of large blocklength and of large alphabet size. A surprising fact, the average binary weight distributions that we obtain do not tend to the binomial one for values of normalized binary weights ω smaller than 1−2−l=r. However, it does not mean that non-binary codes do not achieve the capacity asymptotically, but rather that there exists some exponentially small fraction of codes in the ensemble, which contains an exponentially large number of codewords of poor weight. The justification of this fact is beyond the scope of this paper and will be given in [1].","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"13 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":"130188988","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
Coding for two-user Gaussian MAC with PSK and PAM signal sets 基于PSK和PAM信号集的二用户高斯MAC编码
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205440
J. Harshan, B. Rajan
{"title":"Coding for two-user Gaussian MAC with PSK and PAM signal sets","authors":"J. Harshan, B. Rajan","doi":"10.1109/ISIT.2009.5205440","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205440","url":null,"abstract":"Constellation Constrained (CC) capacity regions of a two-user Gaussian Multiple Access Channel (GMAC) have been recently reported. For such a channel, code pairs based on trellis coded modulation are proposed in this paper with M-PSK and M-PAM alphabet pairs, for arbitrary values of M; to achieve sum rates close to the CC sum capacity of the GMAC. In particular, the structure of the sum alphabets of M-PSK and M-PAM alphabet pairs are exploited to prove that, for certain angles of rotation between the alphabets, Ungerboeck labelling on the trellis of each user maximizes the guaranteed squared Euclidean distance of the sum trellis. Hence, such a labelling scheme can be used systematically to construct trellis code pairs to achieve sum rates close to the CC sum capacity. More importantly, it is shown for the first time that ML decoding complexity at the destination is significantly reduced when M-PAM alphabet pairs are employed with almost no loss in the sum capacity.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"86 16 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":"130470168","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}
引用次数: 14
New group shuffled BP decoding algorithms for LDPC codes 新组洗牌BP解码算法的LDPC码
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205781
Yu-Liang Chen, Chang-Ming Lee, Y. Su, Chi-Yuan Chang
{"title":"New group shuffled BP decoding algorithms for LDPC codes","authors":"Yu-Liang Chen, Chang-Ming Lee, Y. Su, Chi-Yuan Chang","doi":"10.1109/ISIT.2009.5205781","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205781","url":null,"abstract":"Implementing a belief propagation (BP) based LDPC decoder requires high degrees of parallelism using many component soft-in soft-output (SISO) decoding units to perform message passing from variable nodes to check nodes or vice versa. An obvious complexity-reduction solution is to serialize the decoding process, i.e., dividing a decoding iteration into several serial sub-iterations in which a sub-iteration performs only part of the complete parallel message-passing operation. The group horizontal shuffled BP (GHSBP) and vertical shuffled BP (GVSBP) algorithms respectively partition the check and variable nodes of the code graph into groups to perform group-by-group message-passing decoding. This paper proposes new techniques to improve three key elements of a GHSBP decoding algorithm, namely, the grouping method, the decoding schedule and the log-likelihood updating formulae. The (check nodes) grouping method and decoding schedule optimize certain design criterion. The new normalized min-sum updating formula with a self-adjustable correction (scaling) factor offers better nonlinear approximation. Numerical performance of new GHSBP algorithms that include part or all three new techniques indicate that the combination of the proposed grouping and decoding schedule yields a faster convergence rate and our modified min-sum algorithm gives performance superior to that of the conventional min-sum and normalized min-sum algorithm and is very close to that of the sum-product algorithm.","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":"134198615","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
Secrecy capacity region of the Gaussian multi-receiver wiretap channel 高斯多接收机窃听信道的保密容量区域
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205959
E. Ekrem, S. Ulukus
{"title":"Secrecy capacity region of the Gaussian multi-receiver wiretap channel","authors":"E. Ekrem, S. Ulukus","doi":"10.1109/ISIT.2009.5205959","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205959","url":null,"abstract":"We consider the Gaussian multi-receiver wiretap channel and evaluate its secrecy capacity region. This evaluation requires the identification of underlying auxiliary random variables. For this purpose, we first visit the converse proof of the scalar Gaussian broadcast channel, and show that this proof cannot be extended to this secrecy context. The failure of this extension comes from the insufficiency of the entropy-power inequality to resolve the ambiguity regarding the auxiliary random variables. Instead, we provide two converse proofs. The first one uses the alternative representation of the mutual information as an integration of the minimum-mean-square-error (MMSE) along with the properties of the MMSE. The second one uses the relationship between the differential entropy and the Fisher information via the de Bruin identity along with the properties of the Fisher information.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"25 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":"134100956","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}
引用次数: 23
Protection matching: A new scheduling rule for improved design of BICM-ID systems 保护匹配:改进BICM-ID系统设计的一种新的调度规则
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5206048
Jian-Jia Weng, Chung-hsuan Wang
{"title":"Protection matching: A new scheduling rule for improved design of BICM-ID systems","authors":"Jian-Jia Weng, Chung-hsuan Wang","doi":"10.1109/ISIT.2009.5206048","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5206048","url":null,"abstract":"Bit-interleaved coded modulation with iterative decoding (BICM-ID) has been verified to be a powerful transmission scheme with remarkable bit-error-rate performance. Among those well-designed BICM-ID systems, we observe that some of the channel encoders and signal mappers are inherently with the capability of multilevel protection. A new scheduling rule called protection matching which can properly schedule the data flow between the channel encoder and signal mapper with respect to the multilevel protection capability is proposed to achieve further performance improvement. Not only theoretical analysis but also simulation results are given to verify the advantage of the proposed design.","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":"131585553","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
Optimal variable-weight optical orthogonal codes via cyclic difference families 基于循环差分族的最优变权光正交码
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205754
Hengchao Li, P. Fan, Dianhua Wu, P. Udaya
{"title":"Optimal variable-weight optical orthogonal codes via cyclic difference families","authors":"Hengchao Li, P. Fan, Dianhua Wu, P. Udaya","doi":"10.1109/ISIT.2009.5205754","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205754","url":null,"abstract":"Variable-weight optical orthogonal code (OOC) was introduced by G-C Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this paper, a construction for optimal variable-weight OOCs via cyclic difference families is given. Several new constructions for cyclic difference families are also given. By using these constructions, new optimal (n, W, 1, Q)-OOCs for 2 ¿ |W| ¿ 4 are constructed.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"12 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":"131784876","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}
引用次数: 18
Capture analysis in wireless radio systems with multi-packet reception capabilities 具有多包接收能力的无线无线电系统中的捕获分析
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205700
A. Zanella, R. Rao, M. Zorzi
{"title":"Capture analysis in wireless radio systems with multi-packet reception capabilities","authors":"A. Zanella, R. Rao, M. Zorzi","doi":"10.1109/ISIT.2009.5205700","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205700","url":null,"abstract":"In this paper, we address the problem of computing the probability that r out of n interfering signals can be correctly received in a random access wireless system with capture. We extend previous results on the capture probability computation, and provide an expression for the distribution of the number of captured packets that is scalable with n and r. We also provide an approximate expression, that is much easier to compute and provides good results for r = 0 and r = n. Finally, we study the dependence of the system throughput performance on the multi-packet reception capabilities of the receiver.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"51 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":"129404155","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}
引用次数: 8
New quaternary sequences with optimal autocorrelation 具有最优自相关的新四元序列
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205276
Young-Sik Kim, Jiwoong Jang, Sang-Hyo Kim, Jong-Seon No
{"title":"New quaternary sequences with optimal autocorrelation","authors":"Young-Sik Kim, Jiwoong Jang, Sang-Hyo Kim, Jong-Seon No","doi":"10.1109/ISIT.2009.5205276","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205276","url":null,"abstract":"We propose a new construction of quaternary sequences using the reverse Gray mapping of a pair of binary Sidel'nikov sequences. The proposed construction provides sequences of even period N with the maximum nontrivial auto-correlation magnitude, Rmax = 2. For N ≡ 0 mod 4, the new quaternary sequences have the optimal Rmax = 2 and are almost-balanced in contrast to the only earlier optimal construction Sj [1].","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"29 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":"130886615","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}
引用次数: 28
Noisy feedback improves the BSC reliability function 噪声反馈提高了平衡计分卡的可靠性
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205852
Hirosuke Yamamoto, M. Burnashev
{"title":"Noisy feedback improves the BSC reliability function","authors":"Hirosuke Yamamoto, M. Burnashev","doi":"10.1109/ISIT.2009.5205852","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205852","url":null,"abstract":"For the information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that feedback channel. The overall transmission time is fixed. The transmission of a exponential number of messages (i.e. the transmission rate is positive) is considered. The achievable decoding error exponent for such a combination of channels is investigated. It is shown that if the crossover probability of the feedback channel is less than a certain positive value, then the achievable error exponent is better than the best known lower bound for the error exponent of the no-feedback channel.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"195 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":"131080233","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}
引用次数: 13
首页 上一页 下一页 尾页
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学术官方微信