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.1523393
V. Rusek, John B. Anderson
Partial response signaling (PRS) codes with maximal minimum Euclidean distance have previously been found by linear programming. These perform very well in the narrowband-high energy region, but they were not optimized for minimal bit error rate (BER), so they are only optimal in the limit of infinite signal to noise ratio. Here we search for codes that perform better for more practical signal to noise ratios. The BER objective function is no longer linear, but it is still convex
{"title":"Near BER optimal partial response codes","authors":"V. Rusek, John B. Anderson","doi":"10.1109/ISIT.2005.1523393","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523393","url":null,"abstract":"Partial response signaling (PRS) codes with maximal minimum Euclidean distance have previously been found by linear programming. These perform very well in the narrowband-high energy region, but they were not optimized for minimal bit error rate (BER), so they are only optimal in the limit of infinite signal to noise ratio. Here we search for codes that perform better for more practical signal to noise ratios. The BER objective function is no longer linear, but it is still convex","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"47 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114016231","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.1523287
J. O’Sullivan, Po-Hsiang Lai
Pattern recognition systems may be designed to recognize an exponentially large number of objects from potentially noisy measurements. We propose a design based on storing compressed representations of binary patterns corresponding to objects of interest. Sensor measurements are similarly compressed and recognition proceeds by comparing the compressed sensor measurements to the compressed representations of the objects. Parity check matrices corresponding to low density parity check codes are used for the compression. This design yields an ensemble of systems such that the probability of error goes to zero as the length of the patterns grows
{"title":"Pattern recognition system design based on LDPC matrices","authors":"J. O’Sullivan, Po-Hsiang Lai","doi":"10.1109/ISIT.2005.1523287","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523287","url":null,"abstract":"Pattern recognition systems may be designed to recognize an exponentially large number of objects from potentially noisy measurements. We propose a design based on storing compressed representations of binary patterns corresponding to objects of interest. Sensor measurements are similarly compressed and recognition proceeds by comparing the compressed sensor measurements to the compressed representations of the objects. Parity check matrices corresponding to low density parity check codes are used for the compression. This design yields an ensemble of systems such that the probability of error goes to zero as the length of the patterns grows","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"49 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":"114624561","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.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.1523708
M. Goyal, Anurag Kumar, V. Sharma
We consider an optimal power and rate scheduling problem for a multiaccess fading wireless channel with the objective of minimising a weighted sum of mean packet transmission delay subject to a peak power constraint. The base station acts as a controller which, depending upon the buffer lengths and the channel state of each user, allocates transmission rate and power to individual users. We assume perfect channel state information at the transmitter and the receiver. We also assume a Markov model for the fading and packet arrival processes. The policy obtained represents a form of indexability
{"title":"Delay optimal control algorithm for a multiaccess fading channel with peak power constraint","authors":"M. Goyal, Anurag Kumar, V. Sharma","doi":"10.1109/ISIT.2005.1523708","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523708","url":null,"abstract":"We consider an optimal power and rate scheduling problem for a multiaccess fading wireless channel with the objective of minimising a weighted sum of mean packet transmission delay subject to a peak power constraint. The base station acts as a controller which, depending upon the buffer lengths and the channel state of each user, allocates transmission rate and power to individual users. We assume perfect channel state information at the transmitter and the receiver. We also assume a Markov model for the fading and packet arrival processes. The policy obtained represents a form of indexability","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"50 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":"124501849","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.1523718
Kazuyoshi Suzuki, Mamoru Shimizu, Toshihiko Kashiyama, E. Fujiwara
Spotty byte error control codes are very effective for correcting/ detecting errors in semiconductor memory systems using recent high-density RAM chips with wide I/O data, e.g., 8, 16, or 32 bits I/O data. A spotty byte error is defined as random t-bit errors within a byte of length b-bit, where t les b, and also m-spotty byte errors as multiple spotty byte errors in a byte. In semiconductor memory systems, in general, errors are occurred in a limited number of RAM chips, that is, occurred in a limited number of bytes. Considering this situation, this paper presents a new class of m-spotty byte error control codes where errors are confined to a limited number of bytes. The proposed codes require much smaller check-bit length than the conventional m-spotty byte error control codes and the RS codes. And also, this paper clarifies a decoding algorithm of the proposed codes
{"title":"A class of error control codes for M-spotty byte errors occurred in a limited number of bytes","authors":"Kazuyoshi Suzuki, Mamoru Shimizu, Toshihiko Kashiyama, E. Fujiwara","doi":"10.1109/ISIT.2005.1523718","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523718","url":null,"abstract":"Spotty byte error control codes are very effective for correcting/ detecting errors in semiconductor memory systems using recent high-density RAM chips with wide I/O data, e.g., 8, 16, or 32 bits I/O data. A spotty byte error is defined as random t-bit errors within a byte of length b-bit, where t les b, and also m-spotty byte errors as multiple spotty byte errors in a byte. In semiconductor memory systems, in general, errors are occurred in a limited number of RAM chips, that is, occurred in a limited number of bytes. Considering this situation, this paper presents a new class of m-spotty byte error control codes where errors are confined to a limited number of bytes. The proposed codes require much smaller check-bit length than the conventional m-spotty byte error control codes and the RS codes. And also, this paper clarifies a decoding algorithm of the proposed codes","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"138 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":"123257965","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.1523585
P. Oprisan, B. Bose
This paper introduces a type-I hybrid ARQ scheme for the Z-channel, based on a class of codes which can correct t asymmetric errors and further detect d (d > t) more. The specific parameters of the ARQ schemes are considered and an upper bound on the probability of undetected error is derived. We give a couple of detailed examples based on classic inner error correcting codes. They show good behavior of this scheme in terms of error rate and throughput
{"title":"Error correction with feedback for asymmetric errors","authors":"P. Oprisan, B. Bose","doi":"10.1109/ISIT.2005.1523585","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523585","url":null,"abstract":"This paper introduces a type-I hybrid ARQ scheme for the Z-channel, based on a class of codes which can correct t asymmetric errors and further detect d (d > t) more. The specific parameters of the ARQ schemes are considered and an upper bound on the probability of undetected error is derived. We give a couple of detailed examples based on classic inner error correcting codes. They show good behavior of this scheme in terms of error rate and throughput","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"47 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":"123474976","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
扫码关注我们
求助内容：
应助结果提醒方式：