{"title":"Improvement of design criteria on space-time trellis codes in quasi-static Rayleigh fading channels","authors":"Yukihiro Sasazaki, T. Ohtsuki","doi":"10.1109/ISIT.2002.1023519","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023519","url":null,"abstract":"We propose a new design criterion on space-time trellis codes (STTCs) in quasi-static Rayleigh fading channels. We show that the proposed design criterion is more useful than the determinant 2 criterion with two transmit antennas and one receive antenna. We also show that the determinant 1 criterion is more useful than the trace criterion with two transmit antennas and three receive antennas.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"3108 1","pages":"247-"},"PeriodicalIF":0.0,"publicationDate":"2002-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86555554","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}
{"title":"Rate vs. distortion trade-off for channels with state information","authors":"A. Sutivong, T. Cover, M. Chiang, Young-Han Kim","doi":"10.1109/ISIT.2002.1023498","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023498","url":null,"abstract":"We consider a channel where the sender has access to channel state information and wishes to send both the pure information and a description of the channel state to the receiver. An achievable tradeoff region between pure information rate and state estimation error is proposed for a discrete memoryless channel with an arbitrary state distortion measure.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"17 1","pages":"226-"},"PeriodicalIF":0.0,"publicationDate":"2002-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88760403","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}
{"title":"The secret key capacity for multiple terminals","authors":"I. Csiszár, P. Narayan","doi":"10.1109/ISIT.2002.1023299","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023299","url":null,"abstract":"We consider the problem of characterizing the secret key (SK)-capacity [Maurer 1993, Ahlswede-Csiszar 1993, Csiszar-Narayan 2000] for an arbitrary number of terminals, each of which observes a distinct component of a discrete memoryless multiple source, with unconstrained public communication allowed between these terminals. Our main contribution is the determination of SK-capacity for an arbitrary subset of terminals with the remaining terminals serving as \"helpers,\" when an eavesdropper observes the communication between the terminals but does not have access to any other information. We also determine the private key (PK)-capacity when the eavesdropper additionally wiretaps some of the helper terminals from which too the key must then be concealed.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"5 1","pages":"27-"},"PeriodicalIF":0.0,"publicationDate":"2002-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89547255","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}
{"title":"Capacity of noncoherent time-selective block Rayleigh flat-fading channel","authors":"Yingbin Liang, V. Veeravalli","doi":"10.1109/ISIT.2002.1023438","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023438","url":null,"abstract":"We study the capacity of a noncoherent time-selective block fading channel, under the assumption that the channel changes slowly over the block period N rather than remaining constant. The predictability of the channel is characterized through the rank Q (1 /spl les/ Q /spl les/ N) of the correlation matrix of the vector of channel gains over the block. The model includes the standard block fading model and the i.i.d. fading model as special cases. For large SNR, we prove that the capacity grows logarithmically with SNR with a slope of N-Q/N (for 1 /spl les/ Q /spl les/ N). For fixed SNR and Q, we show that the capacity approaches the coherent channel capacity when N/spl rarr//spl infin/. We also characterize the asymptotics of the capacity in the regime where both N and Q/spl rarr//spl infin/, with Q/N being kept constant. The results of the paper can be generalized to include multiple antennas and frequency-selectivity.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"26 1","pages":"166-"},"PeriodicalIF":0.0,"publicationDate":"2002-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83091036","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}
{"title":"Csiszar's forward cutoff rate for testing between two arbitrary sources","authors":"F. Alajaji, Po-Ning Chen, Z. Rached","doi":"10.1109/ISIT.2002.1023487","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023487","url":null,"abstract":"The Csisza forward /spl beta/-cutoff rate (/spl beta/<0) for hypothesis testing is defined as the largest rate R/sub 0//spl ges/0 such that for all rates 0<E<R/sub 0/, the smallest probability of type 1 error of sample size-n tests with probability of type 2 error /spl les/e/sup -nE/ is asymptotically vanishing as e/sup -n/spl beta//(E-R/sub 0/). It was shown by Csiszar (see IEEE Transactions on Information Theory, vol.41, p.26-34, January 1995) that the forward /spl beta/-cutoff rate for testing between a null hypothesis X against an alternative hypothesis X~ based on independent and identically distributed samples, is given by Renyi's /spl alpha/-divergence D/sub /spl alpha//(X/spl par/X~), where /spl alpha/=1/(1-/spl beta/). In this work, we show that the forward /spl beta/-cutoff rate for the general hypothesis testing problem is given by the lim inf /spl alpha/-divergence rate. The result holds for an arbitrary abstract alphabet (not necessarily countable).","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"1 1","pages":"215-"},"PeriodicalIF":0.0,"publicationDate":"2002-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89281451","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}
Hsiao-feng Lu, Yuankai Wang, P. V. Kumar, K. Chugg
{"title":"On pairwise error probability of space-time codes","authors":"Hsiao-feng Lu, Yuankai Wang, P. V. Kumar, K. Chugg","doi":"10.1109/ISIT.2002.1023602","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023602","url":null,"abstract":"The authors consider a space-time coded system with Q transmit antennas and P receive antennas and assume under the quasi-static Rayleigh fading assumption that the channel is fixed for a duration of M symbol transmissions. Let S be a (Q/spl times/M) space-time code. Given S /spl isin/ S is the transmitted codeword, the received signal is given by Y=/spl radic//spl rho//sub t/HS + N, where /spl rho//sub t/=/spl rho//Q, with /spl rho/ being the SNR. The components n/sub p,m,/ h/sub p,q/ of the noise matrix N and the (P/spl times/Q) channel fading-coefficient matrix H respectively, are independent, identically-distributed, zero-mean, complex Gaussian random variables.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"43 1","pages":"330-"},"PeriodicalIF":0.0,"publicationDate":"2002-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77134262","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}
{"title":"Random codes: minimum distances and error exponents","authors":"A. Barg, G. Forney","doi":"10.1109/ISIT.2002.1023663","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023663","url":null,"abstract":"We consider the average and typical performance of random binary codes of length N and size M=e/sup NR/ from Shannon's random code ensemble (RCE) and from a random linear code ensemble (LCE), on a binary symmetric channel (BSC) with error probability p. These are among the oldest topics in information theory, and most of our results are \"known,\" although not \"well known\" in the sense of being readily accessible in textbooks, or even in the research literature.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"35 1","pages":"391-"},"PeriodicalIF":0.0,"publicationDate":"2002-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81345337","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}
{"title":"Arbitrary source models and Bayesian codebooks in rate-distortion theory","authors":"Ioannis Kontoyiannis, Junshan Zhang","doi":"10.1109/ISIT.2002.1023621","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023621","url":null,"abstract":"We give a development of universal lossy data compression based on a lossy version of the Kraft inequality. As an application, we evaluate the performance of universal mixture codebooks.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"40 1","pages":"349-"},"PeriodicalIF":0.0,"publicationDate":"2002-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75705939","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}
K. K. Mukkavilli, T. Muharemovic, A. Sabharwal, B. Aazhang
{"title":"On the outage probability of a class of signaling schemes for multiple antennas","authors":"K. K. Mukkavilli, T. Muharemovic, A. Sabharwal, B. Aazhang","doi":"10.1109/ISIT.2002.1023749","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023749","url":null,"abstract":"The concept of outage probability is appropriate for delay-constrained transmission over quasi-static channels since it serves as a useful lower bound for the frame error probability. In this work, we characterize a rich class of schemes, each member of which exhibits an identical asymptotic (in SNR) outage probability decay, given by maximum spatial diversity available in the system. The class includes several commonly used spatial power allocation and beamforming schemes, derived for varying amount of channel information at the transmitter and the receiver.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"520 1","pages":"477-"},"PeriodicalIF":0.0,"publicationDate":"2002-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77073276","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}
{"title":"On delayed prediction of individual sequences","authors":"M. Weinberger, E. Ordentlich","doi":"10.1109/ISIT.2002.1023420","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023420","url":null,"abstract":"We investigate a prediction scenario in which the predictor is forced to make a decision a number of steps in advance, with incomplete information. For finite action and observation spaces, it is shown that the strategy that minimizes the worst-case regret with respect to the Bayes envelope is obtained through sub-sampling of the sequence of observations. The result extends to the case of logarithmic loss.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"34 1","pages":"148-"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82598577","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}