Pub Date : 2001-06-29DOI: 10.1109/ISIT.2001.936111
V. Rykov, A. Macula, D. Torney, P. S. White
There is a need to find generalized or universal tags for multiplex genome analysis. We use sets of reverse complement cyclic codes to generate DNA codes that can be used for DNA tags. These tags are placed on DNA chips and connect with the capture tags floating in a solution. The capture tags attach themselves to these generalized codes and give us much information about an individual strand. We show that the reverse complement cyclic and shortening cyclic codes are suitable for this application. We found theoretical bounds of parameters for these codes and the parameters and the generator polynomials of these codes for length up to 41.
{"title":"DNA sequences and quaternary cyclic codes","authors":"V. Rykov, A. Macula, D. Torney, P. S. White","doi":"10.1109/ISIT.2001.936111","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936111","url":null,"abstract":"There is a need to find generalized or universal tags for multiplex genome analysis. We use sets of reverse complement cyclic codes to generate DNA codes that can be used for DNA tags. These tags are placed on DNA chips and connect with the capture tags floating in a solution. The capture tags attach themselves to these generalized codes and give us much information about an individual strand. We show that the reverse complement cyclic and shortening cyclic codes are suitable for this application. We found theoretical bounds of parameters for these codes and the parameters and the generator polynomials of these codes for length up to 41.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132846338","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-29DOI: 10.1109/ISIT.2001.936076
Adrish Banerjee, D. Costello, T. Fuja
A type-I hybrid-ARQ scheme using multiple turbo codes is proposed. It uses turbo coded bit interleaved modulation for high bandwidth efficiency. The structure of parallel concatenated codes is exploited for diversity combining.
{"title":"Diversity combining techniques for bandwidth-efficient turbo ARQ systems","authors":"Adrish Banerjee, D. Costello, T. Fuja","doi":"10.1109/ISIT.2001.936076","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936076","url":null,"abstract":"A type-I hybrid-ARQ scheme using multiple turbo codes is proposed. It uses turbo coded bit interleaved modulation for high bandwidth efficiency. The structure of parallel concatenated codes is exploited for diversity combining.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121185524","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-29DOI: 10.1109/ISIT.2001.936138
S. Hranilovic, F. Kschischang
We define lattice codes for the optical intensity direct-detection channel. These codes obey a non-negativity constraint and are shaped to minimize average optical power. Expressions for the coding and shaping gain of such codes over a rectangular PAM baseline are presented. Over short distances, we show that lattice codes provide significant rate gains for free-space optical links.
{"title":"Signal constellation design for optical intensity modulated channels","authors":"S. Hranilovic, F. Kschischang","doi":"10.1109/ISIT.2001.936138","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936138","url":null,"abstract":"We define lattice codes for the optical intensity direct-detection channel. These codes obey a non-negativity constraint and are shaped to minimize average optical power. Expressions for the coding and shaping gain of such codes over a rectangular PAM baseline are presented. Over short distances, we show that lattice codes provide significant rate gains for free-space optical links.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132221453","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-29DOI: 10.1109/ISIT.2001.935865
Shu Lin, Heng Tang, Y. Kou
A new class of geometry LDPC codes is presented which contains the class of Kou-Lin-Fossorier codes (see IEEE International Symposium on Information Theory, p.200, June 2000) as a subclass. If the code construction is based on Euclidean geometry (EG) and projective geometry (PG) over finite fields, we obtain four classes of LDPC codes, namely: (1) type-I EG-LDPC codes; (2) type-II EG-LDPC codes; (3) type-I PG-LDPC codes; and (4) type-II PG-LDPC codes.
{"title":"On a class of finite geometry low density parity check codes","authors":"Shu Lin, Heng Tang, Y. Kou","doi":"10.1109/ISIT.2001.935865","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935865","url":null,"abstract":"A new class of geometry LDPC codes is presented which contains the class of Kou-Lin-Fossorier codes (see IEEE International Symposium on Information Theory, p.200, June 2000) as a subclass. If the code construction is based on Euclidean geometry (EG) and projective geometry (PG) over finite fields, we obtain four classes of LDPC codes, namely: (1) type-I EG-LDPC codes; (2) type-II EG-LDPC codes; (3) type-I PG-LDPC codes; and (4) type-II PG-LDPC codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123698667","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-29DOI: 10.1109/ISIT.2001.936050
Ge Yubo, Xie Xinyan Ge
There are some problems that disturb researchers and developers working on multidimensional signal processing as computer senses. One of these problems is to find more reasonable characteristic parameters for speeches, letters, maps and senses. As is known, LPC-CEP coefficients as the main parameters drawing from signals are widely used and, unfortunately, in the parameter space of which some signals cannot be distinguished. Moreover LPC-CEP coefficients are obtained based on the linear AR (auto-regression) model, so assumption of certain stability for these signals is necessary and the order of the AR model cannot help to simplify the model from ARMA(p,q). But we must address the nonlinear signal to deal with the above information. Finally, the space possess too high a multidimensional number to calculate in time. To avoid these troubles and to strengthen the ability of the models, we study a type of nonlinear stochastic models, AR(p)-MA(q).
{"title":"Nonlinear stochastic models and new parameters of computer speech recognition","authors":"Ge Yubo, Xie Xinyan Ge","doi":"10.1109/ISIT.2001.936050","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936050","url":null,"abstract":"There are some problems that disturb researchers and developers working on multidimensional signal processing as computer senses. One of these problems is to find more reasonable characteristic parameters for speeches, letters, maps and senses. As is known, LPC-CEP coefficients as the main parameters drawing from signals are widely used and, unfortunately, in the parameter space of which some signals cannot be distinguished. Moreover LPC-CEP coefficients are obtained based on the linear AR (auto-regression) model, so assumption of certain stability for these signals is necessary and the order of the AR model cannot help to simplify the model from ARMA(p,q). But we must address the nonlinear signal to deal with the above information. Finally, the space possess too high a multidimensional number to calculate in time. To avoid these troubles and to strengthen the ability of the models, we study a type of nonlinear stochastic models, AR(p)-MA(q).","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128344385","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.935933
A. Thangaraj, S. McLaughlin
We consider a graphical procedure to calculate the coding threshold for regular low-density parity-check (LDPC) codes over binary-input partial response (PR) channels using Gaussian approximations. The calculated threshold, while serving as a target for design of LDPC codes over PR channels, can also be used as a upper bound on the capacity-achieving SNR of PR channels.
{"title":"Threshold for regular LDPC codes over PR channels","authors":"A. Thangaraj, S. McLaughlin","doi":"10.1109/ISIT.2001.935933","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935933","url":null,"abstract":"We consider a graphical procedure to calculate the coding threshold for regular low-density parity-check (LDPC) codes over binary-input partial response (PR) channels using Gaussian approximations. The calculated threshold, while serving as a target for design of LDPC codes over PR channels, can also be used as a upper bound on the capacity-achieving SNR of PR channels.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"51 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":"123118448","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.936071
Brian M. Sadler, R. Kozick
Constrained Cramer-Rao bounds (CRBs) are developed for multiple-input multiple-output (MIMO) scenarios, including both instantaneous and convolutive mixing. We find the convolutive MIMO Fisher information matrix (FIM) and study its properties. While this FIM is generally rank deficient, we establish equality constraints to achieve regularity. We employ the constrained CRB formulation of Gorman and Hero (1990) and Stoica and Ng (see IEEE SPL, vol.6, no.7, p.177-79, 1998), allowing the incorporation of side information into the bounds. This framework provides bounds on many algorithms proposed in the literature for MIMO channel and source estimation that exploit various kinds of side information, including semi-blind, constant modulus, and others.
{"title":"Constrained Cramer-Rao bounds on source separation","authors":"Brian M. Sadler, R. Kozick","doi":"10.1109/ISIT.2001.936071","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936071","url":null,"abstract":"Constrained Cramer-Rao bounds (CRBs) are developed for multiple-input multiple-output (MIMO) scenarios, including both instantaneous and convolutive mixing. We find the convolutive MIMO Fisher information matrix (FIM) and study its properties. While this FIM is generally rank deficient, we establish equality constraints to achieve regularity. We employ the constrained CRB formulation of Gorman and Hero (1990) and Stoica and Ng (see IEEE SPL, vol.6, no.7, p.177-79, 1998), allowing the incorporation of side information into the bounds. This framework provides bounds on many algorithms proposed in the literature for MIMO channel and source estimation that exploit various kinds of side information, including semi-blind, constant modulus, and others.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"104 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":"124288648","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.935888
J. Haring, A. Vinck
We consider the application of complex number (CN) codes to achieve a diversity gain when transmitting over a channel with both Gaussian and impulsive noise. By utilizing the idea of turbo decoding we derive a novel decoding algorithm for CN codes. The algorithm can be generalized for the compound channel with and without channel state information (CSI). Moreover, it can be applied when using the OFDM modulation scheme on such channels.
{"title":"Iterative decoding of codes over complex numbers","authors":"J. Haring, A. Vinck","doi":"10.1109/ISIT.2001.935888","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935888","url":null,"abstract":"We consider the application of complex number (CN) codes to achieve a diversity gain when transmitting over a channel with both Gaussian and impulsive noise. By utilizing the idea of turbo decoding we derive a novel decoding algorithm for CN codes. The algorithm can be generalized for the compound channel with and without channel state information (CSI). Moreover, it can be applied when using the OFDM modulation scheme on such channels.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"1 9-10 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":"116873026","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.936175
Heeralal Janwa, H. Mattson
For various applications in network design, computing, communication sciences, and mathematics, one needs graphs that have highly desirable properties such as low density, high vertex connectivity, small diameter, large expansion, and so on. We introduce the projective hypercubes which are suitable for network applications.
{"title":"The projective hypercube and its properties and applications","authors":"Heeralal Janwa, H. Mattson","doi":"10.1109/ISIT.2001.936175","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936175","url":null,"abstract":"For various applications in network design, computing, communication sciences, and mathematics, one needs graphs that have highly desirable properties such as low density, high vertex connectivity, small diameter, large expansion, and so on. We introduce the projective hypercubes which are suitable for network applications.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"4 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":"121049372","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.935962
H. El Gamal, A. Hammons
In earlier work (see IEEE Trans. Inform. Theory, vol.47, no.2, p.671-86, Feb. 2001), we introduced a simple technique for analyzing the iterative decoder that is broadly applicable to different classes of codes defined over graphs in certain fading as well as AWGN channels. This technique is based on the observation that the extrinsic information from constituent MAP decoders is well approximated by Gaussian random variables when the inputs to the decoders are Gaussian. The independent Gaussian model implies the existence of an iterative decoder threshold that statistically characterizes the convergence of the iterative decoder. In this paper, we present an interesting convergence-based construction for asymmetric parallel concatenated convolutional codes.
{"title":"Convergence based design of turbo codes","authors":"H. El Gamal, A. Hammons","doi":"10.1109/ISIT.2001.935962","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935962","url":null,"abstract":"In earlier work (see IEEE Trans. Inform. Theory, vol.47, no.2, p.671-86, Feb. 2001), we introduced a simple technique for analyzing the iterative decoder that is broadly applicable to different classes of codes defined over graphs in certain fading as well as AWGN channels. This technique is based on the observation that the extrinsic information from constituent MAP decoders is well approximated by Gaussian random variables when the inputs to the decoders are Gaussian. The independent Gaussian model implies the existence of an iterative decoder threshold that statistically characterizes the convergence of the iterative decoder. In this paper, we present an interesting convergence-based construction for asymmetric parallel concatenated convolutional codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"16 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":"121081167","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
扫码关注我们
求助内容：
应助结果提醒方式：