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

2007 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
A lower bound for generalized superimposed codes with application to group testing with inhibitors 广义叠加码的下界及其在抑制剂群检验中的应用
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557249
Annalisa De Bonis
{"title":"A lower bound for generalized superimposed codes with application to group testing with inhibitors","authors":"Annalisa De Bonis","doi":"10.1109/ISIT.2007.4557249","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557249","url":null,"abstract":"It has been introduced a new generalization of superimposed codes that finds application to the design of efficient algorithms for a variant of group testing known as group testing with inhibitors (GTI). Families associated to these codes have the property that for every q + Sigma<sub>i=1</sub> <sup>s</sup> p<sub>i</sub> pairwise different members F<sub>1</sub> <sup>1</sup>,hellip,F<sub>p1</sub> <sup>1</sup>,hellip, F<sub>1</sub> <sup>s</sup>,hellip,F<sub>ps</sub> <sup>s</sup>,G<sub>1</sub>, hellip,G<sub>q</sub> of the family it holds cap<sub>i=1</sub> <sup>s</sup> cup<sub>j=1</sub> <sup>pi</sup> F<sub>j</sub> <sup>i</sup> nsube cup<sub>i=1</sub> <sup>q</sup> G<sub>j</sub>. In this paper we present a lower bound on the minimum length of the generalized superimposed codes of A. De Bonis.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120963533","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
New Results on the Reliability Function of the Gaussian Channel 高斯信道可靠性函数的新结果
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557270
M. Burnashev
{"title":"New Results on the Reliability Function of the Gaussian Channel","authors":"M. Burnashev","doi":"10.1109/ISIT.2007.4557270","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557270","url":null,"abstract":"A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows both low and high rate cases to be treated in a unified way. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121100990","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
Estimation of the Frequency of Sinusoidal Signals in Laplace Noise 正弦信号在拉普拉斯噪声中的频率估计
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557480
Ta‐Hsin Li, K. Song
{"title":"Estimation of the Frequency of Sinusoidal Signals in Laplace Noise","authors":"Ta‐Hsin Li, K. Song","doi":"10.1109/ISIT.2007.4557480","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557480","url":null,"abstract":"Accurate estimation of the frequency of sinusoidal signals from noisy observations is an important problem in signal processing applications such as radar, sonar, and telecommunications. In this paper, we study the problem under the assumption of non-Gaussian noise in general and Laplace noise in particular. We prove that the Laplace maximum likelihood estimator is able to attain the asymptotic Cramer-Rao lower bound under the Laplace assumption which is one half of the Cramer-Rao lower bound in the Gaussian case. This provides the possibility of improving the currently most efficient methods such as nonlinear least-squares and periodogram maximization in non-Gaussian cases. We propose a computational procedure that overcomes the difficulty of local extrema in the likelihood function when computing the maximum likelihood estimator. We also provide some simulation results to validate the proposed approach.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123777859","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
The Capacity Region for Multi-source Multi-sink Network Coding 多源多汇聚网络编码的容量区域
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557213
Xijin Yan, R. Yeung, Zhen Zhang
{"title":"The Capacity Region for Multi-source Multi-sink Network Coding","authors":"Xijin Yan, R. Yeung, Zhen Zhang","doi":"10.1109/ISIT.2007.4557213","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557213","url":null,"abstract":"The capacity problem for general acyclic multi- source multi-sink networks with arbitrary transmission requirements has been studied by L. Song, et al (2003). Specifically, inner and outer bounds of the capacity region were derived respectively in terms of Gamman* and Gamma macrn*, the fundamental regions of the entropy function. In this paper, we show that by carefully bounding the constrained regions in the entropy space, we obtain the exact characterization of the capacity region, thus closing the existing gap between the above inner and outer bounds.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123831757","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}
引用次数: 100
Robust Codes for 2×2 MIMO Block Fading Channels 2×2 MIMO块衰落信道的鲁棒编码
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557614
E. Viterbo, Y. Hong
{"title":"Robust Codes for 2×2 MIMO Block Fading Channels","authors":"E. Viterbo, Y. Hong","doi":"10.1109/ISIT.2007.4557614","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557614","url":null,"abstract":"Golden space-time trellis coded modulation (GST-TCM) scheme was proposed in [1] for a high rate 2times2 multiple- input multiple-output (MIMO) system over slow fading channels. In this paper, we present the design criteria of GST-TCM over general block fading channels, where the channel matrix is constant over a fraction of the codeword length and varies from one fraction to another independently. However, the code construction and optimization can be difficult to implement. We therefore analyze the performance of GST-TCM for slow fading over block fading channels. The impact of the block fading channel on the code performance is analyzed using a truncated Union Bound technique. We finally show both analytically and by simulation that the GST-TCM designed for slow fading channels are indeed robust to various channel conditions. This feature is particularly useful for transmission over multipath channels using multicarrier modulation such as OFDM.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125023382","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
Evolution Analysis of Iterative LMMSE-APP Detection for Coded Linear System with Cyclic Prefixes 循环前缀编码线性系统迭代LMMSE-APP检测的演化分析
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557206
Xiaojun Yuan, Qinghua Guo, L. Ping
{"title":"Evolution Analysis of Iterative LMMSE-APP Detection for Coded Linear System with Cyclic Prefixes","authors":"Xiaojun Yuan, Qinghua Guo, L. Ping","doi":"10.1109/ISIT.2007.4557206","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557206","url":null,"abstract":"This paper is concerned with the iterative detection principles for coded linear systems with cyclic prefixes. We derive a matrix-form low-cost fast Fourier transform (FFT) based iterative LMMSE-APP detector and propose an evolution technique for the performance evaluation of the proposed detector. Numerical results show a good match between simulation and evolution prediction.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116769153","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
Statistical Dependence in Biological Sequences 生物序列的统计依赖性
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557183
H. Aktulga, Ioannis Kontoyiannis, L. A. Lyznik, Lukasz Szpankowski, A. Grama, W. Szpankowski
{"title":"Statistical Dependence in Biological Sequences","authors":"H. Aktulga, Ioannis Kontoyiannis, L. A. Lyznik, Lukasz Szpankowski, A. Grama, W. Szpankowski","doi":"10.1109/ISIT.2007.4557183","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557183","url":null,"abstract":"We demonstrate the use of information-theoretic tools for the task of identifying segments of biomolecules (DNA or RNA) that are statistically correlated. We develop a precise and reliable methodology, based on the notion of mutual information, for finding and extracting statistical as well as structural ependencies. A simple threshold function is defined, and its use in quantifying the level of significance of dependencies between biological segments is explored. These tools are used in two specific applications. First, for the identification of correlations between different parts of the maize zmSRp32 gene. There, we find significant dependencies between the 5' untranslated region and its alternatively spliced exons. This observation may indicate the presence of as-yet unknown alternative splicing mechanisms or structural scaffolds. Second, using data from CODIS, we demonstrate that our approach is well suited for the problem of discovering short tandem repeats (STRs).","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125104279","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
AF and DF Protocols based on Alamouti ST Code 基于Alamouti ST码的AF和DF协议
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557137
Charlotte Hucher, G. R. Othman, J. Belfiore
{"title":"AF and DF Protocols based on Alamouti ST Code","authors":"Charlotte Hucher, G. R. Othman, J. Belfiore","doi":"10.1109/ISIT.2007.4557137","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557137","url":null,"abstract":"In this work we propose a new amplify-and-forward (AF) protocol and a new decode-and-forward (DF) protocol based on the Alamouti space-time (ST) code, chosen because of its decoding simplicity. We also apply a new selection criterion for AF and DF protocols that improves their performance and solves the problem of bad performance at low SNR. Finally, we apply the Alamouti AF and DF protocols to a \"non-line-of-sight\" (NLOS) scheme to bring diversity. Outage probabilities and simulation results show that at low spectral efficiency, in spite of their rate of 1/2 symbol per channel use, these Alamouti AF and DF protocols have better performance than the non-orthogonal AF (NAF) protocol.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128041057","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}
引用次数: 45
A Criterion and Design for Space-Time Block Codes Achieving Full Diversity With Linear Receivers 利用线性接收机实现空时分组码全分集的准则与设计
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557659
Yue Shang, X. Xia
{"title":"A Criterion and Design for Space-Time Block Codes Achieving Full Diversity With Linear Receivers","authors":"Yue Shang, X. Xia","doi":"10.1109/ISIT.2007.4557659","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557659","url":null,"abstract":"In most of the existing space-time code designs, achieving full diversity is based on maximum-likelihood (ML) decoding at the receiver that is usually computationally expensive and may not have soft outputs. Recently, Zhang-Liu-Wong introduced Toeplitz codes and showed that Toeplitz codes achieve full diversity when a linear receiver, zero-forcing (ZF) or minimum mean square error (MMSE) receiver, is used. Motivated from Zhang-Liu-Wong's results on Toeplitz codes, in this paper, we propose a design criterion for space-time block codes (STBC), in which information symbols and their complex conjugates are linearly embedded, to achieve full diversity when ZF or MMSE receiver is used. Subsequently, we propose a novel family of STBC that satisfy the criterion and thus achieve full diversity with ZF or MMSE receiver. Our newly proposed STBC are constructed by overlapping the 2times2 Alamouti code and hence named overlapped Alamouti codes in this paper. The new codes are close to orthogonal while their symbol rates can approach 1 for any number of transmit antennas. Simulation results show that overlapped Alamouti codes significantly outperform Toeplitz codes for all numbers of transmit antennas and also outperform orthogonal STBC (OSTBC) when the number of transmit antennas is above 4.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"922 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132367313","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
Communication with Feedback via Posterior Matching 基于后验匹配的反馈通信
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557257
O. Shayevitz, M. Feder
{"title":"Communication with Feedback via Posterior Matching","authors":"O. Shayevitz, M. Feder","doi":"10.1109/ISIT.2007.4557257","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557257","url":null,"abstract":"In this paper we describe a general algorithmic scheme for communication over any memoryless channel in the presence of noiseless feedback. The scheme is based on the idea of posterior matching, in which the information still missing at the receiver is extracted from the a-posteriori density function, and matched to any desirable input distribution. We analyze the error probability attained by this scheme for additive noise channels, and show that the well-known Schalkwijk-Kailath scheme for the AWGN channel with average power constraint and the Horstein scheme for the BSC, can be derived as special cases.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122634886","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}
引用次数: 60
首页 上一页 下一页 尾页
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学术官方微信