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

Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)最新文献

筛选
英文 中文
Distributive iterative method for minimizing generalized total square correlation of CDMA systems 最小化CDMA系统广义总平方相关的分配迭代法
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216701
P. Cotae
{"title":"Distributive iterative method for minimizing generalized total square correlation of CDMA systems","authors":"P. Cotae","doi":"10.1109/ITW.2003.1216701","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216701","url":null,"abstract":"We define the total generalized square correlation (TGSC) for a given signature sequence set used in code division multiple access (CDMA) systems in the presence of colored noise. Total square correlation (TSC) and total weighted correlation (TWSC) are particular cases of TGSC and are considered as well. We provide an iterative and distributed method for obtaining sequences that minimize TGSC. The method is based on majorization theory decreasing the weighted Frobenius norm associated with users' Gram signature matrix.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126765738","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
Convergence of the sum-product algorithm 和积算法的收敛性
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216735
S. Tatikonda
{"title":"Convergence of the sum-product algorithm","authors":"S. Tatikonda","doi":"10.1109/ITW.2003.1216735","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216735","url":null,"abstract":"We address the question of convergence in the sum-product algorithm. Specifically, we relate convergence of the sum-product algorithm to the existence of a weak limit for a sequence of Gibbs measures defined on the associated computation tree. Using tools from the theory of Gibbs measures we develop easily testable sufficient conditions for convergence. The failure of convergence of the sum-product algorithm implies the existence of multiple phases for the associated Gibbs specification. These results give new insight into the mechanics of the algorithm.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121560709","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}
引用次数: 32
Lower bounds on the existence of binary error-correcting variable-length codes 二进制纠错变长码存在性的下界
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216753
C. Lamy, F. Bergot
{"title":"Lower bounds on the existence of binary error-correcting variable-length codes","authors":"C. Lamy, F. Bergot","doi":"10.1109/ITW.2003.1216753","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216753","url":null,"abstract":"The paper deals with codes that combine source and channel encoding operations. After discussing the potential usefulness of these variable-length error correcting (VLEC) codes, necessary conditions on their length distribution are established. It is shown that, depending on the targetted application, several families of VLEC codes can be defined, whose conditions of existence differ.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122480371","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}
引用次数: 5
On the structure of the binary (18,9,6) linear code 关于二进制(18,9,6)线性码的结构
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216695
M. Esmaeili
{"title":"On the structure of the binary (18,9,6) linear code","authors":"M. Esmaeili","doi":"10.1109/ITW.2003.1216695","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216695","url":null,"abstract":"Let E/sub m/ denote the binary (m, m-1, 2) even weight code and /spl ominus/ the Kronecker product operation. A linear code of length m/spl times/t containing E/sub m//spl ominus/(t,1,t) can be decoded efficiently using a Tanner graph and a trellis diagram together with the Wagner decoding algorithm. Thus, it is important to determine whether a given code contains such a subcode. We show that the (18,9,6) binary quadratic residue code does not contain E/sub 6//spl ominus/(3,1,3). The maximum minimum distance of such a code is 5.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126978193","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
Robust slope region for wideband CDMA with multiple antennas 多天线宽带CDMA的鲁棒斜率区域
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216686
T. Muharemovic, B. Aazhang
{"title":"Robust slope region for wideband CDMA with multiple antennas","authors":"T. Muharemovic, B. Aazhang","doi":"10.1109/ITW.2003.1216686","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216686","url":null,"abstract":"We analyze a low power, wideband CDMA system with multiple antennas. The joint \"slope region\" - of transmission rates at minimum energy per bit s derived as a function of proportion between vanishing rates for multiple users. Vertices of the slope region may be achieved by a matched filter linear interface, followed by successive interference cancellation. We introduce and evaluate the \"robust slope region\", the largest region which is inside every other slope region and is therefore independent of the relative proportion between transmission rates. Furthermore, we find the \"robust slope\", the maximum slope which can always be guaranteed to all users.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134191900","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
Analysis of mapping strategies for turbo-coded space-time block codes 涡轮编码空时分组码的映射策略分析
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216705
A. Sezgin, D. Wübben, V. Kühn
{"title":"Analysis of mapping strategies for turbo-coded space-time block codes","authors":"A. Sezgin, D. Wübben, V. Kühn","doi":"10.1109/ITW.2003.1216705","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216705","url":null,"abstract":"We propose a \"turbo\" coding scheme for the multiple-input multiple-output (MIMO) Rayleigh fading channel consisting of the serial concatenation of a block code as the outer code and different orthogonal space-time block codes (STBC) for more than two transmit antennas as the inner code. Here, we consider the orthogonal STBC as a mapping scheme in space and time. At the receiver, we apply iterative space-time detection and decoding. We analyze the impact of different mapping strategies on the information transfer of the soft-input-soft-output (SISO) space-time detector. Moreover, we analytically show that additional performance gains over Gray mapping can be obtained by different mapping strategies. Furthermore, we use extrinsic information transfer characteristics (EXIT-charts) in order to predict the performance and the behavior of the system.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133810487","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
Spherical designs in four dimensions 四维球面设计
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216742
N. Sloane, R. H. Hardin, P. Cara
{"title":"Spherical designs in four dimensions","authors":"N. Sloane, R. H. Hardin, P. Cara","doi":"10.1109/ITW.2003.1216742","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216742","url":null,"abstract":"A preliminary report on our investigations into the existence of spherical t-designs on the unit sphere /spl Omega//sub 4/ in 4-dimensional Euclidean space. Tables are given of the putatively best t-designs with up to 100 points. Some general constructions are proposed and explicit constructions are given for N-point strength t designs with N=4p and t=min{p-1,5}, N=6p and t=min{p-1,7}, and N=12p and t=min{p-1,11}, for all p /spl ges/ 1.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120921534","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
A generalization of traceability codes using ideal-based codes 使用基于理想的代码的可追溯性代码的泛化
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216696
Marcel Fernández, M. Soriano
{"title":"A generalization of traceability codes using ideal-based codes","authors":"Marcel Fernández, M. Soriano","doi":"10.1109/ITW.2003.1216696","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216696","url":null,"abstract":"Traceability codes are used in copyright protection schemes to prevent illegal redistribution of digital content. A traceability code, C, is a set of codewords with the following identification property: let z be a word that is \"generated\" by a coalition of codewords U/spl sub/C; then there is at least one codeword in U that is \"closer\" to z than any other codeword not in U is. If the identification process is to be performed efficiently, then error-correcting codes can be used. We make use of a powerful conceptual tool, called ideal-based code (that includes Reed-Solomon, algebraic-geometric and Chinese reminder theorem codes), introduced by V. Guruswami et al., (see Proc. 41st IEEE Symp. on Foundations of Comp. Science, p.159-68, 2000), to present a general framework for the construction and decoding of traceability codes.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116413036","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
A new data compression algorithm for sources with memory based on error correcting codes 基于纠错码的内存源数据压缩新算法
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216751
G. Caire, S. Shamai, S. Verdú
{"title":"A new data compression algorithm for sources with memory based on error correcting codes","authors":"G. Caire, S. Shamai, S. Verdú","doi":"10.1109/ITW.2003.1216751","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216751","url":null,"abstract":"A new fixed-length asymptotically optimal scheme for lossless compression of stationary ergodic tree sources with memory is proposed. Our scheme is based on the concatenation of the Burrows-Wheeler block sorting transform with the syndrome former of a linear error correcting code. Low-density parity-check (LDPC) codes together with belief propagation decoding lead to linear compression and decompression times, and to natural universal implementation of the algorithm.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114946643","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}
引用次数: 67
Cooperative space-time coding for wireless networks 无线网络协同空时编码
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216692
A. Stefanov, E. Erkip
{"title":"Cooperative space-time coding for wireless networks","authors":"A. Stefanov, E. Erkip","doi":"10.1109/ITW.2003.1216692","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216692","url":null,"abstract":"We consider a cooperative system in which the partnering mobiles are equipped with multiple antennas. We present space-time codes that have the capability of providing full cooperation diversity, while achieving maximum possible diversity and best performance in the inter-user channel. Our codes also perform well when cooperation does not take place. We illustrate that cooperative space-time coding offers significant performance improvement over direct transmission even when the inter-user channel is noisy. We also consider code design for users with different numbers of antennas.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116674076","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}
引用次数: 84
首页 上一页 下一页 尾页
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学术官方微信
小红书