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

2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)最新文献

筛选
英文 中文
Multistage turbo decoding for multilevel superposition coded modulation schemes 多电平叠加编码调制方案的多级turbo译码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866519
M. Pellenz, J. Portugheis
{"title":"Multistage turbo decoding for multilevel superposition coded modulation schemes","authors":"M. Pellenz, J. Portugheis","doi":"10.1109/ISIT.2000.866519","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866519","url":null,"abstract":"The design of multilevel superposition coded modulation schemes using turbo codes is addressed. A multistage decoding algorithm with reduced decoding delay is proposed. Simulation results over an impulsive noise channel are obtained.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"41 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114085344","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
The construction and free distance estimation of generalized woven codes with outer warp 带外经纱的广义编织物码的构造及自由距离估计
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866383
M. Bossert, W. Schnug, H. Dieterich, S. Shavgulidze
{"title":"The construction and free distance estimation of generalized woven codes with outer warp","authors":"M. Bossert, W. Schnug, H. Dieterich, S. Shavgulidze","doi":"10.1109/ISIT.2000.866383","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866383","url":null,"abstract":"A new class of convolutional codes, namely generalized woven codes with outer warp is presented. The codes are based on nested classes of inner single convolutional code and many outer convolutional codes with different redundancies. We give a lower bound on the free distance for these codes.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123787989","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
Time-varying network tomography: router link data 时变网络断层扫描:路由器链路数据
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1080/01621459.2000.10474303
Jin Cao, Drew Davis, Scott Vander Wiel, Bing Yu
{"title":"Time-varying network tomography: router link data","authors":"Jin Cao, Drew Davis, Scott Vander Wiel, Bing Yu","doi":"10.1080/01621459.2000.10474303","DOIUrl":"https://doi.org/10.1080/01621459.2000.10474303","url":null,"abstract":"In a computer network, the traffic matrix or the origin-destination (OD) byte counts are important statistics needed for design, routing, configuration debugging, monitoring and pricing. However, they are not easily available. For a fixed routing scheme, a statistical inverse algorithm is proposed and validated to estimate the traffic matrix from the easily collectable link counts which are aggregations of the origin-destination counts.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122393395","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}
引用次数: 341
Demodulation techniques for full-surface data 全面数据解调技术
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866608
W. Weeks
{"title":"Demodulation techniques for full-surface data","authors":"W. Weeks","doi":"10.1109/ISIT.2000.866608","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866608","url":null,"abstract":"A comparison of various full-surface demodulation algorithms is presented. Algorithms based on an iterative approach achieve highest optical data storage density at reasonable complexity and fixed bit error rate.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122816016","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
VQ-based hybrid digital-analog joint source-channel coding 基于vq的混合数模联合源信道编码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866701
M. Skoglund, N. Phamdo, F. Alajaji
{"title":"VQ-based hybrid digital-analog joint source-channel coding","authors":"M. Skoglund, N. Phamdo, F. Alajaji","doi":"10.1109/ISIT.2000.866701","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866701","url":null,"abstract":"The authors show that the hybrid digital-analog (HDA) systems outperform the tandem system and the analog system (at high SNRs). In particular they note the graceful improvement of the HDA systems, as opposed to the leveling-off in performance of the tandem system. They also observe that the performance can be improved at low SNRs using the optimization procedure.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121761016","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
Optimal dynamic power control for CDMA systems CDMA系统的最优动态功率控制
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866766
J. Chamberland, V. Veeravalli
{"title":"Optimal dynamic power control for CDMA systems","authors":"J. Chamberland, V. Veeravalli","doi":"10.1109/ISIT.2000.866766","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866766","url":null,"abstract":"The design of binary power control algorithms for cellular communication systems is considered in context of code division multiple access (CDMA). The control problem is posed as a tradeoff between the desire for users to meet their signal-to-interference ratio (SIR) requirements and the need to minimize the transmitted signal energy over the duration of their calls. The dynamic nature of the wireless channel for mobile users is incorporated in the problem definition. Based on dynamic programming arguments, an optimal single-user solution is obtained.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127714124","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}
引用次数: 2
An error performance analysis of iterative threshold decoding 迭代阈值译码的误差性能分析
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866482
C. Cardinal, D. Haccoun, F. Gagnon
{"title":"An error performance analysis of iterative threshold decoding","authors":"C. Cardinal, D. Haccoun, F. Gagnon","doi":"10.1109/ISIT.2000.866482","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866482","url":null,"abstract":"A method for analyzing the error performance of the iterative threshold decoder using strict sense multiorthogonal convolutional codes where the multiplicity order is larger or equal to the number of iterations is presented. This allows a tractable analysis, since all random variables are considered independent at each decoding step. The analysis provides a good prediction of the error probability convergence value of the iterative decoding process using strict sense doubly orthogonal convolutional codes.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127925747","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
CDMA with fading: effective bandwidth and spreading-coding tradeoff 具有衰落的CDMA:有效带宽和扩频编码的权衡
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866736
E. Biglieri, G. Taricco, E. Viterbo, G. Caire
{"title":"CDMA with fading: effective bandwidth and spreading-coding tradeoff","authors":"E. Biglieri, G. Taricco, E. Viterbo, G. Caire","doi":"10.1109/ISIT.2000.866736","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866736","url":null,"abstract":"We find the capacity regions of large CDMA systems with linear receivers and random spreading subject to slow fading (nonergodic channel) and fast fading (ergodic channel).","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132780095","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
Error performance analysis for reliability-based decoding algorithms 基于可靠性的译码算法误差性能分析
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866354
M. Fossorier, Shu Lin
{"title":"Error performance analysis for reliability-based decoding algorithms","authors":"M. Fossorier, Shu Lin","doi":"10.1109/ISIT.2000.866354","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866354","url":null,"abstract":"The statistical approach proposed by D. Agrawal and A. Vardy (see IEEE Trans. Inform. Theory, vol.46, pp.60-83, Jan. 2000) to evaluate the error performance of the generalized minimum distance (GMD) decoding is extended to other reliability based decoding algorithms for binary linear block codes, namely Chase-type, combined GMD and Chase-type, and ordered statistic decoding. In all cases, tighter and simpler bounds than previously proposed ones have been obtained with this approach.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131856434","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}
引用次数: 50
Further results on the algebraic design of space-time codes 空时码代数设计的进一步结果
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866637
A. Hammons, H. El Gamal
{"title":"Further results on the algebraic design of space-time codes","authors":"A. Hammons, H. El Gamal","doi":"10.1109/ISIT.2000.866637","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866637","url":null,"abstract":"Recently, the authors presented a new threaded space-time architecture combining generalized layered transmission, advanced iterative multi-user detection techniques, and space-time code design that provides superior performance compared to the layered architectures proposed by Foschini et al. (1998) and Tarokh et al. (1999). In this paper, we discuss the design of algebraic space-time codes for layered and non-layered architectures.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131861773","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
首页 上一页
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学术官方微信