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

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.最新文献

筛选
英文 中文
Derivation on bit error probability of coded QAM using integer codes 整数码编码QAM误码概率的推导
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365577
H. Kostadinov, H. Morita, N. Manev
{"title":"Derivation on bit error probability of coded QAM using integer codes","authors":"H. Kostadinov, H. Morita, N. Manev","doi":"10.1109/ISIT.2004.1365577","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365577","url":null,"abstract":"Coded modulation refers to the process of combined and jointly optimized channel coding and modulation scheme. In this paper, block coded modulation using integer codes and its performance is evaluated by deriving a formula of its bit error probability for AWGN channel. The probability of correct detection of the received signal is a square of the corresponding probability. The detector correctly demodulates the received signal with an average probability in uncoded and coded case respectively.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125938858","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}
引用次数: 11
Optimal puncturing for multiple parallel concatenated codes 多个并行连接代码的最佳穿刺
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365188
F. Brannstrom, L. Rasmussen, A. Grant
{"title":"Optimal puncturing for multiple parallel concatenated codes","authors":"F. Brannstrom, L. Rasmussen, A. Grant","doi":"10.1109/ISIT.2004.1365188","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365188","url":null,"abstract":"Optimal puncturing ratios for parallel concatenated codes with two or more constituent codes are found using extrinsic information transfer functions. These ratios minimize the signal-to-noise ratio convergence threshold and provide additional degrees of freedom for constructing codes with low thresholds over a wide range of code rates.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125943318","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
Throughput-delay trade-off in energy constrained wireless networks 能量受限无线网络中的吞吐量-延迟权衡
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365475
A. Gamal, J. Mammen, B. Prabhakar, D. Shah
{"title":"Throughput-delay trade-off in energy constrained wireless networks","authors":"A. Gamal, J. Mammen, B. Prabhakar, D. Shah","doi":"10.1109/ISIT.2004.1365475","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365475","url":null,"abstract":"The random network model assumed in this paper is a generalization of the model that incorporates transmission energy consumption. The throughput, delay and energy-per-bit for a communication scheme are related through the scheme's average transmission range, i.e., average hop distance is considered. For mobile networks, the same model with additional feature that each node moves with velocity according to an independent Brownian motion is considered.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126094105","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}
引用次数: 72
On the maximal rate of square quasi-orthogonal designs 关于方形拟正交设计的最大率
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365397
M. Khan, B. Rajan
{"title":"On the maximal rate of square quasi-orthogonal designs","authors":"M. Khan, B. Rajan","doi":"10.1109/ISIT.2004.1365397","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365397","url":null,"abstract":"In this paper we show that the maximal rates of square quasiorthogonal designs (QOD) is upper bounded by 2a/2a for N=2a transmit antennas. We also show that known constructions of QODs achieve this bound with equality and are therefore maximal-rate QODs","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126621956","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
Partitioning techniques for design of multilevel codes for Rayleigh fading channels 瑞利衰落信道中多级码设计的分划技术
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365447
S. Mallik, R. Koetter
{"title":"Partitioning techniques for design of multilevel codes for Rayleigh fading channels","authors":"S. Mallik, R. Koetter","doi":"10.1109/ISIT.2004.1365447","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365447","url":null,"abstract":"We consider the problem of code design for a set of parallel correlated Rayleigh fading channels. This design problem arises whenever a channel can be decomposed into parallel channels, for example in OFDM schemes using Weyl-Heisenberg bases over underspread fading channels. Schemes involving rotations of integer lattices have been proposed in J. Boutros et al. (1998) as a technique for communication over such channels. In this paper, we propose a multilevel coded modulation scheme based on partitioning the integer lattice and protecting these partitions with outer codes.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115103977","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
Extracting randomness from generalized symbol-fixing and Markov sources 从广义符号固定和马尔可夫源中提取随机性
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365267
R. König, U. Maurer
{"title":"Extracting randomness from generalized symbol-fixing and Markov sources","authors":"R. König, U. Maurer","doi":"10.1109/ISIT.2004.1365267","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365267","url":null,"abstract":"We introduce a new class of realistic sources of randomness and give concrete procedures for deterministic extraction of almost uniform random bits from these sources. Moreover, we show how randomness can be extracted from general Markov sources. This extends the types of sources for which explicit deterministic randomness extractors are known.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115538496","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
Reduced-complexity iterative decoding using a variable-size trellis structure 使用可变大小的网格结构降低复杂度的迭代解码
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365529
D. Bokolamulla, T. Aulin
{"title":"Reduced-complexity iterative decoding using a variable-size trellis structure","authors":"D. Bokolamulla, T. Aulin","doi":"10.1109/ISIT.2004.1365529","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365529","url":null,"abstract":"We propose a new reduced-complexity iterative decoding algorithm. The main concept is to approximate the aposteriori probabilities (APP) by a set of few sequences, and to reduce the size of this set with iterations. According to the numerical results on the bit error rate (BER) performance and the convergence behavior by extrinsic information transfer (EXIT) chart analysis, the algorithm could obtain a good balance between performance and complexity.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115581060","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
Applicability of the sample path method of ergodic processes to individual sequences 遍历过程的样本路径法在个别序列中的适用性
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365598
S. Kuzuoka, T. Uyematsu
{"title":"Applicability of the sample path method of ergodic processes to individual sequences","authors":"S. Kuzuoka, T. Uyematsu","doi":"10.1109/ISIT.2004.1365598","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365598","url":null,"abstract":"This paper proposes a method which enables to apply some results on ergodic sources to individual sequences. As an example, we show the recurrence time theorem for individual sequences.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116075738","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
Universal non-destructive estimation of quantum relative entropy 量子相对熵的通用无损估计
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365392
A. Kaltchenko
{"title":"Universal non-destructive estimation of quantum relative entropy","authors":"A. Kaltchenko","doi":"10.1109/ISIT.2004.1365392","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365392","url":null,"abstract":"This paper describes the universal nondestructive estimation of quantum relative entropy. The sequences with the independent realizations of two i.i.d sources over a finite alphabet and the corresponding marginal distributions with the universal estimation is used to define the function quantum relative entropy. A product state emitted by a quantum i.i.d source with density matrix is subjected to a unitary transformation with a computational basis. The quantum entropy of a source and the eigenbasis without compromising the fidelity is learnt. With the arbitrary high accuracy the fidelity arbitrary is close to the unity","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116234493","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
Efficient routing in wireless networks with random node distribution 随机节点分布无线网络中的高效路由
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365056
M. Haenggi
{"title":"Efficient routing in wireless networks with random node distribution","authors":"M. Haenggi","doi":"10.1109/ISIT.2004.1365056","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365056","url":null,"abstract":"After deriving the distribution of the distance to the n/sup th/ nearest neighbor in uniformly random networks of any dimension we establish that nearest-neighbor routing schemes perform poorly in random networks. We suggest and analyze an improved scheme that approaches the performance of regular networks.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122409429","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学术文献互助群
群 号：481959085
Book学术官方微信