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

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

筛选
英文 中文
Embedded turbo coding in pattern position modulation for ultra wideband radio systems 超宽带无线电系统模式位置调制中的嵌入式涡轮编码
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365552
C. Bi, J. Hui, L. Bodenheimer, Holger Spielberg
{"title":"Embedded turbo coding in pattern position modulation for ultra wideband radio systems","authors":"C. Bi, J. Hui, L. Bodenheimer, Holger Spielberg","doi":"10.1109/ISIT.2004.1365552","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365552","url":null,"abstract":"In this paper, a novel method is proposed to do turbo coding for pulse (pattern) position modulation, for ultra wideband radio system. Such systems maps multiple PPM slot detections into the probabilities of those bits to be \"1\", then turbo decoding can be done. The noise model in this coding scheme and the discrete interference model to replace the AWGN model to improve the coding performance are discussed.","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":"126554478","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
On optimal cyclotomic lattices and diagonal-single-layer space-time block codes 最优环切分格和对角单层空时分组码
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365223
Genyuan Wang, X. Xia
{"title":"On optimal cyclotomic lattices and diagonal-single-layer space-time block codes","authors":"Genyuan Wang, X. Xia","doi":"10.1109/ISIT.2004.1365223","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365223","url":null,"abstract":"An optimization of cyclotomic lattices based diagonal/single-layer space-time block codes is discussed. The concrete full diversity cyclotomic generating matrices are used to generalize the lattices and also studies the optimality in the sense that for a fixed diversity product and thus the transmission signal power is minimized.","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":"132459879","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
How good is an isotropic gaussian input on a MIMO Ricean channel? 在MIMO信道上各向同性高斯输入有多好?
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365325
D. Hoesli, A. Lapidoth
{"title":"How good is an isotropic gaussian input on a MIMO Ricean channel?","authors":"D. Hoesli, A. Lapidoth","doi":"10.1109/ISIT.2004.1365325","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365325","url":null,"abstract":"For a MIMO Ricean fading channel with perfect side information at the receiver we derive an analytic upper bound on the difference between capacity and the mutual information that is induced by an isotropic Gaussian input. We show that if the number of receiver antennas is at least equal to the number of transmitter antennas, then, as the signal-to-noise ratio tends to infinity, such an input is asymptotically optimal. But otherwise such an isotropic input might be suboptimal. We also propose an iterative algorithm to calculate the optimal power allocation.","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":"133996688","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}
引用次数: 21
On regular quasicyclic LDPC codes from binomials 二项上正则拟环LDPC码
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365314
R. Smarandache, P. Vontobel
{"title":"On regular quasicyclic LDPC codes from binomials","authors":"R. Smarandache, P. Vontobel","doi":"10.1109/ISIT.2004.1365314","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365314","url":null,"abstract":"In the past, several authors have considered quasicyclic LDPC codes whose circulant matrices in the parity-check matrix are cyclically shifted identity matrices. By composing a parity-check matrix not only with such matrices but also with sums of two cyclically shifted identity matrices and with zero matrices, one can increase the minimum distance while keeping the same regularity. Specifically, whereas for (3, 4)-regular codes in the first class the best minimum distance is 24, the best minimum distance in the second class is 32. We give examples of codes that achieve these bounds.","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":"131802346","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}
引用次数: 42
On the capacity of wireless erasure networks 关于无线擦除网络的容量
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365437
R. Gowaikar, A. Dana, R. Palanki, B. Hassibi, M. Effros
{"title":"On the capacity of wireless erasure networks","authors":"R. Gowaikar, A. Dana, R. Palanki, B. Hassibi, M. Effros","doi":"10.1109/ISIT.2004.1365437","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365437","url":null,"abstract":"We determine the capacity of a certain class of wireless erasure relay networks. We first find a suitable definition for the \"cut-capacity\" of erasure networks with broadcast at transmission and no interference at reception. With this definition, a maxflow mincut capacity result holds for the capacity of these 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":"130919764","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}
引用次数: 19
Delay guarantee versus throughput in broadcast fading channels 广播衰落信道中时延保证与吞吐量的关系
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365282
M. Sharif, B. Hassibi
{"title":"Delay guarantee versus throughput in broadcast fading channels","authors":"M. Sharif, B. Hassibi","doi":"10.1109/ISIT.2004.1365282","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365282","url":null,"abstract":"We consider a single-antenna broadcast fading channel with n backlogged users. Assuming the transmission is packet-based, we define the delay as the minimum number of channel uses that guarantees all n users successfully receive m packets. A delay optimal strategy such as round-robin achieves the delay of mn. For the optimal throughput strategy (i.e. transmitting to the user with the best channel condition at each channel use), we derive the mean and variance of the delay for any m and n. For large n, it is proved that the expected delay in receiving the first packet in all users scales like n log n as opposed to n for the round-robin scheduling.","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":"130977351","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 the effect of channel estimation error with superimposed training upon information rates 叠加训练信道估计误差对信息率的影响
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365353
A. Vosoughi, A. Scaglione
{"title":"On the effect of channel estimation error with superimposed training upon information rates","authors":"A. Vosoughi, A. Scaglione","doi":"10.1109/ISIT.2004.1365353","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365353","url":null,"abstract":"Adopting affine precoding as the transmission strategy, we investigate the effect of channel estimation error on the mutual information between the input and the output of a frequency selective fading MIMO channel. For Bayesian receivers which perform joint channel and symbol estimation there is asymptotically no loss in information rate. In contrast, for the receivers which obtain the channel estimation and use it to estimate the symbols, the lower bound on information rate is maximized by enforcing a form of orthogonality between symbols and training","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":"133602735","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 intrinsic information 关于内在信息
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365175
M. Christandl, R. Renner
{"title":"On intrinsic information","authors":"M. Christandl, R. Renner","doi":"10.1109/ISIT.2004.1365175","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365175","url":null,"abstract":"This paper introduces the public Eve scenario and shows that the secret key rate in this scenario is bounded by the intrinsic information. This elucidates previous results and gives new insights in the gap between formation and extraction of secret information. Intrinsic information, in its function as an upper bound on the secret key rate, is generalized to secret key agreement from arbitrary tripartite quantum states.","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":"132093065","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
Information-lossless STBCs from crossed-product algebras 交积代数中的信息无损stbc
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365163
V. Shashidhar, B. Rajan, B. Sethuraman
{"title":"Information-lossless STBCs from crossed-product algebras","authors":"V. Shashidhar, B. Rajan, B. Sethuraman","doi":"10.1109/ISIT.2004.1365163","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365163","url":null,"abstract":"This work presents the construction of STBCs, using crossed-product algebras, for arbitrary number of transmit antennas over an a priori specified signal set. It obtains a condition under which these STBCs from arbitrary crossed-product algebras are information-lossless.","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":"132385668","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
Rotationally invariant space time constellations 旋转不变的时空星座
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365192
Jun Shi, R. Wesel
{"title":"Rotationally invariant space time constellations","authors":"Jun Shi, R. Wesel","doi":"10.1109/ISIT.2004.1365192","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365192","url":null,"abstract":"The rotationally invariant space time constellation (RISTC) is defined. Both linear and affine constellations are studied. The RISTC is shown to be generalization of space time codes from the orthogonal design. A space time constellation is said rotationally invariant if for any pair in the set, the squared Euclidean distance is independent of the eigenvectors.","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":"128885073","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
首页 上一页 下一页 尾页
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学术官方微信