Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936006
F. Zhai, I. Fair
We show that the systematic component of a terminated recursive systematic convolutional encoder provides a built-in CRC (cyclic redundancy check), and we use this characteristic to improve the performance of the mean-sign-change (MSC) criterion. In addition, we show that by concatenating an external short CRC with the MSC criterion the error detection performance can be improved even further.
{"title":"Improved performance of error detection in turbo decoding by incorporating a short CRC with the mean-sign-change criterion","authors":"F. Zhai, I. Fair","doi":"10.1109/ISIT.2001.936006","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936006","url":null,"abstract":"We show that the systematic component of a terminated recursive systematic convolutional encoder provides a built-in CRC (cyclic redundancy check), and we use this characteristic to improve the performance of the mean-sign-change (MSC) criterion. In addition, we show that by concatenating an external short CRC with the MSC criterion the error detection performance can be improved even further.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121916151","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 : 2001-06-24DOI: 10.1109/ISIT.2001.935985
Jing Li, K. Narayanan, C. Georghiades
A new class of high-rate, low-complexity and soft-decodable codes, named product accumulate codes, is proposed. The code structure, properties, thresholds and performance are investigated and it is shown that these codes are capable of near-capacity performance.
{"title":"A class of linear-complexity, soft-decodable, high-rate, \"good\" codes: construction, properties and performance","authors":"Jing Li, K. Narayanan, C. Georghiades","doi":"10.1109/ISIT.2001.935985","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935985","url":null,"abstract":"A new class of high-rate, low-complexity and soft-decodable codes, named product accumulate codes, is proposed. The code structure, properties, thresholds and performance are investigated and it is shown that these codes are capable of near-capacity performance.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117079539","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 : 2001-06-24DOI: 10.1109/ISIT.2001.935950
G. Horn, R. Karp
It is shown for a linear code over F/sub 2/L, defined by a binary parity matrix H, that the minimum weight error vector e associated with a syndrome s can be computed in polynomial time if the nonzero elements of the error vector are linearly independent over F/sub 2/L.
{"title":"A maximum likelihood polynomial time syndrome decoder to correct linearly independent errors","authors":"G. Horn, R. Karp","doi":"10.1109/ISIT.2001.935950","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935950","url":null,"abstract":"It is shown for a linear code over F/sub 2/L, defined by a binary parity matrix H, that the minimum weight error vector e associated with a syndrome s can be computed in polynomial time if the nonzero elements of the error vector are linearly independent over F/sub 2/L.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"446 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125773507","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 : 2001-06-24DOI: 10.1109/ISIT.2001.936131
A. Loeliger
Factor graphs may serve as a unifying framework for a wide variety of system models. Since the work of Wiberg (1996), there has been some awareness that factor graphs are also useful for tasks like equalization, channel estimation, synchronization, etc. In particular, factor graphs would allow the seamless integration of such sub-tasks into some "global" detection or estimation algorithm. A main issue in such applications is how to deal with continuous variables and with hybrid systems involving both discrete and continuous variables. These issues are addressed in the present paper, with a focus on equalization. It is shown that a variety of equalizing algorithms-some of them adaptive, all of them suitable for joint iterative decoding and equalization-fall right out of the general framework. Versions of most of these algorithms have previously been investigated by other authors using other notation, but some algorithms appear to be new.
{"title":"On hybrid factor graphs and adaptive equalization","authors":"A. Loeliger","doi":"10.1109/ISIT.2001.936131","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936131","url":null,"abstract":"Factor graphs may serve as a unifying framework for a wide variety of system models. Since the work of Wiberg (1996), there has been some awareness that factor graphs are also useful for tasks like equalization, channel estimation, synchronization, etc. In particular, factor graphs would allow the seamless integration of such sub-tasks into some \"global\" detection or estimation algorithm. A main issue in such applications is how to deal with continuous variables and with hybrid systems involving both discrete and continuous variables. These issues are addressed in the present paper, with a focus on equalization. It is shown that a variety of equalizing algorithms-some of them adaptive, all of them suitable for joint iterative decoding and equalization-fall right out of the general framework. Versions of most of these algorithms have previously been investigated by other authors using other notation, but some algorithms appear to be new.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127280463","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 : 2001-06-24DOI: 10.1109/ISIT.2001.936005
A. Huebner, J. Freudenberger, R. Jordan, M. Bossert
Turbo codes (TC) with unequal error protection (UEP) are introduced. We consider a serial cascade of an array of repetition codes, an interleaver, and a TC. Such a coding scheme was introduced by B.J. Frey and D.J.C. MacKay (1999) as an irregular turbo code (ITC). A lower bound on the protection level of the ITC is presented. Additionally, simulation results are shown.
{"title":"Irregular turbo codes and unequal error protection","authors":"A. Huebner, J. Freudenberger, R. Jordan, M. Bossert","doi":"10.1109/ISIT.2001.936005","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936005","url":null,"abstract":"Turbo codes (TC) with unequal error protection (UEP) are introduced. We consider a serial cascade of an array of repetition codes, an interleaver, and a TC. Such a coding scheme was introduced by B.J. Frey and D.J.C. MacKay (1999) as an irregular turbo code (ITC). A lower bound on the protection level of the ITC is presented. Additionally, simulation results are shown.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129988914","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 : 2001-06-24DOI: 10.1109/ISIT.2001.936149
R. Muller
The linear vector-valued channel x/spl rarr/ /spl Phi//sub i/M/sub i/x+z is analyzed in the asymptotic regime as the dimensions of the matrices and vectors involved become large. The eigenvalue distribution of the channel's covariance matrix is given in terms of its Stieltjes transform. The channel gets more and more ill-conditioned the more factors appear in the product. The study is of interest for cellular radio channels with receiving/transmitting antenna arrays.
{"title":"On the asymptotic eigenvalue distribution of concatenated vector-valued fading channels","authors":"R. Muller","doi":"10.1109/ISIT.2001.936149","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936149","url":null,"abstract":"The linear vector-valued channel x/spl rarr/ /spl Phi//sub i/M/sub i/x+z is analyzed in the asymptotic regime as the dimensions of the matrices and vectors involved become large. The eigenvalue distribution of the channel's covariance matrix is given in terms of its Stieltjes transform. The channel gets more and more ill-conditioned the more factors appear in the product. The study is of interest for cellular radio channels with receiving/transmitting antenna arrays.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130138460","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 : 2001-06-24DOI: 10.1109/ISIT.2001.936187
S. Mudulodu, H. Viswanathan, A. Paulraj
We analyze the cutoff rates of MIMO wireless systems where the transmitter does not have channel knowledge. We also show how such analysis can be applied to practical systems.
我们分析了发射机没有信道知识的MIMO无线系统的截止率。我们还展示了如何将这种分析应用于实际系统。
{"title":"Cutoff rate analysis of MIMO wireless systems","authors":"S. Mudulodu, H. Viswanathan, A. Paulraj","doi":"10.1109/ISIT.2001.936187","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936187","url":null,"abstract":"We analyze the cutoff rates of MIMO wireless systems where the transmitter does not have channel knowledge. We also show how such analysis can be applied to practical systems.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130205720","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 : 2001-06-24DOI: 10.1109/ISIT.2001.935956
A. Krzyżak
We derive optimal MISE kernel radial basis networks in regression estimation problem.
在回归估计问题中，给出了最优的核径向基网络。
{"title":"Nonlinear function learning using optimal radial basis function networks","authors":"A. Krzyżak","doi":"10.1109/ISIT.2001.935956","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935956","url":null,"abstract":"We derive optimal MISE kernel radial basis networks in regression estimation problem.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132036404","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 : 2001-06-24DOI: 10.1109/ISIT.2001.935936
Jing Li, K. Narayanan, C. Georghiades, E. Kurtas
A unified framework is presented to calculate the thresholds of different outer codes, including serial turbo, low density parity check codes, single-parity check turbo product codes, on partial response channels using density evolution with Gaussian approximation.
{"title":"Thresholds for iterative equalization of partial response channels using density evolution","authors":"Jing Li, K. Narayanan, C. Georghiades, E. Kurtas","doi":"10.1109/ISIT.2001.935936","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935936","url":null,"abstract":"A unified framework is presented to calculate the thresholds of different outer codes, including serial turbo, low density parity check codes, single-parity check turbo product codes, on partial response channels using density evolution with Gaussian approximation.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127926947","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 : 2001-06-24DOI: 10.1109/ISIT.2001.935964
S. Dolinar, D. Divsalar, A. Kiely, F. Pollara
We take a first empirical step toward understanding the performance-complexity tradeoffs that have newly arisen since the advent of turbo codes. For a set of turbo and turbo-like codes, we study this tradeoff, measuring the degree to which the coder/decoder fails to attain the sphere packing bound.
{"title":"Performance-complexity tradeoffs for turbo and turbo-like codes","authors":"S. Dolinar, D. Divsalar, A. Kiely, F. Pollara","doi":"10.1109/ISIT.2001.935964","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935964","url":null,"abstract":"We take a first empirical step toward understanding the performance-complexity tradeoffs that have newly arisen since the advent of turbo codes. For a set of turbo and turbo-like codes, we study this tradeoff, measuring the degree to which the coder/decoder fails to attain the sphere packing bound.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131672261","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
扫码关注我们
求助内容：
应助结果提醒方式：