Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365361
G. Bowen, R. Nagarajan
In Shannon information theory the capacity of a memoryless communication channel cannot be increased by the use of feedback. The use of classical feedback is shown to provide no increase in the classical capacity of a memoryless quantum channel when feedback is used across nonentangled input states, or when the channel is an entanglement-breaking channel
{"title":"On feedback and the classical capacity of a noisy quantum channel","authors":"G. Bowen, R. Nagarajan","doi":"10.1109/ISIT.2004.1365361","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365361","url":null,"abstract":"In Shannon information theory the capacity of a memoryless communication channel cannot be increased by the use of feedback. The use of classical feedback is shown to provide no increase in the classical capacity of a memoryless quantum channel when feedback is used across nonentangled input states, or when the channel is an entanglement-breaking channel","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"272 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":"122772494","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.1365135
H. E. Gamal, G. Caire, M. O. Damen
In this paper, we introduce the class of lattice space-time (LAST) codes. We show that these codes achieve the optimal diversity-vs-multiplexing tradeoff defined by Zheng and Tse under generalized minimum Euclidean distance lattice decoding. Our scheme is based on a generalization of Erez and Zamir mod-/spl Lambda/ scheme to the MIMO case. This result settles the open problem posed by Zheng and Tse on the construction of explicit coding and decoding schemes that achieve the optimal diversity-vs-multiplexing tradeoff. Moreover, our results shed more light on the structure of optimal coding/decoding techniques in delay limited MIMO channels. In particular: 1) we show that MMSE-GDFE plays a fundamental role in approaching the limits of delay limited MIMO channels in the high SNR regime, unlike the AWGN channel case and 2) our random coding arguments represent a major departure from traditional space-time code designs based on the rank and/or mutual information design criteria.
{"title":"On the optimality of lattice space-time (LAST) coding","authors":"H. E. Gamal, G. Caire, M. O. Damen","doi":"10.1109/ISIT.2004.1365135","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365135","url":null,"abstract":"In this paper, we introduce the class of lattice space-time (LAST) codes. We show that these codes achieve the optimal diversity-vs-multiplexing tradeoff defined by Zheng and Tse under generalized minimum Euclidean distance lattice decoding. Our scheme is based on a generalization of Erez and Zamir mod-/spl Lambda/ scheme to the MIMO case. This result settles the open problem posed by Zheng and Tse on the construction of explicit coding and decoding schemes that achieve the optimal diversity-vs-multiplexing tradeoff. Moreover, our results shed more light on the structure of optimal coding/decoding techniques in delay limited MIMO channels. In particular: 1) we show that MMSE-GDFE plays a fundamental role in approaching the limits of delay limited MIMO channels in the high SNR regime, unlike the AWGN channel case and 2) our random coding arguments represent a major departure from traditional space-time code designs based on the rank and/or mutual information design criteria.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"2 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":"122494055","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.1365575
M. O. Damen, H. E. Gamal, G. Caire
Minimum mean square error generalized decision-feedback equalizer (MMSE-GDFE) lattice decoding is shown to be an efficient decoding strategy for under-determined linear channels. The proposed algorithm consists of an MMSE-GDFE front-end followed by a lattice reduction algorithm with a greedy ordering technique and, finally, a lattice search stage. By introducing flexibility in the termination strategy of the lattice search stage, we allow for trading performance for a reduction in the complexity. The proposed algorithm is shown, through experimental results in MIMO quasistatic channels, to offer significant gains over the state of the art decoding algorithms in terms of performance enhancement and complexity reduction. On the one hand, when the search is pursued until the best lattice point is found, the performance of the proposed algorithm is shown to be within a small fraction of a dB from the maximum likelihood (ML) decoder while offering a large reduction in complexity compared to the most efficient implementation of ML decoding proposed by Dayal and Varanasi (e.g., an order of magnitude in certain representative scenarios). On the other hand, when the search is terminated after the first point is found, the algorithm only requires linear complexity while offering significant performance gains (in the order of several dBs) over the linear complexity algorithm proposed recently by Yao and Wornell.
{"title":"MMSE-GDFE lattice decoding for solving under-determined linear systems with integer unknowns","authors":"M. O. Damen, H. E. Gamal, G. Caire","doi":"10.1109/ISIT.2004.1365575","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365575","url":null,"abstract":"Minimum mean square error generalized decision-feedback equalizer (MMSE-GDFE) lattice decoding is shown to be an efficient decoding strategy for under-determined linear channels. The proposed algorithm consists of an MMSE-GDFE front-end followed by a lattice reduction algorithm with a greedy ordering technique and, finally, a lattice search stage. By introducing flexibility in the termination strategy of the lattice search stage, we allow for trading performance for a reduction in the complexity. The proposed algorithm is shown, through experimental results in MIMO quasistatic channels, to offer significant gains over the state of the art decoding algorithms in terms of performance enhancement and complexity reduction. On the one hand, when the search is pursued until the best lattice point is found, the performance of the proposed algorithm is shown to be within a small fraction of a dB from the maximum likelihood (ML) decoder while offering a large reduction in complexity compared to the most efficient implementation of ML decoding proposed by Dayal and Varanasi (e.g., an order of magnitude in certain representative scenarios). On the other hand, when the search is terminated after the first point is found, the algorithm only requires linear complexity while offering significant performance gains (in the order of several dBs) over the linear complexity algorithm proposed recently by Yao and Wornell.","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":"116813571","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.1365461
Kaustuvmani Manji, B. Rajan
We present a lower bound on the peak to average power ratio (PAPR) for the second order cosets of binary Reed-Muller code by classifying the codewords using their Walsh Hadamard transform (WHT) vectors. This result categorizes the second order cosets of binary Reed-Muller code as per their PAPR by observing their WHT spectrum.
{"title":"On the PAPR of binary Reed-Muller OFDM codes","authors":"Kaustuvmani Manji, B. Rajan","doi":"10.1109/ISIT.2004.1365461","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365461","url":null,"abstract":"We present a lower bound on the peak to average power ratio (PAPR) for the second order cosets of binary Reed-Muller code by classifying the codewords using their Walsh Hadamard transform (WHT) vectors. This result categorizes the second order cosets of binary Reed-Muller code as per their PAPR by observing their WHT spectrum.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"3 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":"129584135","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.1365226
G. Bauch
We propose an extension of differential unitary space-time matrix modulation by an additional differential amplitude modulation for bandwidth-efficient transmission with noncoherent detection in a wireless system with multiple transmit antennas. The input bits are subdivided into two groups. The first group chooses a unitary matrix, the second group determines the amplitude of the transmit matrix. Compared to differential unitary space-time modulation, the proposed scheme has lower detection complexity and provides superior performance for bandwidth-efficient transmission, particularly in time-varying channels.
{"title":"Higher order differential matrix modulation","authors":"G. Bauch","doi":"10.1109/ISIT.2004.1365226","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365226","url":null,"abstract":"We propose an extension of differential unitary space-time matrix modulation by an additional differential amplitude modulation for bandwidth-efficient transmission with noncoherent detection in a wireless system with multiple transmit antennas. The input bits are subdivided into two groups. The first group chooses a unitary matrix, the second group determines the amplitude of the transmit matrix. Compared to differential unitary space-time modulation, the proposed scheme has lower detection complexity and provides superior performance for bandwidth-efficient transmission, particularly in time-varying channels.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"74 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":"129154443","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.1365095
S. Lonardi, W. Szpankowski, Mark Daniel Ward
The devastating effect of errors in adaptive data compression is a long-standing open problem. In this paper LZ'77 is changed theoretically and experimentally observed, such that in a significant proportion of LZ'77 phrases, there is more than one copy of the longest prefix in the compressed file. Once the redundant bits of LZ'77 have been identified, it is exploited for channel coding. For error correction and detection RS (255,255-2e) Reed-Solomon codes are used.
{"title":"Error resilient LZ'77 scheme and its analysis","authors":"S. Lonardi, W. Szpankowski, Mark Daniel Ward","doi":"10.1109/ISIT.2004.1365095","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365095","url":null,"abstract":"The devastating effect of errors in adaptive data compression is a long-standing open problem. In this paper LZ'77 is changed theoretically and experimentally observed, such that in a significant proportion of LZ'77 phrases, there is more than one copy of the longest prefix in the compressed file. Once the redundant bits of LZ'77 have been identified, it is exploited for channel coding. For error correction and detection RS (255,255-2e) Reed-Solomon codes are used.","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":"130406732","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.1365050
Kenneth J. Giuliani, G. Gong
This paper presents a efficient key agreement and signature schemes using compact representations in GF(p/sup 10/). We propose an analogous system using GF(p/sup 10/) which gives a 60% reduction in bandwidth from the canonical representation. We also present a signature scheme based on a new problem called the trace discrete log problem (Trace-DLP problem).
{"title":"Efficient key agreement and signature schemes using compact representations in GF(p/sup 10/)","authors":"Kenneth J. Giuliani, G. Gong","doi":"10.1109/ISIT.2004.1365050","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365050","url":null,"abstract":"This paper presents a efficient key agreement and signature schemes using compact representations in GF(p/sup 10/). We propose an analogous system using GF(p/sup 10/) which gives a 60% reduction in bandwidth from the canonical representation. We also present a signature scheme based on a new problem called the trace discrete log problem (Trace-DLP problem).","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"114 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":"126669014","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.1137/S0895480104439589
Y. Ben-Haim, T. Etzion
For z/sub 1/, z/sub 2/, z/sub 3/ /spl isin/ Z/sup 2/, the tristance d/sub 3/(z/sub 1/, z/sub 2/, z/sub 3/) is a generalization of the L/sub 1/-distance on Z/sup 2/ to a quality that reflects the relative dispersion of three points rather than two. We prove that at least 3k/sup 2/ colors are required to color the points of Z/sup 2/, such that the tristance between any three distinct points, colored with the same color, is at least 4k. We also prove that 3k/sup 2/+3k+1 colors are required if the tristance is at least 4k+2. For the first case we show an infinite family of colorings with 3k/sup 2/ colors and conjecture that these are the only colorings with 3k/sup 2/ colors.
{"title":"On the optimality of coloring with a lattice","authors":"Y. Ben-Haim, T. Etzion","doi":"10.1137/S0895480104439589","DOIUrl":"https://doi.org/10.1137/S0895480104439589","url":null,"abstract":"For z/sub 1/, z/sub 2/, z/sub 3/ /spl isin/ Z/sup 2/, the tristance d/sub 3/(z/sub 1/, z/sub 2/, z/sub 3/) is a generalization of the L/sub 1/-distance on Z/sup 2/ to a quality that reflects the relative dispersion of three points rather than two. We prove that at least 3k/sup 2/ colors are required to color the points of Z/sup 2/, such that the tristance between any three distinct points, colored with the same color, is at least 4k. We also prove that 3k/sup 2/+3k+1 colors are required if the tristance is at least 4k+2. For the first case we show an infinite family of colorings with 3k/sup 2/ colors and conjecture that these are the only colorings with 3k/sup 2/ colors.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"71 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":"129187238","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.1365395
V. Levenshtein
It is known that polynomials f(t), such that the matrix f(rho(x,y)) with the Hamming distance rho(x,y) between vectors x=(x 1,...,xn) and y=(y1,...,yn) is nonnegative definite, are described with the help of the system of Krawtchouk polynomials. In the paper the question on the existence of a similar system of polynomials is considered when the function rho(x,y) is not the Hamming distance
{"title":"A system of polynomials for the complex hamming spaces","authors":"V. Levenshtein","doi":"10.1109/ISIT.2004.1365395","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365395","url":null,"abstract":"It is known that polynomials f(t), such that the matrix f(rho(x,y)) with the Hamming distance rho(x,y) between vectors x=(x <sub>1</sub>,...,x<sub>n</sub>) and y=(y<sub>1</sub>,...,y<sub>n</sub>) is nonnegative definite, are described with the help of the system of Krawtchouk polynomials. In the paper the question on the existence of a similar system of polynomials is considered when the function rho(x,y) is not the Hamming distance","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":"123884859","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.1365265
Eleni Drinea, M. Mitzenmacher
We consider binary deletion channels, where bits are deleted independently with probability d. We extend the framework used to analyze the capacity of binary deletion channels established by Diggavi and Grossglauser [2001], improving on their lower bounds. In Diggavi and Grossglauser, the codewords are generated by a first order Markov chain. Our improvements arise from two considerations. First, Diggavi and Grossglauser consider typical outputs, where an output is typical if an N bit input produces an output of at least N(1-d)(1-/spl epsi/) bits. We provide a stronger notion of a typical output that yields better bounds even for the cases studied in Diggavi and Grossglauser. Second, we consider codewords generated by more general processes than first order Markov chains.
{"title":"On lower bounds for the capacity of deletion channels","authors":"Eleni Drinea, M. Mitzenmacher","doi":"10.1109/ISIT.2004.1365265","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365265","url":null,"abstract":"We consider binary deletion channels, where bits are deleted independently with probability d. We extend the framework used to analyze the capacity of binary deletion channels established by Diggavi and Grossglauser [2001], improving on their lower bounds. In Diggavi and Grossglauser, the codewords are generated by a first order Markov chain. Our improvements arise from two considerations. First, Diggavi and Grossglauser consider typical outputs, where an output is typical if an N bit input produces an output of at least N(1-d)(1-/spl epsi/) bits. We provide a stronger notion of a typical output that yields better bounds even for the cases studied in Diggavi and Grossglauser. Second, we consider codewords generated by more general processes than first order Markov chains.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"84 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":"123185729","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
扫码关注我们
求助内容：
应助结果提醒方式：