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

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.最新文献

筛选
英文 中文
Applications of sparse approximation in communications 稀疏逼近在通信中的应用
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523488
A. Gilbert, J. Tropp
{"title":"Applications of sparse approximation in communications","authors":"A. Gilbert, J. Tropp","doi":"10.1109/ISIT.2005.1523488","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523488","url":null,"abstract":"Sparse approximation problems abound in many scientific, mathematical, and engineering applications. These problems are defined by two competing notions: we approximate a signal vector as a linear combination of elementary atoms and we require that the approximation be both as accurate and as concise as possible. We introduce two natural and direct applications of these problems and algorithmic solutions in communications. We do so by constructing enhanced codebooks from base codebooks. We show that we can decode these enhanced codebooks in the presence of Gaussian noise. For MIMO wireless communication channels, we construct simultaneous sparse approximation problems and demonstrate that our algorithms can both decode the transmitted signals and estimate the channel parameters","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132850650","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}
引用次数: 30
Binary sequence sets with low correlation zone 具有低相关带的二值序列集
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523382
Jiwoong Jang, Jong-Seon No, Habong Chung, Xiaohu Tang
{"title":"Binary sequence sets with low correlation zone","authors":"Jiwoong Jang, Jong-Seon No, Habong Chung, Xiaohu Tang","doi":"10.1109/ISIT.2005.1523382","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523382","url":null,"abstract":"In this paper, for integers e and n such that e|n and 2e - 1 is a prime, we propose a method of constructing binary low correlation zone (LCZ) sequences of period 2n - 1 by using the extended form sequence with the same period. These new LCZ sequences use Legendre sequences as their column sequences","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133085991","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
On achievable rates of multistage decoding on two-dimensional ISi channels 二维ISi信道上多级解码的可实现率
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523562
J. Soriaga, P. Siegel, J. Wolf, M. Marrow
{"title":"On achievable rates of multistage decoding on two-dimensional ISi channels","authors":"J. Soriaga, P. Siegel, J. Wolf, M. Marrow","doi":"10.1109/ISIT.2005.1523562","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523562","url":null,"abstract":"The achievable information rates for multilevel coding (MLC) systems with multistage decoding (MSD) are examined on two-dimensional binary-input intersymbol interference (ISI) channels. One MSD scheme employs trellis-based detection, while another involves zero-forcing equalization and linear noise prediction. Information rates are determined by examining the output statistics at each stage of MSD. The first scheme is shown to achieve rates very close to known information-theoretic limits. Systems with low-density parity-check codes are then optimized to approach these rates","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127650444","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 coding strategies for the relay channel 中继信道的新编码策略
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523507
Hon-Fah Chong, M. Motani, H. K. Garg
{"title":"New coding strategies for the relay channel","authors":"Hon-Fah Chong, M. Motani, H. K. Garg","doi":"10.1109/ISIT.2005.1523507","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523507","url":null,"abstract":"This paper studies coding strategies for a three-node relay channel. We first review the basic coding strategies of Cover and El Gamal for the relay channel. Next, two new coding strategies superimposing cooperation and facilitation are developed. One of the coding strategies is shown to include the generalized strategy of Cover and El Gamal. For certain parameters of the Gaussian relay channel, the two new strategies give higher achievable rates than the generalized strategy of Cover and El Gamal","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115352259","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
Some exact union bound results for maximum likelihood detection in MIMO systems MIMO系统中最大似然检测的几个精确并界结果
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523742
G. Lindell
{"title":"Some exact union bound results for maximum likelihood detection in MIMO systems","authors":"G. Lindell","doi":"10.1109/ISIT.2005.1523742","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523742","url":null,"abstract":"In this paper we investigate some properties of the union bound for a basic MIMO system, assuming uncoded QAM transmission, uncorrelated Rayleigh fading, and maximum likelihood detection. The presented union bound results cover several choices of the number of transmitting and receiving antennas (up to 16). It is also illustrated how the pair-wise error probability approaches the Q( )-function as the number of receiving antennas increases","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124269478","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}
引用次数: 17
On the distance optimality of permutation mappings 论置换映射的距离最优性
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523503
T. Swart, Ian de Beer, H. C. Ferreira
{"title":"On the distance optimality of permutation mappings","authors":"T. Swart, Ian de Beer, H. C. Ferreira","doi":"10.1109/ISIT.2005.1523503","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523503","url":null,"abstract":"We investigate the optimal Hamming distance that is achievable when mapping binary sequences to permutation sequences. This is used to determine how close to optimum some of the known mappings are. Furthermore, using simulation results we show that mappings found by exhaustive search using optimum distance as criterion perform better than previous known mappings","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114474077","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}
引用次数: 15
Scalable feedback control for distributed beamforming in sensor networks 传感器网络中分布式波束形成的可扩展反馈控制
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523309
R. Mudumbai, J. Hespanha, Upamanyu Madhow, G. Barriac
{"title":"Scalable feedback control for distributed beamforming in sensor networks","authors":"R. Mudumbai, J. Hespanha, Upamanyu Madhow, G. Barriac","doi":"10.1109/ISIT.2005.1523309","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523309","url":null,"abstract":"Recent work has shown that large gains in communication capacity are achievable by distributed beamforming in sensor networks. The principal challenge in realizing these gains in practice, is in synchronizing the carrier signal of individual sensors in such a way that they combine coherently at the intended receiver. In this paper, we provide a scalable mechanism for achieving phase synchronization in completely distributed fashion, based only on feedback regarding the power of the net received signal. Insight into the workings of the protocol is obtained from a simple theoretical model that provides accurate performance estimates","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116897286","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}
引用次数: 171
Conservation of mutual and directed information 互信息和定向信息的守恒
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523313
J. Massey, P. Massey
{"title":"Conservation of mutual and directed information","authors":"J. Massey, P. Massey","doi":"10.1109/ISIT.2005.1523313","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523313","url":null,"abstract":"Two conservation laws for mutual information in terms of directed informations between two synchronized sequences of random variables are derived, the first for the case of no conditioning and the second for the case of causal conditioning on a third synchronized sequence. As a byproduct of the derivation of the first conservation law, the directed information specifying the feedback flowing from the second sequence to the first sequence is identified, which leads to a simple proof that a previously known sufficient condition for equality of mutual and directed information is also a necessary condition","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116916631","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}
引用次数: 104
Load balancing with migration penalties 带有迁移惩罚的负载平衡
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523397
V. Farias, C. Moallemi, B. Prabhakar
{"title":"Load balancing with migration penalties","authors":"V. Farias, C. Moallemi, B. Prabhakar","doi":"10.1109/ISIT.2005.1523397","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523397","url":null,"abstract":"Many practical systems perform load balancing. The main aim of load balancing is to utilize the capacity of a system of parallel processors efficiently and to reduce the delay of processing jobs. This paper is concerned with load balancing, or process migration, when there is a penalty associated with migration. We consider the following model: jobs arrive at each of n parallel servers. An arriving job can either be processed in a unit of time, on average, at the server where it arrives, or it can migrate to another server where it creates K ges 1 independent jobs. When K = 1, migrating jobs impose no extra cost and this problem is considered extensively in the literature. We are interested in the situation K > 1. The problem is to decide whether a job should migrate or not. On the one hand migration leads to load balancing and hence reduces backlogs. However, it also leads to the creation of extra work and, hence, to a potential loss of throughput. We ask: do there exist simple migration policies that can reduce backlogs while providing the highest throughput? Somewhat surprisingly, we find that policies like \"migrate to the least loaded server\" are unstable: they cause a loss of throughput. However, we find that a simple variant of this rule is stable and leads to a reduction of backlogs","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117235702","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
On designing error-correctable codes by biomolecular computation 基于生物分子计算的可纠错编码设计研究
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523775
Jian-Qin Liu, K. Shimohara
{"title":"On designing error-correctable codes by biomolecular computation","authors":"Jian-Qin Liu, K. Shimohara","doi":"10.1109/ISIT.2005.1523775","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523775","url":null,"abstract":"In this paper, we propose a new encoding algorithm and its corresponding decoding algorithm, which are designed by biomolecular computation based on the signaling pathways of Rho family GTPases. These algorithms can carry out encoding/decoding processes that are capable of correcting possible errors, and are expected to be realized by corresponding engineered cellular pathways according to their biochemical faithfulness","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117262469","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信