In this paper,we introduce the real pairwise completely positive(RPCP)matrices with one of them is necessarily positive semidefinite while the other one is necessarily entrywise nonnegative,which has a real pairwise c...In this paper,we introduce the real pairwise completely positive(RPCP)matrices with one of them is necessarily positive semidefinite while the other one is necessarily entrywise nonnegative,which has a real pairwise completely positive(RPCP)decomposition.We study the properties of RPCP matrices and give some necessary and sufficient conditions for a matrix pair to be RPCP.First,we give an equivalent decomposition for the RPCP matrices,which is different from the RPCP-decomposition and show that the matrix pair(X,X)is RPCP if and only if X is completely positive.Besides,we also prove that the RPCP matrices checking problem is equivalent to the separable completion problem.A semidefinite algorithm is also proposed for detecting whether or not a matrix pair is RPCP.The asymptotic and finite convergence of the algorithm are also discussed.If it is RPCP,we can further give a RPCP-decomposition for it;if it is not,we can obtain a certificate for this.展开更多
We display sharp bounds for upper and lower spectrum of a Hermitizable tridiagonal matrix.The representations are brought to light by exploiting the characteristic for eigenpairs(eigenvalue and its corresponding eigen...We display sharp bounds for upper and lower spectrum of a Hermitizable tridiagonal matrix.The representations are brought to light by exploiting the characteristic for eigenpairs(eigenvalue and its corresponding eigenvector)of tridiagonal matrices,isospectral transforms and sharp bounds for speed stability of birth-death processes.展开更多
In this paper, we provide some new necessary and sufficient conditions for generalized diagonally dominant matrices and also obtain some criteria for nongeneralized dominant matrices.
On the basis of the paoers[3—7],this paper study the monotonicity problems for the positive semidefinite generalized inverses of the positive semidefinite self-conjugate matrices of quaternions in the Lowner partial ...On the basis of the paoers[3—7],this paper study the monotonicity problems for the positive semidefinite generalized inverses of the positive semidefinite self-conjugate matrices of quaternions in the Lowner partial order,give the explicit formulations of the monotonicity solution sets A{1;≥,T_1;≤B^(1)}and B{1;≥,T_2≥A^(1)}for the(1)-inverse,and two results of the monotonicity charac teriaztion for the(1,2)-inverse.展开更多
The problem of best approximating, a given square complex matrix in the Frobenius norm by normal matrices under a given spectral restriction is considered. The ne cessary and sufficient condition for the solvability ...The problem of best approximating, a given square complex matrix in the Frobenius norm by normal matrices under a given spectral restriction is considered. The ne cessary and sufficient condition for the solvability of the problem is given. A numerical algorithm for solving the problem is provided and a numerical example is presented.展开更多
The major objective of this work was to establish a structural state-space model to estimate the dynamic origin-destination(O-D) matrices for urban rail transit network, using in- and out-flows at each station from au...The major objective of this work was to establish a structural state-space model to estimate the dynamic origin-destination(O-D) matrices for urban rail transit network, using in- and out-flows at each station from automatic fare collection(AFC) system as the real time observed passenger flow counts. For lacking of measurable passenger flow information, the proposed model employs priori O-D matrices and travel time distribution from historical travel records in AFC system to establish the dynamic system equations. An arriving rate based on travel time distribution is defined to identify the dynamic interrelations between time-varying O-D flows and observed flows, which greatly decreases the computational complexity and improve the model's applicability for large-scale network. This methodology is tested in a real transit network from Beijing subway network in China through comparing the predicted matrices with the true matrices. Case study results indicate that the proposed model is effective and applicative for estimating dynamic O-D matrices for large-scale rail transit network.展开更多
Objective:To formulate and evaluate the application of PEGylated mucin in oral bioadhesive drug(OBD) delivery system.Methods:The bioadhesive strength of different formulation ratios of polyethylene glycol(PEG) and muc...Objective:To formulate and evaluate the application of PEGylated mucin in oral bioadhesive drug(OBD) delivery system.Methods:The bioadhesive strength of different formulation ratios of polyethylene glycol(PEG) and mucin was evaluated by tensiometry.Co polymer matrices containing mucin and PEG(PEGylated mucin) in the following ratios of 1:1(A),2:1(B),1:2(C), 0:1(D) and 1:0(E) were prepared by co-precipitation.Microparticles were prepared from the matrices using a size reduction technique.Five different samples were prepared using direct mixtures in the appropriate solvenfs having mucin and PEG ratios of 1:1,2:1,1:2,0:1, 1:0 and labeled as(A-E).The matrices were evaluated for their flow properties and the in vitro bioadhesion characteristics of the samples were examined.Results:The range of flow rates of the matrices was 1.35-2.23 g/sec.The angle of repose was in the range of 37.3-39.9 degree.The bulk and tapped densities were within the ranges of 0.41- 0.49.The Hausner’s quotient(HQ) were 1.12, 1.24,1.14,1.25 and 1.2 for matrix batches A-E respectively,The bioadhesive strength of polymer matrices appeared to be directly related to amount of mucin.The order of bioadhesive strength is 2:1】1:1】1:0】1:2】0:1 of PEG:mucin in both simulated intestine fluid(SEP) and simulated gastrointestinal fluid(SGF).The physical properties of the micrometrics properties of the matrices were within the accepted values.Conclusions:OBD preparation containing PEGylated mucin can be prepared by direct compression and be used in drug delivery to the oral cavity.展开更多
Let A ∈ B（X） and B ∈ B（Y）, Me be an operator on Banach space X ＋ Y given by Mc =（A C 0 B）A generalized Drazin spectrum defined by σgD（T） = {λ∈C ： T-λI is not generalized Drazin invertible} is considere...Let A ∈ B（X） and B ∈ B（Y）, Me be an operator on Banach space X ＋ Y given by Mc =（A C 0 B）A generalized Drazin spectrum defined by σgD（T） = {λ∈C ： T-λI is not generalized Drazin invertible} is considered in this paper. It is shown that展开更多
The problem of solving type-2 fuzzy relation equations is investigated. In order to apply semi-tensor product of matrices, a new matrix analysis method and tool, to solve type-2 fuzzy relation equations, a type-2 fuzz...The problem of solving type-2 fuzzy relation equations is investigated. In order to apply semi-tensor product of matrices, a new matrix analysis method and tool, to solve type-2 fuzzy relation equations, a type-2 fuzzy relation is decomposed into two parts as principal sub-matrices and secondary sub-matrices; an r-ary symmetrical-valued type-2 fuzzy relation model and its corresponding symmetrical-valued type-2 fuzzy relation equation model are established. Then, two algorithms are developed for solving type-2 fuzzy relation equations, one of which gives a theoretical description for general type-2 fuzzy relation equations; the other one can find all the solutions to the symmetrical-valued ones. The results can improve designing type-2 fuzzy controllers, because it provides knowledge to search the optimal solutions or to find the reason if there is no solution. Finally some numerical examples verify the correctness of the results/algorithms.展开更多
Although Gaussian random matrices play an important role of measurement matrices in compressed sensing, one hopes that there exist other random matrices which can also be used to serve as the measurement matrices. Hen...Although Gaussian random matrices play an important role of measurement matrices in compressed sensing, one hopes that there exist other random matrices which can also be used to serve as the measurement matrices. Hence, Weibull random matrices induce extensive interest. In this paper, we first propose the lrobust null space property that can weaken the D-RIP, and show that Weibull random matrices satisfy the lrobust null space property with high probability. Besides, we prove that Weibull random matrices also possess the lquotient property with high probability. Finally, with the combination of the above mentioned properties,we give two important approximation characteristics of the solutions to the l-minimization with Weibull random matrices, one is on the stability estimate when the measurement noise e ∈ R~n needs a priori ‖e‖≤ε, the other is on the robustness estimate without needing to estimate the bound of ‖e‖. The results indicate that the performance of Weibull random matrices is similar to that of Gaussian random matrices in sparse recovery.展开更多
This paper studies local exponential synchronization of complex delayed networks with switching topology via switched system stability theory. First, by a common unitary matrix, the problem of synchronization is trans...This paper studies local exponential synchronization of complex delayed networks with switching topology via switched system stability theory. First, by a common unitary matrix, the problem of synchronization is transformed into the stability analysis of some linear switched delay systems. Then, when all subnetworks are synchronizable, a delay-dependent sufficient condition is given in terms of linear matrix inequalities （LMIs） which guarantees the solvability of the synchronization problem under an average dwell time scheme. We extend this result to the case that not all subnetworks are synchronizable. It is shown that in addition to average dwell time, if the ratio of the total activation time of synchronizable and non-synchronizable subnetworks satisfy an extra condition, then the problem is also solvable. Two numerical examples of delayed dynamical networks with switching topology are given, which demonstrate the effectiveness of obtained results.展开更多
This paper researches the following inverse eigenvalue problem for arrow-like matrices. Give two characteristic pairs, get a generalized arrow-like matrix, let the two characteristic pairs are the characteristic pairs...This paper researches the following inverse eigenvalue problem for arrow-like matrices. Give two characteristic pairs, get a generalized arrow-like matrix, let the two characteristic pairs are the characteristic pairs of this generalized arrow-like matrix. The expression and an algorithm of the solution of the problem is given, and a numerical example is provided.展开更多
A comprehensive study is presented for empirical seismic vulnerability assessment of typical structural types, representative of the building stock of Southern Europe, based on a large set of damage statistics. The ob...A comprehensive study is presented for empirical seismic vulnerability assessment of typical structural types, representative of the building stock of Southern Europe, based on a large set of damage statistics. The observational database was obtained from post-earthquake surveys carried out in the area struck by the September 7, 1999 Athens earthquake. After analysis of the collected observational data, a unified damage database has been created which comprises 180,945 damaged buildings from/after the near-field area of the earthquake. The damaged buildings are classified in specific structural types, according to the materials, seismic codes and construction techniques in Southern Europe. The seismic demand is described in terms of both the regional macroseismic intensity and the ratio αg/ao, where αg is the maximum peak ground acceleration （PGA） of the earthquake event and ao is the unique value PGA that characterizes each municipality shown on the Greek hazard map. The relative and cumulative frequencies of the different damage states for each structural type and each intensity level are computed in terms of damage ratio. Damage probability matrices （DPMs） and vulnerability curves are obtained for specific structural types. A comparison analysis is fulfilled between the produced and the existing vulnerability models.展开更多
In this paper, we consider data separation problem, where the original signal is composed of two distinct subcomponents, via dual frames based Split-analysis approach. We show that the two distinct subcomponents, whic...In this paper, we consider data separation problem, where the original signal is composed of two distinct subcomponents, via dual frames based Split-analysis approach. We show that the two distinct subcomponents, which are sparse in two diff erent general frames respectively, can be exactly recovered with high probability, when the measurement matrix is a Weibull random matrix （not Gaussian） and the two frames satisfy a mutual coherence property. Our result may be significant for analysing Split-analysis model for data separation.展开更多
Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules...Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS, of a successful im-personation attack and of a successful substitution attack respectively, of these codes are also computed.展开更多
When compressed sensing is introduced into the moment method,a 3D electromagnetic scattering problem over a wide angle can be solved rapidly,and the selection of sparse basis has a direct influence on the performance ...When compressed sensing is introduced into the moment method,a 3D electromagnetic scattering problem over a wide angle can be solved rapidly,and the selection of sparse basis has a direct influence on the performance of this algorithm,especially the number of measurements.We set up five sparse transform matrices by discretization of five types of classical orthogonal polynomials,i.e.,Legendre,Chebyshev,the second kind of Chebyshev,Laguerre,and Hermite polynomials.Performances of the algorithm using these matrices are compared via numerical experiments,and the results show that some of them obviously work excellently and can accelerate wide angle scattering analysis greatly.展开更多
The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder nee...The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder needs to store every ＂1＂ of the generator matrices by using huge chip area. In order to solve this problem, we need to design the protograph LDPC codes with circular generator matrices. A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed. The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix. This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices, and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem. Simulation results in ad- ditive white Gaussian noise （AWGN） channels show that the bit error rate （BER） performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.展开更多
Two new design approaches for constructing Low-Density Parity-Check(LDPC) codes are proposed.One is used to design regular Quasi-Cyclic LDPC(QC-LDPC) codes with girth at least 8.The other is used to design irregular L...Two new design approaches for constructing Low-Density Parity-Check(LDPC) codes are proposed.One is used to design regular Quasi-Cyclic LDPC(QC-LDPC) codes with girth at least 8.The other is used to design irregular LDPC codes.Both of their parity-check matrices are composed of Circulant Permutation Matrices(CPMs).When iteratively decoded with the Sum-Product Algorithm(SPA),these proposed codes exhibit good performances over the AWGN channel.展开更多
文摘In this paper,we introduce the real pairwise completely positive(RPCP)matrices with one of them is necessarily positive semidefinite while the other one is necessarily entrywise nonnegative,which has a real pairwise completely positive(RPCP)decomposition.We study the properties of RPCP matrices and give some necessary and sufficient conditions for a matrix pair to be RPCP.First,we give an equivalent decomposition for the RPCP matrices,which is different from the RPCP-decomposition and show that the matrix pair(X,X)is RPCP if and only if X is completely positive.Besides,we also prove that the RPCP matrices checking problem is equivalent to the separable completion problem.A semidefinite algorithm is also proposed for detecting whether or not a matrix pair is RPCP.The asymptotic and finite convergence of the algorithm are also discussed.If it is RPCP,we can further give a RPCP-decomposition for it;if it is not,we can obtain a certificate for this.
基金Supported by the National Natural Science Foundation of China(Grant Nos.11771046,12101186)Beijing Natural Science Foundation(Grant No.1254039).
文摘We display sharp bounds for upper and lower spectrum of a Hermitizable tridiagonal matrix.The representations are brought to light by exploiting the characteristic for eigenpairs(eigenvalue and its corresponding eigenvector)of tridiagonal matrices,isospectral transforms and sharp bounds for speed stability of birth-death processes.
文摘In this paper, we provide some new necessary and sufficient conditions for generalized diagonally dominant matrices and also obtain some criteria for nongeneralized dominant matrices.
文摘On the basis of the paoers[3—7],this paper study the monotonicity problems for the positive semidefinite generalized inverses of the positive semidefinite self-conjugate matrices of quaternions in the Lowner partial order,give the explicit formulations of the monotonicity solution sets A{1;≥,T_1;≤B^(1)}and B{1;≥,T_2≥A^(1)}for the(1)-inverse,and two results of the monotonicity charac teriaztion for the(1,2)-inverse.
文摘The problem of best approximating, a given square complex matrix in the Frobenius norm by normal matrices under a given spectral restriction is considered. The ne cessary and sufficient condition for the solvability of the problem is given. A numerical algorithm for solving the problem is provided and a numerical example is presented.
基金Project(51478036)supported by the National Natural Science Foundation of ChinaProject(20120009110016)supported by Research Fund for Doctoral Program of Higher EducationChina
文摘The major objective of this work was to establish a structural state-space model to estimate the dynamic origin-destination(O-D) matrices for urban rail transit network, using in- and out-flows at each station from automatic fare collection(AFC) system as the real time observed passenger flow counts. For lacking of measurable passenger flow information, the proposed model employs priori O-D matrices and travel time distribution from historical travel records in AFC system to establish the dynamic system equations. An arriving rate based on travel time distribution is defined to identify the dynamic interrelations between time-varying O-D flows and observed flows, which greatly decreases the computational complexity and improve the model's applicability for large-scale network. This methodology is tested in a real transit network from Beijing subway network in China through comparing the predicted matrices with the true matrices. Case study results indicate that the proposed model is effective and applicative for estimating dynamic O-D matrices for large-scale rail transit network.
文摘Objective:To formulate and evaluate the application of PEGylated mucin in oral bioadhesive drug(OBD) delivery system.Methods:The bioadhesive strength of different formulation ratios of polyethylene glycol(PEG) and mucin was evaluated by tensiometry.Co polymer matrices containing mucin and PEG(PEGylated mucin) in the following ratios of 1:1(A),2:1(B),1:2(C), 0:1(D) and 1:0(E) were prepared by co-precipitation.Microparticles were prepared from the matrices using a size reduction technique.Five different samples were prepared using direct mixtures in the appropriate solvenfs having mucin and PEG ratios of 1:1,2:1,1:2,0:1, 1:0 and labeled as(A-E).The matrices were evaluated for their flow properties and the in vitro bioadhesion characteristics of the samples were examined.Results:The range of flow rates of the matrices was 1.35-2.23 g/sec.The angle of repose was in the range of 37.3-39.9 degree.The bulk and tapped densities were within the ranges of 0.41- 0.49.The Hausner’s quotient(HQ) were 1.12, 1.24,1.14,1.25 and 1.2 for matrix batches A-E respectively,The bioadhesive strength of polymer matrices appeared to be directly related to amount of mucin.The order of bioadhesive strength is 2:1】1:1】1:0】1:2】0:1 of PEG:mucin in both simulated intestine fluid(SEP) and simulated gastrointestinal fluid(SGF).The physical properties of the micrometrics properties of the matrices were within the accepted values.Conclusions:OBD preparation containing PEGylated mucin can be prepared by direct compression and be used in drug delivery to the oral cavity.
基金Supported by the National Natural Science Foundation of China(11301077,1117131,11171066 and11226113)Foundation of the Education Department of Fujian Province(JA12074)the Natural ScienceFoundation of Fujian Province(2012J05003)
文摘Let A ∈ B（X） and B ∈ B（Y）, Me be an operator on Banach space X ＋ Y given by Mc =（A C 0 B）A generalized Drazin spectrum defined by σgD（T） = {λ∈C ： T-λI is not generalized Drazin invertible} is considered in this paper. It is shown that
基金This work was partially supported by the Natural Science Foundation of China （No. 611 74094） the Tianjin Natural Science Foundation of China （No. 13JCYBJC1 7400） the Program for New Century Excellent Talents in University of China （No. NCET-10-0506）.
文摘The problem of solving type-2 fuzzy relation equations is investigated. In order to apply semi-tensor product of matrices, a new matrix analysis method and tool, to solve type-2 fuzzy relation equations, a type-2 fuzzy relation is decomposed into two parts as principal sub-matrices and secondary sub-matrices; an r-ary symmetrical-valued type-2 fuzzy relation model and its corresponding symmetrical-valued type-2 fuzzy relation equation model are established. Then, two algorithms are developed for solving type-2 fuzzy relation equations, one of which gives a theoretical description for general type-2 fuzzy relation equations; the other one can find all the solutions to the symmetrical-valued ones. The results can improve designing type-2 fuzzy controllers, because it provides knowledge to search the optimal solutions or to find the reason if there is no solution. Finally some numerical examples verify the correctness of the results/algorithms.
基金Supported by the National Natural Science Foundation of China(11761003,11771347,91730306,41390454)the Natural Science Foundation of Ningxia(NZ17097)the Horizon 2020 project STEP2DYNA(691154)
文摘Although Gaussian random matrices play an important role of measurement matrices in compressed sensing, one hopes that there exist other random matrices which can also be used to serve as the measurement matrices. Hence, Weibull random matrices induce extensive interest. In this paper, we first propose the lrobust null space property that can weaken the D-RIP, and show that Weibull random matrices satisfy the lrobust null space property with high probability. Besides, we prove that Weibull random matrices also possess the lquotient property with high probability. Finally, with the combination of the above mentioned properties,we give two important approximation characteristics of the solutions to the l-minimization with Weibull random matrices, one is on the stability estimate when the measurement noise e ∈ R~n needs a priori ‖e‖≤ε, the other is on the robustness estimate without needing to estimate the bound of ‖e‖. The results indicate that the performance of Weibull random matrices is similar to that of Gaussian random matrices in sparse recovery.
基金the National Natural Science Foundation of China (No.60874024, 60574013).
文摘This paper studies local exponential synchronization of complex delayed networks with switching topology via switched system stability theory. First, by a common unitary matrix, the problem of synchronization is transformed into the stability analysis of some linear switched delay systems. Then, when all subnetworks are synchronizable, a delay-dependent sufficient condition is given in terms of linear matrix inequalities （LMIs） which guarantees the solvability of the synchronization problem under an average dwell time scheme. We extend this result to the case that not all subnetworks are synchronizable. It is shown that in addition to average dwell time, if the ratio of the total activation time of synchronizable and non-synchronizable subnetworks satisfy an extra condition, then the problem is also solvable. Two numerical examples of delayed dynamical networks with switching topology are given, which demonstrate the effectiveness of obtained results.
文摘This paper researches the following inverse eigenvalue problem for arrow-like matrices. Give two characteristic pairs, get a generalized arrow-like matrix, let the two characteristic pairs are the characteristic pairs of this generalized arrow-like matrix. The expression and an algorithm of the solution of the problem is given, and a numerical example is provided.
文摘A comprehensive study is presented for empirical seismic vulnerability assessment of typical structural types, representative of the building stock of Southern Europe, based on a large set of damage statistics. The observational database was obtained from post-earthquake surveys carried out in the area struck by the September 7, 1999 Athens earthquake. After analysis of the collected observational data, a unified damage database has been created which comprises 180,945 damaged buildings from/after the near-field area of the earthquake. The damaged buildings are classified in specific structural types, according to the materials, seismic codes and construction techniques in Southern Europe. The seismic demand is described in terms of both the regional macroseismic intensity and the ratio αg/ao, where αg is the maximum peak ground acceleration （PGA） of the earthquake event and ao is the unique value PGA that characterizes each municipality shown on the Greek hazard map. The relative and cumulative frequencies of the different damage states for each structural type and each intensity level are computed in terms of damage ratio. Damage probability matrices （DPMs） and vulnerability curves are obtained for specific structural types. A comparison analysis is fulfilled between the produced and the existing vulnerability models.
基金Supported by the National Natural Science Foundation of China(11171299 and 91130009)
文摘In this paper, we consider data separation problem, where the original signal is composed of two distinct subcomponents, via dual frames based Split-analysis approach. We show that the two distinct subcomponents, which are sparse in two diff erent general frames respectively, can be exactly recovered with high probability, when the measurement matrix is a Weibull random matrix （not Gaussian） and the two frames satisfy a mutual coherence property. Our result may be significant for analysing Split-analysis model for data separation.
文摘Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS, of a successful im-personation attack and of a successful substitution attack respectively, of these codes are also computed.
基金Supported by the Key Program of National Natural Science Foundation of China under Grant No 60931002the National Natural Science Foundation of China under Grant Nos 61001033,61101064 and 51277001the Key Project of the Ministry of Education of China under Grant No 212081.
文摘When compressed sensing is introduced into the moment method,a 3D electromagnetic scattering problem over a wide angle can be solved rapidly,and the selection of sparse basis has a direct influence on the performance of this algorithm,especially the number of measurements.We set up five sparse transform matrices by discretization of five types of classical orthogonal polynomials,i.e.,Legendre,Chebyshev,the second kind of Chebyshev,Laguerre,and Hermite polynomials.Performances of the algorithm using these matrices are compared via numerical experiments,and the results show that some of them obviously work excellently and can accelerate wide angle scattering analysis greatly.
基金supported by Beijing Natural Science Foundation(4102050)the National Natural Science of Foundation of China(NSFC)-Korea Science and Engineering Foundation (KOSF) Joint Research Project of China and Korea (60811140343)
文摘The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder needs to store every ＂1＂ of the generator matrices by using huge chip area. In order to solve this problem, we need to design the protograph LDPC codes with circular generator matrices. A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed. The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix. This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices, and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem. Simulation results in ad- ditive white Gaussian noise （AWGN） channels show that the bit error rate （BER） performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.
基金Supported by the National Natural Science Foundation of China(Nos.61271199,61172022)
文摘Two new design approaches for constructing Low-Density Parity-Check(LDPC) codes are proposed.One is used to design regular Quasi-Cyclic LDPC(QC-LDPC) codes with girth at least 8.The other is used to design irregular LDPC codes.Both of their parity-check matrices are composed of Circulant Permutation Matrices(CPMs).When iteratively decoded with the Sum-Product Algorithm(SPA),these proposed codes exhibit good performances over the AWGN channel.
