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

2008 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Knuth’s balancing of codewords revisited 高德纳对暗语的平衡重新审视
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595251
J. Weber, Kees A. Schouhamer Immink
{"title":"Knuth’s balancing of codewords revisited","authors":"J. Weber, Kees A. Schouhamer Immink","doi":"10.1109/ISIT.2008.4595251","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595251","url":null,"abstract":"In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of dasia1psilas and dasia-1psilas, called balanced codes. Knuthpsilas algorithm is, since look-up tables are absent, well suited for use with large codewords. The redundancy of Knuthpsilas balanced codes is a factor of two larger than that of a code comprising the full set of balanced codewords. In our paper we will present results of our attempts to improve the performance of Knuthpsilas balanced codes.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130268808","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}
引用次数: 20
Generalized extending method for construction of q-ary low correlation zone sequence sets 构造q元低相关带序列集的广义扩展方法
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595324
Jung-Soo Chung, Jong-Seon No, Young-Sik Kim, Jiwoong Jang, Habong Chung
{"title":"Generalized extending method for construction of q-ary low correlation zone sequence sets","authors":"Jung-Soo Chung, Jong-Seon No, Young-Sik Kim, Jiwoong Jang, Habong Chung","doi":"10.1109/ISIT.2008.4595324","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595324","url":null,"abstract":"In this paper, a new extending method of q-ary low correlation zone(LCZ) sequence sets is proposed, which is a generalization of binary LCZ sequence set by Kim, Jang, No, and Chung. Using this method, q-ary LCZ sequence set with parameters (N,M,L, isin) is extended as a q-ary LCZ sequence set with parameters (pN, pM, plfloor(L + 1)/plfloor - 1, pisin), where p is prime and p|q.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133918724","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
Network coding in star networks 星型网络中的网络编码
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595001
S. M. T. Yazdi, S. Savari, G. Kramer
{"title":"Network coding in star networks","authors":"S. M. T. Yazdi, S. Savari, G. Kramer","doi":"10.1109/ISIT.2008.4595001","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595001","url":null,"abstract":"We investigate network coding in star networks with multiple unicast sessions. We use entropy arguments to upper bound the simultaneous rates of communication among the different nodes in the network and prove that in many cases, the optimal network code is related to the combinatorial optimization problem of finding the maximum number of edge disjoint cycles in the demand graph of the network. Finally, we propose a polynomial time algorithm with linear binary operations that achieves the capacity in many cases.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131624370","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
A modified turbo principle for iterative detection and decoding 一种改进的迭代检测和解码turbo原理
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595030
Junyoung Nam, S. R. Kim, J. Ha
{"title":"A modified turbo principle for iterative detection and decoding","authors":"Junyoung Nam, S. R. Kim, J. Ha","doi":"10.1109/ISIT.2008.4595030","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595030","url":null,"abstract":"This paper presents a modified turbo principle (MTP) for iterative detection and decoding in multiple-antenna systems whose detector uses the max-log-MAP algorithm. The modified turbo principle intensionally introduces dependency between the messages of the max-log-MAP detector and the decoder. Our simulation results show that the proposed MTP significantly reduces the performance loss due to the suboptimal detection algorithm, max-log-MAP. We also substantiate our claims by analyzing the proposed MTP from an information theoretic perspective.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128942682","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
Slepian-Wolf coding with a mismatched decoder 睡狼编码与不匹配的解码器
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595223
Jun Chen, Dake He, A. Jagmohan
{"title":"Slepian-Wolf coding with a mismatched decoder","authors":"Jun Chen, Dake He, A. Jagmohan","doi":"10.1109/ISIT.2008.4595223","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595223","url":null,"abstract":"Slepian-Wolf coding with a mismatched decoding metric is studied. Two different dualities between Slepian-Wolf coding and channel coding under mismatched decoding are established. These two dualities provide a systematic framework for comparing linear Slepian-Wolf codes, nonlinear Slepian-Wolf codes, and variable-rate Slepian-Wolf codes. In contrast with the fact that linear codes suffice to achieve the Slepian-Wolf limit under matched decoding, the minimum rate achievable with linear Slepian-Wolf codes under mismatched decoding can be strictly higher than that achievable with nonlinear Slepian-Wolf codes.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130906040","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
Replica analysis of general multiuser detection in MIMO DS-CDMA channels with imperfect CSI 具有不完全CSI的MIMO DS-CDMA信道中一般多用户检测的副本分析
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595039
K. Takeuchi, Mikko Vehkaperä, Toshiyuki TANAKA, R. Müller
{"title":"Replica analysis of general multiuser detection in MIMO DS-CDMA channels with imperfect CSI","authors":"K. Takeuchi, Mikko Vehkaperä, Toshiyuki TANAKA, R. Müller","doi":"10.1109/ISIT.2008.4595039","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595039","url":null,"abstract":"We consider impacts of channel estimation errors on performance of general multiuser detectors in MIMO DS-CDMA channels. We evaluate their performance in terms of asymptotic spectral efficiency, which is obtained via decoupling structure, by using the replica method. Numerical results imply that the performance of LMMSE detection is very close to that of MMSE detection for small system loads. Furthermore, we find that the spectral efficiency of MMSE detection grows discontinuously with the length of pilot sequences for large system loads, and that the critical length is close to the optimal length. While it is indistinguishable from that of LMMSE detection for short pilot sequences, the gap between the two is significantly large if the length of pilot sequences is longer than the critical length.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132895364","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}
引用次数: 7
On the uniform continuity of the rate-distortion function 关于率失真函数的一致连续性
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595108
Hari Palaiyanur, A. Sahai
{"title":"On the uniform continuity of the rate-distortion function","authors":"Hari Palaiyanur, A. Sahai","doi":"10.1109/ISIT.2008.4595108","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595108","url":null,"abstract":"It is well known that the rate-distortion function for a finite alphabet IID source with distribution p, denoted R(p,D), is uniformly continuous in its arguments. We prove an explicit bound on |R(p,D) - R(q,D)| for distributions p, q in terms of the variational distance parp-qpar1. A simple and elementary proof shows that |R(p,D) - R(q,D)| = O(-parp - qpar1 log parp - qpar1), with constants depending on the distortion measure. The uniform continuity of the rate-distortion function has the same behavior as the uniform continuity of entropy in the order sense. The bounds are used for several applications. First, a simple sampling algorithm is presented to compute the rate-distortion function for an arbitrarily varying source to within a given accuracy. The uniform continuity bound is used here to roughly quantify the tradeoff between complexity and accuracy. Second, we comment on the problem of approximating the rate-distortion function for an unknown IID source to within a desired precision.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133652415","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
DMT of weighted parallel channels: Application to broadcast channels 加权并行信道的DMT:在广播信道中的应用
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595413
L. Mroueh, S. Rouquette-Léveil, G. R. Othman, J. Belfiore
{"title":"DMT of weighted parallel channels: Application to broadcast channels","authors":"L. Mroueh, S. Rouquette-Léveil, G. R. Othman, J. Belfiore","doi":"10.1109/ISIT.2008.4595413","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595413","url":null,"abstract":"In a broadcast channel with random packet arrival and transmission queues, the stability of the system is achieved by maximizing a weighted sum rate capacity with suitable weights that depend on the queue size. The weighted sum rate capacity using Dirty Paper Coding (DPC) and Zero Forcing (ZF) is asymptotically equivalent to the weighted sum capacity over parallel single-channels. In this paper, we study the Diversity Multiplexing Tradeoff (DMT) of the fading broadcast channel under a fixed weighted sum rate capacity constraint. The DMT of both identical and different parallel weighted MISO channels is first derived. Finally, we deduce the DMT of a broadcast channel using DPC and ZF precoders.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133673457","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
Sequential estimation of time-varying multipath channel for MIMO-OFDM systems MIMO-OFDM系统时变多径信道的顺序估计
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595054
Daniele Angelosante, E. Biglieri, M. Lops
{"title":"Sequential estimation of time-varying multipath channel for MIMO-OFDM systems","authors":"Daniele Angelosante, E. Biglieri, M. Lops","doi":"10.1109/ISIT.2008.4595054","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595054","url":null,"abstract":"In this paper, we introduce a pilot-aided multipath channel estimator for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. Typical estimation algorithms assume the number of multipath components and delays to be known and constant, while their amplitudes may vary in time. In this work, we focus on the more realistic assumption that also the number of channel taps is unknown and time-varying. The estimation problem arising from this assumption is solved using random set theory (RST), which is a probability theory of finite sets. Due to the lack of a closed form of the optimal filter, a Rao-Blackwellized particle filter (RBPF) implementation of the channel estimator is derived. Simulation results demonstrate the estimator effectiveness.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133172012","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
Notes on the automorphism groups of Reed Solomon binary images 关于Reed Solomon二元象的自同构群的注释
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595301
Fabian Lim, M. Fossorier, A. Kavcic
{"title":"Notes on the automorphism groups of Reed Solomon binary images","authors":"Fabian Lim, M. Fossorier, A. Kavcic","doi":"10.1109/ISIT.2008.4595301","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595301","url":null,"abstract":"In this paper, a new proof of the work by Lacan et. al is obtained. This approach led to newly discovered connections between the automorphism group of the Reed Solomon (RS) binary image, and elementary group theory. This new development facilitated proving the existence and constructing permutations that have not been previously reported in the literature. Simple special cases are then considered in this work.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134605206","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
首页 上一页 下一页 尾页
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学术官方微信