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

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

筛选
英文 中文
Turbo codes and Shannon's condition for reliable communication 涡轮码和香农的可靠通信条件
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365479
M. Lentmaier, D. Truhachev, K. Zigangirov, D. Costello
{"title":"Turbo codes and Shannon's condition for reliable communication","authors":"M. Lentmaier, D. Truhachev, K. Zigangirov, D. Costello","doi":"10.1109/ISIT.2004.1365479","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365479","url":null,"abstract":"Block transmission over noisy communication channels is characterized by two performance criteria: the bit error probability P/sub b/ and the block error probability P/sub B/. If P/sub B/ goes to zero when N/spl rarr//spl infin/ (where N denotes the length of the permutors), P/sub b/ also must go to zero for all symbols in the block but, in general, the reverse is not true. Therefore we formulate the Shannon's condition for reliable communication over noisy channels. In this paper, we address the problem of reliable communication for iterative decoding of turbo 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":"123495212","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
Analysis of LDPC decoding for correlated and uncorrelated block fading channels 相关和不相关分组衰落信道LDPC译码分析
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365412
Xiaowei Jin, A. Eckford, T. Fuja
{"title":"Analysis of LDPC decoding for correlated and uncorrelated block fading channels","authors":"Xiaowei Jin, A. Eckford, T. Fuja","doi":"10.1109/ISIT.2004.1365412","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365412","url":null,"abstract":"This paper presents a density evolution analysis of the sum-product algorithm used for channel estimation and decoding of low density parity check (LDPC) codes on correlated and uncorrelated two-state block fading channels. The channels under consideration use binary symmetric channels and binary-input Gaussian channels as components, and the thresholds for regular LDPC codes on these channels are calculated. The analysis shows that for both correlated and uncorrelated block fading channels, the threshold increases with the memory length. If the memory length is fixed, introducing correlation between successive blocks increases the threshold; as the memory length increases, this effect diminishes","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":"120954550","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
Compressing encrypted sources using side-information coding 使用侧信息编码压缩加密的源
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365247
P. Ishwar, V. Prabhakaran, K. Ramchandran
{"title":"Compressing encrypted sources using side-information coding","authors":"P. Ishwar, V. Prabhakaran, K. Ramchandran","doi":"10.1109/ISIT.2004.1365247","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365247","url":null,"abstract":"When transmitting a source over an insecure and bandwidth-limited channel, compression (lossy/lossless) precedes encryption. We show that, through the use of side-information coding principles, the order of these operations can be reversed without loss of Wyner-sense perfect secrecy and often with a significant compression ratio. Further, when the source has to be recovered perfectly (with high probability) or is Gaussian (with the mean-squared error fidelity criterion), there is no loss of compression efficiency and the proposed system requires no more randomness in the encryption key compared to systems where compression precedes encryption.","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":"114354308","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
Error-rate dependence of nonbandlimited signals with finite rate of innovation 有限创新率下非带限信号的误码率依赖
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365530
I. Jovanovic, B. Beferull-Lozano
{"title":"Error-rate dependence of nonbandlimited signals with finite rate of innovation","authors":"I. Jovanovic, B. Beferull-Lozano","doi":"10.1109/ISIT.2004.1365530","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365530","url":null,"abstract":"Recent results in sampling theory [M. Vetterli et al., (2002)] showed that perfect reconstruction of nonbandlimited signals with finite rate of innovation can be achieved performing uniform sampling at or above the rate of innovation. We study analog-to-digital (A/D) conversion of these signals, introducing two types of oversampling and consistent reconstruction.","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":"121547947","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
Performance bounds for space-time block codes with antenna selection 带天线选择的空时分组码的性能边界
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365376
X. Zeng, A. Ghrayeb
{"title":"Performance bounds for space-time block codes with antenna selection","authors":"X. Zeng, A. Ghrayeb","doi":"10.1109/ISIT.2004.1365376","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365376","url":null,"abstract":"In this paper, we derive upper bounds on the bit error rate performance of orthogonal space-time block codes (STBCs) with receive antenna selection. We show that the diversity order is maintained as that of the full complexity system, whereas the deterioration in SNR is upper bounded by 10 log10(M/L) dB where M is the number of available receive antennas and L is the number of selected antennas","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":"121548601","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
Power bandwidth trade-off for sensory and ad-hoc wireless networks 传感和自组织无线网络的功率带宽权衡
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365506
A. Dana, B. Hassibi
{"title":"Power bandwidth trade-off for sensory and ad-hoc wireless networks","authors":"A. Dana, B. Hassibi","doi":"10.1109/ISIT.2004.1365506","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365506","url":null,"abstract":"We look at the power bandwidth trade-off in random sensory and ad-hoc wireless networks with n users and r/spl les/n/sup 1/2/ simultaneous source/destination pairs. Under a specific protocol, we show that the minimum power required for maintaining an achievable scaling law of R/sub sum/=/spl Theta/(f(n)) for the sum-rate in the network, scales like /spl Theta/(f(n)/n/sup 1/2/). The required bandwidth B in this case is of order /spl Theta/(f(n)/r). It is also proved that the minimum achievable energy per information bit (E/sub b//N/sub 0/)/sub min/ for this protocol, scales as /spl Theta/(1/n/sup 1/2/) and in this case the spectral efficiency is nonzero and is of constant order.","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":"124349081","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
Reduced complexity interpolation for soft-decoding of reed-solomon codes 降低了芦苇-所罗门码软解码的复杂性插值
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365422
Arshad Ahmed, R. Koetter, Naresh R Shanbhag
{"title":"Reduced complexity interpolation for soft-decoding of reed-solomon codes","authors":"Arshad Ahmed, R. Koetter, Naresh R Shanbhag","doi":"10.1109/ISIT.2004.1365422","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365422","url":null,"abstract":"The re-encoding based interpolation algorithm (R. Koetter et al. 2003) is modified such that intermediate interpolation results are also useful towards solving the algebraic soft-decoding problem. By factorization of a chosen subset of intermediate results, desired coding gains are obtained at lower interpolation costs","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":"127604516","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
Miscorrection probability beyond the minimum distance 误差超出最小距离的概率
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365561
Yuval Cassuto, Jehoshua Bruck
{"title":"Miscorrection probability beyond the minimum distance","authors":"Yuval Cassuto, Jehoshua Bruck","doi":"10.1109/ISIT.2004.1365561","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365561","url":null,"abstract":"The miscorrection probability of a list decoder is the probability that the decoder will have at least one noncausal codeword in its decoding sphere. Evaluating this probability is important when using a list-decoder as a conventional decoder since in that case we require the list to contain at most one codeword for most of the errors. A lower bound on the miscorrection is the main result. The key ingredient in the proof is a new combinatorial upper bound on the list-size for a general q-ary block code. This bound is tighter than the best known on large alphabets, and it is shown to be very close to the algebraic bound for Reed-Solomon codes. Finally we discuss two known upper bounds on the miscorrection probability and unify them for linear MDS 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":"127620428","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
On the capacity of AWGN relay channels with linear relaying functions 具有线性中继功能的AWGN中继信道容量研究
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365436
S. Zahedi, M. Mohseni, A. Gamal
{"title":"On the capacity of AWGN relay channels with linear relaying functions","authors":"S. Zahedi, M. Mohseni, A. Gamal","doi":"10.1109/ISIT.2004.1365436","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365436","url":null,"abstract":"This paper describes the capacity of frequency-division AWGN relay channels with linear relaying functions. A sequence of nonconvex optimization problems solving are also described in this paper","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":"126271805","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}
引用次数: 49
Error exponent region for Gaussian multiple access channels 高斯多址信道的误差指数区域
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365485
Lih-Jyh Weng, A. Anastasopoulos, S. Pradhan
{"title":"Error exponent region for Gaussian multiple access channels","authors":"Lih-Jyh Weng, A. Anastasopoulos, S. Pradhan","doi":"10.1109/ISIT.2004.1365485","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365485","url":null,"abstract":"In this paper, we derive an inner bound (achievable region) and an outer bound for the error exponent region of a Gaussian multiple access channels (GMAC). We define a probability of error for each user, which, in general may be different for different users. Therefore, there are multiple error exponents, one for each user, for a given multiuser channel.","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":"126393468","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学术官方微信