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

2008 International Symposium on Information Theory and Its Applications最新文献

筛选
英文 中文
Finding fountain codes for real-time data by fixed point method 用不动点法求实时数据的喷泉码
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895597
T. Tirronen, J. Virtamo
{"title":"Finding fountain codes for real-time data by fixed point method","authors":"T. Tirronen, J. Virtamo","doi":"10.1109/ISITA.2008.4895597","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895597","url":null,"abstract":"We study fountain coding-like transfer method over a packet erasure channel for data with real-time requirements, such as streaming video or voice. The proposed method uses a sliding window, which defines the current section of non-expired data. The coding is systematic, with new blocks entering the window being initially sent intact, followed by a possible correction packet. Two different strategies for correction packet sending are studied. In both methods correction packets are generated in fountain-coding like fashion using bitwise XOR-operation for addition of source blocks. The correction packets are constructed so as to maximize the probability of immediately decoding useful data at the receiver's end, based on the sender's belief on the receiver's state. After sending the correction packet this belief is updated. Fixed point iteration is used to find the stationary solution in long streams. The two methods differ in the details how the window is moved and how exactly the correction packets are generated. We study the performance of proposed methods and give theoretical and simulation results for both of the used approaches.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130763362","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}
引用次数: 7
On the singularity of Laplace-Stieltjes transform of a heavy tailed random variable 重尾随机变量Laplace-Stieltjes变换的奇异性
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895515
K. Nakagawa
{"title":"On the singularity of Laplace-Stieltjes transform of a heavy tailed random variable","authors":"K. Nakagawa","doi":"10.1109/ISITA.2008.4895515","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895515","url":null,"abstract":"In this paper, we give a sufficient condition for a non-negative random variable X being heavy tailed. A light tailed case is studied in. The sufficient condition is an analytic property of Laplace-Stieltjes transform of the probability distribution function of X. The proof is based on the complex Tauberian theorem by Graham-Vaaler.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130955354","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
Rate-compatible punctured LDPC codes based on recovery tree 基于恢复树的速率兼容穿孔LDPC码
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895650
Sunghoon Choi, Kwangseok Noh, J. Shin, J. Heo
{"title":"Rate-compatible punctured LDPC codes based on recovery tree","authors":"Sunghoon Choi, Kwangseok Noh, J. Shin, J. Heo","doi":"10.1109/ISITA.2008.4895650","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895650","url":null,"abstract":"We consider the challenges of finding good puncturing patterns for rate-compatible LDPC codes over additive white Gaussian noise (AWGN) channel. In previous works, the role of survived check nodes in puncturing patterns was considered with the limitations such as single survived check node assumption and simulation-based verification. In this paper, we analyze the performance according to the role of multiple survived check nodes and multiple dead check nodes. Based on theses analyses, we propose new algorithm to find good puncturing pattern for LDPC codes over additive white Gaussian noise (AWGN) channel.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134185680","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 coding theorems for fixed-length source coding and Shannon's cipher system with a general source 固定长度源编码的新编码定理和具有一般源的香农密码系统
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895418
H. Koga
{"title":"New coding theorems for fixed-length source coding and Shannon's cipher system with a general source","authors":"H. Koga","doi":"10.1109/ISITA.2008.4895418","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895418","url":null,"abstract":"This paper is concerned with new coding theorems for (a) fixed-length coding of a general source, and (b) coding of Shannon's cipher system with a general source, under the condition that the decoding error probability vanishes as the blocklength goes to infinity. The converse theorems consist of inequalities that include the limit inferior in probability. In addition, the converse theorems are valid for the class of stochastic encoders. The direct theorems are proved under the assumptions that are slightly stronger than the consequences of the converse theorems. We can obtain known coding theorems from the obtained results.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133282241","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
Tuned turbo codes 调谐涡轮码
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895619
C. Koller, A. Graell i Amat, J. Kliewer, F. Vatta, D. J. Costello
{"title":"Tuned turbo codes","authors":"C. Koller, A. Graell i Amat, J. Kliewer, F. Vatta, D. J. Costello","doi":"10.1109/ISITA.2008.4895619","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895619","url":null,"abstract":"As implied by previous studies, there exists a fundamental trade-off between the minimum distance and the iterative decoding convergence behavior of a turbo code. While capacity achieving code ensembles typically are asymptotically bad in the sense that their minimum distance does not grow linearly with block length and they therefore exhibit an error floor at medium to high signal to noise ratios, asymptotically good codes usually converge further away from channel capacity. In this paper we present so-called tuned turbo codes, a family of asymptotically good hybrid concatenated code ensembles, where minimum distance growths and convergence thresholds can be traded-off using a tuning parameter lambda. By decreasing lambda, the asymptotic minimum distance growth rate coefficient is reduced for the sake of improved iterative decoding convergence behavior, and thus the code performance can be tuned to fit the desired application.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130194901","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}
引用次数: 7
Capacity of broadcast erasure networks using spatial network coding 使用空间网络编码的广播擦除网络容量
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895512
M. Salmasi, S. Golestani
{"title":"Capacity of broadcast erasure networks using spatial network coding","authors":"M. Salmasi, S. Golestani","doi":"10.1109/ISITA.2008.4895512","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895512","url":null,"abstract":"We study the capacity of a multicast session in point-to-point erasure networks as well as interference-free broadcast erasure networks, under a class of network coding schemes referred to as spatial network coding. In this class of coding, nodes are prohibited from performing coding on successive data units of a link; only combining data units arriving on different incoming links is permitted. We prove that, for both point-to-point and broadcast networks, the capacity of a multicast session is equal to the minimum of the capacities of the constituent unicast sessions. The capacity of a unicast session is equal to the statistical mean of the minimum cut rate of the corresponding random graph, where the notions of graph model and minimum cut rate are extended to apply to broadcast networks.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114156957","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
Performance evaluation of effect of nonlinear distortion in SC-FDMA system 非线性失真对SC-FDMA系统性能影响的评价
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895381
S. Suzuki, O. Takyu, Y. Umeda
{"title":"Performance evaluation of effect of nonlinear distortion in SC-FDMA system","authors":"S. Suzuki, O. Takyu, Y. Umeda","doi":"10.1109/ISITA.2008.4895381","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895381","url":null,"abstract":"In up-link wireless access communication, the transmitter needs good linearity but low power efficiency power amplifier. If the nonlinear power amplifier is used for improving the power usage efficiency, the higher peak-to-average power ratio (PAPR) signal suffers from nonlinear distortion. The effect of nonlinear distortion to Single Carrier-Frequency Division Multiple Access (SC-FDMA) has not been evaluated yet. In this paper, the performance of effect of nonlinear distortion to SC-FDMA is evaluated in terms of PAPR, out-of-band radiation and bit error rate with computer simulation, where there are two types of access scheme in SC-FDMA, first one is interleaved frequency division multiple access (IFDMA) and second one is localized frequency division multiple access (LFDMA). From the simulation results, we clarify IFDMA or LFDMA has the higher robustness for nonlinear distortion.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115089424","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}
引用次数: 6
Reliability and efficiency of flexibly decodable distributed coding strategies 灵活可解码分布式编码策略的可靠性和效率
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895661
A. Josan, D. Neuhoff
{"title":"Reliability and efficiency of flexibly decodable distributed coding strategies","authors":"A. Josan, D. Neuhoff","doi":"10.1109/ISITA.2008.4895661","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895661","url":null,"abstract":"Distributed lossless coding of correlated sources offers the potential for sizable reductions in coding rates in comparison to independent coding. However, it is more sensitive to encoder failures as the loss of one encoder may cause the decoding of many sources to fail. Strategies for increasing the reliability of lossless distributed coding were first considered by Marco and Neuhoff. This paper introduces and analyzes several new strategies based on flexible decoding, in contrast to the rigid decoding strategies considered previously. The new flexible schemes are found to offer significant gains over the prior rigid schemes.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128420329","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
Secret communication with feedback 带反馈的秘密通信
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895417
Deniz Gündüz, D. Brown, H. Poor
{"title":"Secret communication with feedback","authors":"Deniz Gündüz, D. Brown, H. Poor","doi":"10.1109/ISITA.2008.4895417","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895417","url":null,"abstract":"Secure communication with feedback is studied. An achievability scheme in which the backward channel is used to generate a shared secret key is proposed. The scenario of binary symmetric forward and backward channels is considered, and a combination of the proposed scheme and Maurer's coding scheme is shown to achieve improved secrecy rates. The scenario of a Gaussian channel with perfect output feedback is also analyzed and the Schalkwijk-Kailath coding scheme is shown to achieve the secrecy capacity for this channel.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134442247","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}
引用次数: 63
A robust cooperative relaying strategy for wireless networks using semidefinite constraints and worst-case performance optimization 基于半确定约束和最坏情况性能优化的无线网络鲁棒协同中继策略
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895491
R. Krishna, K. Cumanan, V. Sharma, S. Lambotharan
{"title":"A robust cooperative relaying strategy for wireless networks using semidefinite constraints and worst-case performance optimization","authors":"R. Krishna, K. Cumanan, V. Sharma, S. Lambotharan","doi":"10.1109/ISITA.2008.4895491","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895491","url":null,"abstract":"A robust signal forwarding technique for wireless sensor and mesh networks using semidefinite constraints is proposed. The scheme considers a multiple source destination scenario where a set of relays assists forwarding signals from sources to destinations. In our work we consider a realistic environment where actual channel state information (CSI) available to the relays are in error. We propose to optimize the relay transceiver within a worst-case performance optimization framework using semidefinite constraints. Simulations demonstrate that in the presence of imperfect CSI, the proposed scheme outperforms a non-robust scheme.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"72 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134544148","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}
引用次数: 9
首页 上一页
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学术官方微信