Optical orthogonal code is the main signature code employed by optical CDMA system. Starting from modern mathematics theory, finite projective geometry and Galois theory, the essential connection between optical ortho...Optical orthogonal code is the main signature code employed by optical CDMA system. Starting from modern mathematics theory, finite projective geometry and Galois theory, the essential connection between optical orthogonal code designing and finite geometry theory were discussed; find out the corresponding relationship between the parameter of OOC and that of finite geometry space. In this article, the systematic theory of OOC designing based on projective geometry is established in detail. The designing process and results of OOC on projective plane PG(2,q) and on m-dimension projective space are given respectively. Furthermore, the analytical theory for the corresponding relation between OOC with high cross-correlation and k-D manifold of projective space is set up. The OOC designing results given in this article have excellent performance, whose maximum cross-correlation is 1, and the cardinality reaches the Johnson upper bound, i.e. it realizes the optimization in both MUI and system capacity.展开更多
This paper studies the nonsystematic Low-Density Parity-Check(LDPC)codes based onSymmetric Balanced Incomplete Block Design(SBIBD).First,it is concluded that the performancedegradation of nonsystematic linear block co...This paper studies the nonsystematic Low-Density Parity-Check(LDPC)codes based onSymmetric Balanced Incomplete Block Design(SBIBD).First,it is concluded that the performancedegradation of nonsystematic linear block codes is bounded by the average row weight of generalizedinverses of their generator matrices and code rate.Then a class of nonsystematic LDPC codes con-structed based on SBIBD is presented.Their characteristics include:both generator matrices andparity-check matrices are sparse and cyclic,which are simple to encode and decode;and almost arbi-trary rate codes can be easily constructed,so they are rate-compatible codes.Because there aresparse generalized inverses of generator matrices,the performance of the proposed codes is only0.15dB away from that of the traditional systematic LDPC codes.展开更多
基金The National Natural Science Foundationof China (No.:60272048) Natural Science Foundationof JiangsuEducation Department(No.04kjb510057) China Scholarship Council
文摘Optical orthogonal code is the main signature code employed by optical CDMA system. Starting from modern mathematics theory, finite projective geometry and Galois theory, the essential connection between optical orthogonal code designing and finite geometry theory were discussed; find out the corresponding relationship between the parameter of OOC and that of finite geometry space. In this article, the systematic theory of OOC designing based on projective geometry is established in detail. The designing process and results of OOC on projective plane PG(2,q) and on m-dimension projective space are given respectively. Furthermore, the analytical theory for the corresponding relation between OOC with high cross-correlation and k-D manifold of projective space is set up. The OOC designing results given in this article have excellent performance, whose maximum cross-correlation is 1, and the cardinality reaches the Johnson upper bound, i.e. it realizes the optimization in both MUI and system capacity.
基金the National Natural Science Foundation of China(No.60272009,No.60472045,and No.60496313).
文摘This paper studies the nonsystematic Low-Density Parity-Check(LDPC)codes based onSymmetric Balanced Incomplete Block Design(SBIBD).First,it is concluded that the performancedegradation of nonsystematic linear block codes is bounded by the average row weight of generalizedinverses of their generator matrices and code rate.Then a class of nonsystematic LDPC codes con-structed based on SBIBD is presented.Their characteristics include:both generator matrices andparity-check matrices are sparse and cyclic,which are simple to encode and decode;and almost arbi-trary rate codes can be easily constructed,so they are rate-compatible codes.Because there aresparse generalized inverses of generator matrices,the performance of the proposed codes is only0.15dB away from that of the traditional systematic LDPC codes.
