Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523660
H. E. Gamal, G. Caire, M. O. Damen
In this paper, we explore the fundamental performance tradeoff of the delay-limited multi-input-multi-output (MIMO) automatic retransmission request (ARQ) channel. In particular, we extend the diversity-multiplexing tradeoff investigated by Zheng and Tse in standard delay-limited MIMO channels with coherent detection to the ARQ scenario. We establish the three-dimensional tradeoff between reliability (i.e. diversity), throughput (i.e., multiplexing gain), and delay (i.e., maximum number of retransmissions). This tradeoff quantifies the ARQ diversity gain obtained by leveraging the retransmission delay to enhance the reliability for a given multiplexing gain. Interestingly, ARQ diversity appears even in long-term static channels where all the retransmissions take place in the same channel state. Furthermore, by relaxing the input power constraint allowing variable power levels in different retransmissions, we show that power control can be used to dramatically increase the diversity advantage. Our analysis reveals some important insights on the benefits of ARQ in slow fading MIMO channels. In particular, we show that: 1) allowing for a sufficiently large retransmission delay results in an almost flat diversity-multiplexing tradeoff, and hence, renders operating at high multiplexing gain more advantageous; 2) MIMO ARQ channels quickly approach the ergodic limit when power control is employed
{"title":"The diversity-multiplexing-delay tradeoff in MIMO ARQ channels","authors":"H. E. Gamal, G. Caire, M. O. Damen","doi":"10.1109/ISIT.2005.1523660","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523660","url":null,"abstract":"In this paper, we explore the fundamental performance tradeoff of the delay-limited multi-input-multi-output (MIMO) automatic retransmission request (ARQ) channel. In particular, we extend the diversity-multiplexing tradeoff investigated by Zheng and Tse in standard delay-limited MIMO channels with coherent detection to the ARQ scenario. We establish the three-dimensional tradeoff between reliability (i.e. diversity), throughput (i.e., multiplexing gain), and delay (i.e., maximum number of retransmissions). This tradeoff quantifies the ARQ diversity gain obtained by leveraging the retransmission delay to enhance the reliability for a given multiplexing gain. Interestingly, ARQ diversity appears even in long-term static channels where all the retransmissions take place in the same channel state. Furthermore, by relaxing the input power constraint allowing variable power levels in different retransmissions, we show that power control can be used to dramatically increase the diversity advantage. Our analysis reveals some important insights on the benefits of ARQ in slow fading MIMO channels. In particular, we show that: 1) allowing for a sufficiently large retransmission delay results in an almost flat diversity-multiplexing tradeoff, and hence, renders operating at high multiplexing gain more advantageous; 2) MIMO ARQ channels quickly approach the ergodic limit when power control is employed","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"1 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133136680","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523333
C. Martínez, R. Beivide, J. Gutierrez, E. Gabidulin
The basis for designing error-correcting codes for two dimensional signal sets is considered in this paper. Both, algebraic and graph-theoretical approaches are employed in this research for establishing the fundamentals of these codes. We give a solution to the t-dominating set problem in a subfamily of degree four circulant graphs which directly provides perfect codes over the Gaussian integers. In order to show the applicability of our results, simple examples for designing different coding schemes are also presented
{"title":"On the perfect t-dominating set problem in circulant graphs and codes over gaussian integers","authors":"C. Martínez, R. Beivide, J. Gutierrez, E. Gabidulin","doi":"10.1109/ISIT.2005.1523333","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523333","url":null,"abstract":"The basis for designing error-correcting codes for two dimensional signal sets is considered in this paper. Both, algebraic and graph-theoretical approaches are employed in this research for establishing the fundamentals of these codes. We give a solution to the t-dominating set problem in a subfamily of degree four circulant graphs which directly provides perfect codes over the Gaussian integers. In order to show the applicability of our results, simple examples for designing different coding schemes are also presented","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130352050","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523387
S. Diggavi, David Tse
Diversity-embedded codes for fading channels are high-rate codes that are designed so that they have a high-diversity code embedded within them. This allows a form of communication where the high-rate code opportunistically takes advantage of good channel realizations whereas the embedded high-diversity code ensures that at least part of the information is received reliably. This can also be thought as coding the data into two streams such that the high-priority stream has higher reliability than the low-priority stream. For SISO (single-input-single-output), SIMO, MISO and parallel fading channels, we characterize the achievable rates and reliability of the two streams in the high SNR regime in terms of the diversity-multiplexing tradeoff. We exhibit the performance gain over a single-stream code. We also show some constructions for finite block lengths that achieve the optimal performance
{"title":"Fundamental limits of diversity-embedded codes over fading channels","authors":"S. Diggavi, David Tse","doi":"10.1109/ISIT.2005.1523387","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523387","url":null,"abstract":"Diversity-embedded codes for fading channels are high-rate codes that are designed so that they have a high-diversity code embedded within them. This allows a form of communication where the high-rate code opportunistically takes advantage of good channel realizations whereas the embedded high-diversity code ensures that at least part of the information is received reliably. This can also be thought as coding the data into two streams such that the high-priority stream has higher reliability than the low-priority stream. For SISO (single-input-single-output), SIMO, MISO and parallel fading channels, we characterize the achievable rates and reliability of the two streams in the high SNR regime in terms of the diversity-multiplexing tradeoff. We exhibit the performance gain over a single-stream code. We also show some constructions for finite block lengths that achieve the optimal performance","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124602475","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523432
P. Tan, L. Rasmussen
It has been shown that the stable fixed points of belief propagation (BP) algorithms correspond to extrema of the Bethe free energy. In this paper, we describe the dual problem for the minimization of the Bethe free energy and solve it using simple nonlinear block Gauss-Seidel and Jacobi algorithms. The use of the nonlinear block Gauss-Seidel algorithm corresponds to serial scheduling for the BP algorithm. In addition, it is shown that applying the nonlinear block Jacobi algorithm on the dual of the Bethe free energy corresponds to the parallel BP algorithm
{"title":"The serial and parallel belief propagation algorithms","authors":"P. Tan, L. Rasmussen","doi":"10.1109/ISIT.2005.1523432","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523432","url":null,"abstract":"It has been shown that the stable fixed points of belief propagation (BP) algorithms correspond to extrema of the Bethe free energy. In this paper, we describe the dual problem for the minimization of the Bethe free energy and solve it using simple nonlinear block Gauss-Seidel and Jacobi algorithms. The use of the nonlinear block Gauss-Seidel algorithm corresponds to serial scheduling for the BP algorithm. In addition, it is shown that applying the nonlinear block Jacobi algorithm on the dual of the Bethe free energy corresponds to the parallel BP algorithm","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132550551","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523598
G. Caire, S. Shamai, S. Verdú
This paper proposes a practical scheme to transmit reliable information through a noisy symmetric DMC using limited noiseless feedback. The ratio of feedback rate to feedforward rate is a design parameter that can be selected from zero to 1 - C, where C is the capacity of the channel. The proposed scheme uses a concatenation of low-density parity-check codes, belief propagation, and a noisy version of the closed-loop iterative doping algorithm, previously proposed by the authors for data compression using linear codes. Our scheme takes advantage of the availability of a modicum of feedback to achieve very small block error rates
{"title":"An efficient scheme for reliable error correction with limited feedback","authors":"G. Caire, S. Shamai, S. Verdú","doi":"10.1109/ISIT.2005.1523598","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523598","url":null,"abstract":"This paper proposes a practical scheme to transmit reliable information through a noisy symmetric DMC using limited noiseless feedback. The ratio of feedback rate to feedforward rate is a design parameter that can be selected from zero to 1 - C, where C is the capacity of the channel. The proposed scheme uses a concatenation of low-density parity-check codes, belief propagation, and a noisy version of the closed-loop iterative doping algorithm, previously proposed by the authors for data compression using linear codes. Our scheme takes advantage of the availability of a modicum of feedback to achieve very small block error rates","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132794034","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523479
V. Kazakov, D. Rodríguez
The general approach of the statistical description of the sampling-reconstruction procedure (SRP) with jitter of Gaussian processes with an arbitrary number of samples is given. The analysis is based on the conditional mean rule. We consider the classification of all known mathematical models of jitter and describe the statistical average procedure in order to find the principal SRP characteristics with jitter: the reconstruction function and the error reconstruction function. We suggest the new interpretation of the reconstruction schemes on the basis of the kinetic equations for non-Markov processes. Some non-trivial examples are given
{"title":"Sampling-reconstruction procedure with jitter of Gaussian processes","authors":"V. Kazakov, D. Rodríguez","doi":"10.1109/ISIT.2005.1523479","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523479","url":null,"abstract":"The general approach of the statistical description of the sampling-reconstruction procedure (SRP) with jitter of Gaussian processes with an arbitrary number of samples is given. The analysis is based on the conditional mean rule. We consider the classification of all known mathematical models of jitter and describe the statistical average procedure in order to find the principal SRP characteristics with jitter: the reconstruction function and the error reconstruction function. We suggest the new interpretation of the reconstruction schemes on the basis of the kinetic equations for non-Markov processes. Some non-trivial examples are given","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115103868","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523535
A. Sabharwal, U. Mitra
In this paper, the impact of limited resources on achievable rates in relay channels is investigated. Resource limitation is modeled (as previously proposed) by (Rmacr) which constrains the rate at which a relay can reliably decode or encode data. With this constraint in hand, the achievable rates for two commonly studied protocols, decode-and-forward and estimate-and-forward are derived and_compared. In particular, the case of severe resource limitation (Rmacr rarr 0) is considered. While decode-and-forward is the superior protocol for most relay locations (topologies) under no rate constraints, estimate-and forward almost always offers superior performance when relaying with strong rate constraints
{"title":"Rate-constrained relaying: achievable rates and protocol comparisons","authors":"A. Sabharwal, U. Mitra","doi":"10.1109/ISIT.2005.1523535","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523535","url":null,"abstract":"In this paper, the impact of limited resources on achievable rates in relay channels is investigated. Resource limitation is modeled (as previously proposed) by (Rmacr) which constrains the rate at which a relay can reliably decode or encode data. With this constraint in hand, the achievable rates for two commonly studied protocols, decode-and-forward and estimate-and-forward are derived and_compared. In particular, the case of severe resource limitation (Rmacr rarr 0) is considered. While decode-and-forward is the superior protocol for most relay locations (topologies) under no rate constraints, estimate-and forward almost always offers superior performance when relaying with strong rate constraints","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116138715","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523658
A. Medles, D. Slock
In this paper we derive the optimal diversity versus multiplexing tradeoff for a frequency selective i.i.d. Rayleigh MIMO channel. This tradeoff is shown to be better than the one of the frequency flat MIMO channel. Traditional approaches for frequency selective channels use OFDM techniques in order to exploit the diversity gain due to frequency selectivity. We show that although coding in OFDM over a sufficient subset of subcarriers allows to exploit full diversity as such (at fixed rate), such an approach leads to a suboptimal diversity vs multiplexing tradeoff
{"title":"Optimal diversity vs multiplexing tradeoff for frequency selective MIMO channels","authors":"A. Medles, D. Slock","doi":"10.1109/ISIT.2005.1523658","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523658","url":null,"abstract":"In this paper we derive the optimal diversity versus multiplexing tradeoff for a frequency selective i.i.d. Rayleigh MIMO channel. This tradeoff is shown to be better than the one of the frequency flat MIMO channel. Traditional approaches for frequency selective channels use OFDM techniques in order to exploit the diversity gain due to frequency selectivity. We show that although coding in OFDM over a sufficient subset of subcarriers allows to exploit full diversity as such (at fixed rate), such an approach leads to a suboptimal diversity vs multiplexing tradeoff","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116946777","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523573
A. Eckford, Wei Yu
This paper deals with the design and analysis of low-density parity-check (LDPC) codes for the Slepian-Wolf problem. The main contribution is a code design method based on a density evolution (DE) analysis for the cases where multiple LDPC codes are simultaneously decoded at the decoder. Good source codes are designed both for memoryless sources and sources with Markov memory. Further, simultaneous decoding is generalized to the case of source splitting, which allows non-corner points of the Slepian-Wolf region to be achieved even for sources with equiprobable marginal distributions
{"title":"Density evolution for the simultaneous decoding of LDPC-based slepian-wolf source codes","authors":"A. Eckford, Wei Yu","doi":"10.1109/ISIT.2005.1523573","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523573","url":null,"abstract":"This paper deals with the design and analysis of low-density parity-check (LDPC) codes for the Slepian-Wolf problem. The main contribution is a code design method based on a density evolution (DE) analysis for the cases where multiple LDPC codes are simultaneously decoded at the decoder. Good source codes are designed both for memoryless sources and sources with Markov memory. Further, simultaneous decoding is generalized to the case of source splitting, which allows non-corner points of the Slepian-Wolf region to be achieved even for sources with equiprobable marginal distributions","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"331 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115023996","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523500
N. Sommer, M. Feder, O. Shalvi
The problem of finding the closest lattice point arises in several communication problems, and is known to be NP-hard. Existing methods to solve the problem are based on the sphere decoder, which searches for all the lattice points in a sphere around the received point. The sphere decoder is general and does not exploit the noise properties of the communication channel. In this paper we suggest to use sequential decoding algorithms for this problem. In particular, we propose an algorithm based on the well known Fano algorithm that naturally exploits the noise structure, hence offers a significant complexity reduction with respect to the sphere decoder with only a small penalty in error performance. Two further improvements are suggested. The first is bidirectional stack decoding, where the stack is implemented using a heap data structure to avoid sorting. The second is interleaved decoding, where the possibility to choose an arbitrary search order along the lattice coordinates is used to interleave noise bursts at the receiver. Finally, a lower bound is found for the computational cutoff rate of sequential lattice decoding
{"title":"Closest point search in lattices using sequential decoding","authors":"N. Sommer, M. Feder, O. Shalvi","doi":"10.1109/ISIT.2005.1523500","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523500","url":null,"abstract":"The problem of finding the closest lattice point arises in several communication problems, and is known to be NP-hard. Existing methods to solve the problem are based on the sphere decoder, which searches for all the lattice points in a sphere around the received point. The sphere decoder is general and does not exploit the noise properties of the communication channel. In this paper we suggest to use sequential decoding algorithms for this problem. In particular, we propose an algorithm based on the well known Fano algorithm that naturally exploits the noise structure, hence offers a significant complexity reduction with respect to the sphere decoder with only a small penalty in error performance. Two further improvements are suggested. The first is bidirectional stack decoding, where the stack is implemented using a heap data structure to avoid sorting. The second is interleaved decoding, where the possibility to choose an arbitrary search order along the lattice coordinates is used to interleave noise bursts at the receiver. Finally, a lower bound is found for the computational cutoff rate of sequential lattice decoding","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"264 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116576401","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
扫码关注我们
求助内容：
应助结果提醒方式：