We consider uplink scheduling for bursty traffic. We characterize the achievable rate region for Gaussian multiple access in terms of minimum required powers, with a constraint on average transmission delay for all users. We show that delay and rate constrained, power minimizing schemes perform scheduling accompanied with power control. Further, for the class of randomized stationary schedulers, it is shown that the achievable region is a convex polytope. We highlight that power requirements of a user can be reduced by either allowing additional delay (time scheduling gain) or increasing the power of another user (multiuser power exchange). Results are presented for two user additive white Gaussian noise channel and can be extended to finite state fading channels.
{"title":"Impact of multiple access on uplink scheduling","authors":"D. Rajan, A. Sabharwal, B. Aazhang","doi":"10.1109/ITW.2001.955132","DOIUrl":"https://doi.org/10.1109/ITW.2001.955132","url":null,"abstract":"We consider uplink scheduling for bursty traffic. We characterize the achievable rate region for Gaussian multiple access in terms of minimum required powers, with a constraint on average transmission delay for all users. We show that delay and rate constrained, power minimizing schemes perform scheduling accompanied with power control. Further, for the class of randomized stationary schedulers, it is shown that the achievable region is a convex polytope. We highlight that power requirements of a user can be reduced by either allowing additional delay (time scheduling gain) or increasing the power of another user (multiuser power exchange). Results are presented for two user additive white Gaussian noise channel and can be extended to finite state fading channels.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121562530","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}
Slepian and Wolf (see IEEE Trans. Inform. Theory, vol.19, p.471-80, July 1973) first considered the data compression of correlated sources called the SW system, where two sequences emitted from correlated sources are separately encoded to codewords, and sent to a single decoder which has to output original sequence pairs. Recently, Oohama (see IEEE Trans. Inform. Theory, vol.42, p.837-47, May 1996) has extended the SW system and investigated a more general case where there are some mutual linkages between two encoders of the SW system. In this paper, we investigate variable-length coding which allows asymptotically vanishing probability of error for the system considered by Oohama. We clarify the admissible rate region for mixed sources characterized by two ergodic sources, and show that this region is strictly wider than that for fixed-length codes.
{"title":"Weak variable-length Slepian-Wolf coding with linked encoders for mixed sources","authors":"Akisato Kimura, T. Uyematsu","doi":"10.1109/ITW.2001.955143","DOIUrl":"https://doi.org/10.1109/ITW.2001.955143","url":null,"abstract":"Slepian and Wolf (see IEEE Trans. Inform. Theory, vol.19, p.471-80, July 1973) first considered the data compression of correlated sources called the SW system, where two sequences emitted from correlated sources are separately encoded to codewords, and sent to a single decoder which has to output original sequence pairs. Recently, Oohama (see IEEE Trans. Inform. Theory, vol.42, p.837-47, May 1996) has extended the SW system and investigated a more general case where there are some mutual linkages between two encoders of the SW system. In this paper, we investigate variable-length coding which allows asymptotically vanishing probability of error for the system considered by Oohama. We clarify the admissible rate region for mixed sources characterized by two ergodic sources, and show that this region is strictly wider than that for fixed-length codes.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126968953","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}
By means of the mean reliability (defined as the mean of the absolute values of log-likelihood ratios), a new design of parallel concatenated "turbo" codes is proposed. This criterion allows us to describe the behavior of the constituent decoders and, furthermore, to predict the behavior of the iterative decoder for large block lengths. The mean reliability can also be used as a stopping criterion.
{"title":"Using the mean reliability as a design and stopping criterion for turbo codes","authors":"I. Land, P. Hoeher","doi":"10.1109/ITW.2001.955125","DOIUrl":"https://doi.org/10.1109/ITW.2001.955125","url":null,"abstract":"By means of the mean reliability (defined as the mean of the absolute values of log-likelihood ratios), a new design of parallel concatenated \"turbo\" codes is proposed. This criterion allows us to describe the behavior of the constituent decoders and, furthermore, to predict the behavior of the iterative decoder for large block lengths. The mean reliability can also be used as a stopping criterion.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114287898","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}
Trellis code multiple access (TCMA) is a narrow-band multiple access scheme. There is no bandwidth expansion, so K users are using the same bandwidth as one single user. The load (the number of bits per channel use) of the system is therefore much higher than the load in, for example, conventional CDMA systems. It is shown here that the maximum number of users in a TCMA system is usually modest. This fact is based on constellation-constrained capacity, i.e., the maximum capacity of a system with a specific constellation of the transmitted symbols. The minimum required signal-to-noise ratio for reliable transmission is also given for different code rates.
{"title":"Capacity considerations for trellis code multiple access systems","authors":"F. Brannstrom, T. Aulin, L. Rasmussen","doi":"10.1109/ITW.2001.955168","DOIUrl":"https://doi.org/10.1109/ITW.2001.955168","url":null,"abstract":"Trellis code multiple access (TCMA) is a narrow-band multiple access scheme. There is no bandwidth expansion, so K users are using the same bandwidth as one single user. The load (the number of bits per channel use) of the system is therefore much higher than the load in, for example, conventional CDMA systems. It is shown here that the maximum number of users in a TCMA system is usually modest. This fact is based on constellation-constrained capacity, i.e., the maximum capacity of a system with a specific constellation of the transmitted symbols. The minimum required signal-to-noise ratio for reliable transmission is also given for different code rates.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128761107","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}
We investigate the maximum generating rate of the variable-length nonuniform i.i.d. random number. Our results are generalizations of Han's results (see IEEE Trans. Inform. Theory, vol.46, p.2108-16, Sept. 2000) on the variable-length intrinsic randomness.
{"title":"Maximum generating rate of the variable-length nonuniform random number","authors":"O. Uchida","doi":"10.1109/ITW.2001.955164","DOIUrl":"https://doi.org/10.1109/ITW.2001.955164","url":null,"abstract":"We investigate the maximum generating rate of the variable-length nonuniform i.i.d. random number. Our results are generalizations of Han's results (see IEEE Trans. Inform. Theory, vol.46, p.2108-16, Sept. 2000) on the variable-length intrinsic randomness.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129214093","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}
A design approach is presented for soft-decision decoding of block product codes ("block turbo codes") using analog computation with MOS devices. Application of analog decoding to large code sizes is also considered with the introduction of serial analog interfaces and pipeline schedules.
{"title":"Analog decoding of product codes","authors":"C. Winstead, C. Myers, C. Schlegel, R. Harrison","doi":"10.1109/ITW.2001.955161","DOIUrl":"https://doi.org/10.1109/ITW.2001.955161","url":null,"abstract":"A design approach is presented for soft-decision decoding of block product codes (\"block turbo codes\") using analog computation with MOS devices. Application of analog decoding to large code sizes is also considered with the introduction of serial analog interfaces and pipeline schedules.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115066651","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}
The random matrix model for multipath propagation on the antenna array channel is generalised to decaying power delay profiles. Results are given in terms of Stieltjes transforms of the eigenvalue distributions of the channel's space-time covariance matrix.
{"title":"A random matrix model for the antenna array channel with decaying power delay profile","authors":"R. Muller","doi":"10.1109/ITW.2001.955165","DOIUrl":"https://doi.org/10.1109/ITW.2001.955165","url":null,"abstract":"The random matrix model for multipath propagation on the antenna array channel is generalised to decaying power delay profiles. Results are given in terms of Stieltjes transforms of the eigenvalue distributions of the channel's space-time covariance matrix.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122109788","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}
Recently, several VLSI implementations of analog decoders have been reported for rate 1/2 tailbiting convolutional codes. The main advantages of analog decoders are much higher decoding speed, smaller chip size and lower power consumption when compared to an equivalent digital decoder. Since many high speed applications require code rates well above 1/2 we focus on high rate tailbiting convolutional codes. For digital decoder implementations it has been shown by C. Weiss and J. Berkmann (see Proc. 3rd ITG Conf. Source and Channel Coding, Munich, Germany, p.199-207, Jan. 2000) that it is advantageous to use the trellis of the dual code which is less complex for high rate codes. The novel analog decoder design proposed in this paper can be seen as a direct analog implementation of the algorithm described by Weiss and Berkman.
{"title":"Analog decoders for high rate convolutional codes","authors":"M. Mörz, A. Schaefer, E. Offer, J. Hagenauer","doi":"10.1109/ITW.2001.955160","DOIUrl":"https://doi.org/10.1109/ITW.2001.955160","url":null,"abstract":"Recently, several VLSI implementations of analog decoders have been reported for rate 1/2 tailbiting convolutional codes. The main advantages of analog decoders are much higher decoding speed, smaller chip size and lower power consumption when compared to an equivalent digital decoder. Since many high speed applications require code rates well above 1/2 we focus on high rate tailbiting convolutional codes. For digital decoder implementations it has been shown by C. Weiss and J. Berkmann (see Proc. 3rd ITG Conf. Source and Channel Coding, Munich, Germany, p.199-207, Jan. 2000) that it is advantageous to use the trellis of the dual code which is less complex for high rate codes. The novel analog decoder design proposed in this paper can be seen as a direct analog implementation of the algorithm described by Weiss and Berkman.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129469500","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}
The expression for stationary channel information capacity of a mobile communication channel with a large number of receiving antennas in the presence of multipath signal propagation is shown. It has been shown that the capacity is approaching information capacity of the orthogonal Gaussian channel with no interference. The system with adaptive linear MMSE receivers and adaptive interference cancellation is presented as a possible low computational complexity solution achieving the theoretical capacity.
{"title":"Information capacity of a multipath mobile communication channel with large number of receiving antennas","authors":"P. Rapajic","doi":"10.1109/ITW.2001.955151","DOIUrl":"https://doi.org/10.1109/ITW.2001.955151","url":null,"abstract":"The expression for stationary channel information capacity of a mobile communication channel with a large number of receiving antennas in the presence of multipath signal propagation is shown. It has been shown that the capacity is approaching information capacity of the orthogonal Gaussian channel with no interference. The system with adaptive linear MMSE receivers and adaptive interference cancellation is presented as a possible low computational complexity solution achieving the theoretical capacity.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"6 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131722692","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}
We report the progress in concatenated tree (CT) codes and related schemes, including low rate codes for CDMA applications and bandwidth efficient coded modulation schemes. It is shown that CT codes provide efficient solutions for various situations. Near capacity performances (within about 0.5 dB) can be achieved at significantly reduced decoding costs.
{"title":"Concatenated tree codes and related schemes","authors":"L. Ping, B. Bai, K.W.W. Leung","doi":"10.1109/ITW.2001.955141","DOIUrl":"https://doi.org/10.1109/ITW.2001.955141","url":null,"abstract":"We report the progress in concatenated tree (CT) codes and related schemes, including low rate codes for CDMA applications and bandwidth efficient coded modulation schemes. It is shown that CT codes provide efficient solutions for various situations. Near capacity performances (within about 0.5 dB) can be achieved at significantly reduced decoding costs.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"86 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126290897","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
扫码关注我们
求助内容：
应助结果提醒方式：