This paper establishes an improvement on the QL algorithm for a symmetric tridiagonal matrix T so that we can work out the eigenvalues of T faster. Meanwhile, the new algorithm don’t worsen the stability and precisio...This paper establishes an improvement on the QL algorithm for a symmetric tridiagonal matrix T so that we can work out the eigenvalues of T faster. Meanwhile, the new algorithm don’t worsen the stability and precision of the former algorithm.展开更多
In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix...In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix is convergent and the convergence rale of Ms kind of algorithm is generally cubic.展开更多
A pair of multichannel recursive least squares (RLS) adaptive lattice algorithms based on the order recursive of lattice filters and the superior numerical properties of Givens algorithms is derived in this paper. The...A pair of multichannel recursive least squares (RLS) adaptive lattice algorithms based on the order recursive of lattice filters and the superior numerical properties of Givens algorithms is derived in this paper. The derivation of the first algorithm is based on QR decomposition of the input data matrix directly, and the Givens rotations approach is used to compute the QR decomposition. Using first a prerotation of the input data matrix and then a repetition of the single channel Givens lattice algorithm, the second algorithm can be obtained. Both algorithms have superior numerical properties, particularly the robustness to wordlength limitations. The parameter vector to be estimated can be extracted directly from internal variables in the present algorithms without a backsolve operation with an extra triangular array. The results of computer simulation of the parameter identification of a two-channel system are presented to confirm efficiently the derivation.展开更多
QR Decompositon with an M-algorithm(QRD-M) has good performance with low complexity,which is considered as a promising technique in Multiple-Input Multiple-Output(MIMO) detections.This paper presented a simplified QRD...QR Decompositon with an M-algorithm(QRD-M) has good performance with low complexity,which is considered as a promising technique in Multiple-Input Multiple-Output(MIMO) detections.This paper presented a simplified QRD-M algorithm for MIMO Orthogonal Frequency Division Multiplexing(MIMO-OFDM) systems.In the proposed scheme,each surviving path is expanded only to partial branches in order to carry out a limited tree search.The nodes are expanded on demand and sorted in a distributed manner,based on the novel expansion scheme which can pre-determine the children's ascending order by their local distances.Consequently,the proposed scheme can significantly decrease the complexity compared with conventional QRD-M algorithm.Hence,it is especially attractive to VLSI implementation of the high-throughput MIMO-OFDM systems.Simulation results prove that the proposed scheme can achieve a performance very close to the conventional QRD-M algorithm.展开更多
Reduced Q-matrix （Qr matrix） plays an important role in the rule space model （RSM） and the attribute hierarchy method （AHM）. Based on the attribute hierarchy, a valid/invalid item is defined. The judgment method...Reduced Q-matrix （Qr matrix） plays an important role in the rule space model （RSM） and the attribute hierarchy method （AHM）. Based on the attribute hierarchy, a valid/invalid item is defined. The judgment method of the valid/invalid item is developed on the relation between reachability matrix and valid items. And valid items are explained from the perspective of graph theory. An incremental augment algorithm for constructing Qr matrix is proposed based on the idea of incremental forward regression, and its validity is theoretically considered. Results of empirical tests are given in order to compare the performance of the incremental augment algo-rithm and the Tatsuoka algorithm upon the running time. Empirical evidence shows that the algorithm outper-forms the Tatsuoka algorithm, and the analysis of the two algorithms also show linear growth with respect to the number of valid items. Mathematical models with 10 attributes are built for the two algorithms by the linear regression analysis.展开更多
随着二维码技术广泛应用于电子票务、银行支票、电子保单等多个领域,二维码的信息泄露和信息篡改等安全问题日益突出.为提高二维码内部信息的安全性能,从对二维码内部信息加密和二维码信息防篡改俩个角度来提高.基于Visual Studio 2008...随着二维码技术广泛应用于电子票务、银行支票、电子保单等多个领域,二维码的信息泄露和信息篡改等安全问题日益突出.为提高二维码内部信息的安全性能,从对二维码内部信息加密和二维码信息防篡改俩个角度来提高.基于Visual Studio 2008 C#平台,设计了一种采用SHA512哈希函数和Rijndael加密算法混合加密的方法,该方法利用Rijndael加密和SHA512数字签名等技术,对Rijndael第一次加密密钥系统随机分配,并对系统随机分配密钥采用二次Rijndael加密防护方法,并通过SHA512对二维码内部信息防篡改校验,达到对二维码信息及其加密密钥的安全保护.在生成QR二维码之前实现了信息加密,并从系统构架、算法原理和实现及安全性能等多个方面进行了测试和分析.分析表明此方法提高了二维码信息的安全性能,达到对密钥高效管理和对信息的多重保护,而在加密后密文信息容量较明文信息有所增加.展开更多
文摘This paper establishes an improvement on the QL algorithm for a symmetric tridiagonal matrix T so that we can work out the eigenvalues of T faster. Meanwhile, the new algorithm don’t worsen the stability and precision of the former algorithm.
基金The author is supported by the State Major Key Project for Basic Researches of China the National Science Ponndation of China
文摘In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix is convergent and the convergence rale of Ms kind of algorithm is generally cubic.
基金Foundation of the Academy of Electronic Science,China
文摘A pair of multichannel recursive least squares (RLS) adaptive lattice algorithms based on the order recursive of lattice filters and the superior numerical properties of Givens algorithms is derived in this paper. The derivation of the first algorithm is based on QR decomposition of the input data matrix directly, and the Givens rotations approach is used to compute the QR decomposition. Using first a prerotation of the input data matrix and then a repetition of the single channel Givens lattice algorithm, the second algorithm can be obtained. Both algorithms have superior numerical properties, particularly the robustness to wordlength limitations. The parameter vector to be estimated can be extracted directly from internal variables in the present algorithms without a backsolve operation with an extra triangular array. The results of computer simulation of the parameter identification of a two-channel system are presented to confirm efficiently the derivation.
基金Supported by the ‘Transformation of Scientific and Technological Achievements Project’ funded by the Department of Science and Technology of Jiangsu province,P.R. China (BA2006076)
文摘QR Decompositon with an M-algorithm(QRD-M) has good performance with low complexity,which is considered as a promising technique in Multiple-Input Multiple-Output(MIMO) detections.This paper presented a simplified QRD-M algorithm for MIMO Orthogonal Frequency Division Multiplexing(MIMO-OFDM) systems.In the proposed scheme,each surviving path is expanded only to partial branches in order to carry out a limited tree search.The nodes are expanded on demand and sorted in a distributed manner,based on the novel expansion scheme which can pre-determine the children's ascending order by their local distances.Consequently,the proposed scheme can significantly decrease the complexity compared with conventional QRD-M algorithm.Hence,it is especially attractive to VLSI implementation of the high-throughput MIMO-OFDM systems.Simulation results prove that the proposed scheme can achieve a performance very close to the conventional QRD-M algorithm.
基金Supported by the National Natural Science Foundation of China (30860084,60673014,60263005)the Backbone Young Teachers Foundation of Fujian Normal University(2008100244)the Department of Education Foundation of Fujian Province (ZA09047)~~
文摘Reduced Q-matrix （Qr matrix） plays an important role in the rule space model （RSM） and the attribute hierarchy method （AHM）. Based on the attribute hierarchy, a valid/invalid item is defined. The judgment method of the valid/invalid item is developed on the relation between reachability matrix and valid items. And valid items are explained from the perspective of graph theory. An incremental augment algorithm for constructing Qr matrix is proposed based on the idea of incremental forward regression, and its validity is theoretically considered. Results of empirical tests are given in order to compare the performance of the incremental augment algo-rithm and the Tatsuoka algorithm upon the running time. Empirical evidence shows that the algorithm outper-forms the Tatsuoka algorithm, and the analysis of the two algorithms also show linear growth with respect to the number of valid items. Mathematical models with 10 attributes are built for the two algorithms by the linear regression analysis.
文摘随着二维码技术广泛应用于电子票务、银行支票、电子保单等多个领域,二维码的信息泄露和信息篡改等安全问题日益突出.为提高二维码内部信息的安全性能,从对二维码内部信息加密和二维码信息防篡改俩个角度来提高.基于Visual Studio 2008 C#平台,设计了一种采用SHA512哈希函数和Rijndael加密算法混合加密的方法,该方法利用Rijndael加密和SHA512数字签名等技术,对Rijndael第一次加密密钥系统随机分配,并对系统随机分配密钥采用二次Rijndael加密防护方法,并通过SHA512对二维码内部信息防篡改校验,达到对二维码信息及其加密密钥的安全保护.在生成QR二维码之前实现了信息加密,并从系统构架、算法原理和实现及安全性能等多个方面进行了测试和分析.分析表明此方法提高了二维码信息的安全性能,达到对密钥高效管理和对信息的多重保护,而在加密后密文信息容量较明文信息有所增加.
