Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365479
M. Lentmaier, D. Truhachev, K. Zigangirov, D. Costello
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.
{"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":"30 1","pages":"0"},"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365412
Xiaowei Jin, A. Eckford, T. Fuja
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
{"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":"20 1","pages":"0"},"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365247
P. Ishwar, V. Prabhakaran, K. Ramchandran
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.
{"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":"44 1","pages":"0"},"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365530
I. Jovanovic, B. Beferull-Lozano
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.
抽样理论研究进展[M]。Vetterli et al.，(2002)]表明，在创新率或高于创新率的情况下进行均匀采样，可以实现有限创新率下的非带限信号的完美重构。我们研究了这些信号的模数(A/D)转换，介绍了两种类型的过采样和一致重构。
{"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":"198 1","pages":"0"},"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365376
X. Zeng, A. Ghrayeb
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
{"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":"90 1","pages":"0"},"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365506
A. Dana, B. Hassibi
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.
{"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":"1 1","pages":"0"},"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365422
Arshad Ahmed, R. Koetter, Naresh R Shanbhag
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
基于重新编码的插值算法(R. Koetter et al. 2003)经过修改，使得中间插值结果也有助于解决代数软解码问题。通过对选定的中间结果子集进行因式分解，以较低的插值成本获得所需的编码增益
{"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":"46 1","pages":"0"},"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365561
Yuval Cassuto, Jehoshua Bruck
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.
{"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":"10 1","pages":"0"},"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365436
S. Zahedi, M. Mohseni, A. Gamal
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
本文介绍了具有线性中继功能的分频AWGN中继信道的容量。本文还描述了求解一系列非凸优化问题的方法
{"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":"12 1","pages":"0"},"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365485
Lih-Jyh Weng, A. Anastasopoulos, S. Pradhan
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.
{"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":"19 1","pages":"0"},"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：