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.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.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}
Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523606
Hongyuan Zhang, H. Dai, Quan Zhou
For MIMO diversity schemes, it is well known that antenna selection methods that optimize the post-processing signal-to-noise ratio can preserve the diversity order of the full MIMO system. On the other hand, the diversity order achieved by antenna selection in spatial multiplexing (SM) systems, especially those exploiting practical coding and decoding schemes, has not thus far been rigorously analyzed. In this paper, from a geometrical standpoint, we propose a new framework to theoretically analyze the diversity order achieved by transmit antenna selection for independently encoded SM systems with linear receivers. Our results show that a diversity order of (NT -1)(NR -1) can be achieved for an NRtimesNT SM system in which L = 2 antennas are selected from the transmit side
{"title":"A geometrical analysis on transmit antenna selection for spatial multiplexing systems with linear receivers","authors":"Hongyuan Zhang, H. Dai, Quan Zhou","doi":"10.1109/ISIT.2005.1523606","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523606","url":null,"abstract":"For MIMO diversity schemes, it is well known that antenna selection methods that optimize the post-processing signal-to-noise ratio can preserve the diversity order of the full MIMO system. On the other hand, the diversity order achieved by antenna selection in spatial multiplexing (SM) systems, especially those exploiting practical coding and decoding schemes, has not thus far been rigorously analyzed. In this paper, from a geometrical standpoint, we propose a new framework to theoretically analyze the diversity order achieved by transmit antenna selection for independently encoded SM systems with linear receivers. Our results show that a diversity order of (NT -1)(NR -1) can be achieved for an NRtimesNT SM system in which L = 2 antennas are selected from the transmit side","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"64 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":"128895410","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.1523536
Mitsugu Iwamoto, Hirosuke Yamamoto
Ramp secret sharing (SS) schemes can be classified into strong ramp SS schemes and weak ramp SS schemes. The strong ramp SS schemes do not leak out any part of a secret explicitly even in the case where some information about the secret leaks from a non-qualified set of shares, and hence, they are more desirable than weak ramp SS schemes. However, it is not known how to construct the strong ramp SS schemes in the case of general access structures. In this paper, it is shown that a strong ramp SS scheme can always be constructed from a SS scheme with plural secrets for any feasible general access structure. As a byproduct, it is pointed out that threshold ramp SS schemes based on Shamir's polynomial interpolation method are not always strong
{"title":"Strongly secure ramp secret sharing schemes","authors":"Mitsugu Iwamoto, Hirosuke Yamamoto","doi":"10.1109/ISIT.2005.1523536","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523536","url":null,"abstract":"Ramp secret sharing (SS) schemes can be classified into strong ramp SS schemes and weak ramp SS schemes. The strong ramp SS schemes do not leak out any part of a secret explicitly even in the case where some information about the secret leaks from a non-qualified set of shares, and hence, they are more desirable than weak ramp SS schemes. However, it is not known how to construct the strong ramp SS schemes in the case of general access structures. In this paper, it is shown that a strong ramp SS scheme can always be constructed from a SS scheme with plural secrets for any feasible general access structure. As a byproduct, it is pointed out that threshold ramp SS schemes based on Shamir's polynomial interpolation method are not always strong","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"44 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":"128560853","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.1523683
U. Erez, G. Wornell, M. Trott
Rateless codes are good codes of infinite length that have the property that prefixes of such codes are themselves good codes. This makes them attractive for applications in which the channel quality is uncertain, where systems transmit as much of a codeword as necessary for decoding to be possible. In particular, rateless codes are potentially attractive for wireless communication. In a recent work, a rateless coding scheme was proposed for the AWGN channel, based on layering, repetition and random dithering. We extend this scheme to multiple-input single-output (MISO) Gaussian channels. We show that the rate loss associated with orthogonal design space-time codes may be alleviated by layering and dithering, very similar to the rateless approach for the AWGN channel. We then combine the two schemes and arrive at a close-to-capacity rateless code for MISO channels. The required complexity depends on the fraction of capacity that is targeted, is linear in the capacity of the channel and does not depend on the number of transmit antennas. Furthermore, the coding scheme uses only one base AWGN code
{"title":"Rateless space-time coding","authors":"U. Erez, G. Wornell, M. Trott","doi":"10.1109/ISIT.2005.1523683","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523683","url":null,"abstract":"Rateless codes are good codes of infinite length that have the property that prefixes of such codes are themselves good codes. This makes them attractive for applications in which the channel quality is uncertain, where systems transmit as much of a codeword as necessary for decoding to be possible. In particular, rateless codes are potentially attractive for wireless communication. In a recent work, a rateless coding scheme was proposed for the AWGN channel, based on layering, repetition and random dithering. We extend this scheme to multiple-input single-output (MISO) Gaussian channels. We show that the rate loss associated with orthogonal design space-time codes may be alleviated by layering and dithering, very similar to the rateless approach for the AWGN channel. We then combine the two schemes and arrive at a close-to-capacity rateless code for MISO channels. The required complexity depends on the fraction of capacity that is targeted, is linear in the capacity of the channel and does not depend on the number of transmit antennas. Furthermore, the coding scheme uses only one base AWGN code","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"21 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":"130898551","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.1523369
J. Dauwels
An efficient message-passing algorithm for computing the Bayesian Cramer-Rao bound (BCRB) for general estimation problems is presented. The BCRB is a lower bound on the mean squared estimation error. The algorithm operates on a cycle-free factor graph of the system at hand. It can be applied to estimation in (1) general state-space models; (2) coupled state-space models and other systems that are most naturally represented by cyclic factor graphs; (3) coded systems
{"title":"Computing Bayesian Cramer-Rao bounds","authors":"J. Dauwels","doi":"10.1109/ISIT.2005.1523369","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523369","url":null,"abstract":"An efficient message-passing algorithm for computing the Bayesian Cramer-Rao bound (BCRB) for general estimation problems is presented. The BCRB is a lower bound on the mean squared estimation error. The algorithm operates on a cycle-free factor graph of the system at hand. It can be applied to estimation in (1) general state-space models; (2) coupled state-space models and other systems that are most naturally represented by cyclic factor graphs; (3) coded systems","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"28 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":"130655321","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.1523715
M. Grassl, G. White
Well known constructions are applied to chains of quasi-cyclic codes in order to achieve new codes that improve on best known bounds on the minimum distance. These techniques have previously been successfully applied to chains of cyclic and algebraic-geometric codes. In conjunction with an improved algorithm for computing the minimum weight of quasi-cyclic codes, the constructions have so far yielded 274 new codes improving the lower bounds
{"title":"New codes from chains of quasi-cyclic codes","authors":"M. Grassl, G. White","doi":"10.1109/ISIT.2005.1523715","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523715","url":null,"abstract":"Well known constructions are applied to chains of quasi-cyclic codes in order to achieve new codes that improve on best known bounds on the minimum distance. These techniques have previously been successfully applied to chains of cyclic and algebraic-geometric codes. In conjunction with an improved algorithm for computing the minimum weight of quasi-cyclic codes, the constructions have so far yielded 274 new codes improving the lower bounds","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":"130403477","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.1523405
A. Huebner, M. Lentmaier, K. Zigangirov, D. Costello
In this paper we introduce a new coding scheme - so-called laminated turbo codes. It is characterized by a block-convolutional structure that enables us to combine the advantages of a convolutional encoder memory and a block-oriented decoding method. We show that this block-convolutional structure is superior in terms of its error correction capability compared to the pure block structure of the corresponding self-concatenated code. Comparisons to turbo codes and multiple turbo codes are also included. Finally, the impact of the inter-block memory is investigated.
{"title":"Laminated turbo codes","authors":"A. Huebner, M. Lentmaier, K. Zigangirov, D. Costello","doi":"10.1109/ISIT.2005.1523405","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523405","url":null,"abstract":"In this paper we introduce a new coding scheme - so-called laminated turbo codes. It is characterized by a block-convolutional structure that enables us to combine the advantages of a convolutional encoder memory and a block-oriented decoding method. We show that this block-convolutional structure is superior in terms of its error correction capability compared to the pure block structure of the corresponding self-concatenated code. Comparisons to turbo codes and multiple turbo codes are also included. Finally, the impact of the inter-block memory is investigated.","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"63 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":"131083014","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
扫码关注我们
求助内容：
应助结果提醒方式：