In this paper a new method to realize rational generalized transfer functions of linearshift-variant digital filters through state feedback is presented In some practical applications therequired characteristics of th...In this paper a new method to realize rational generalized transfer functions of linearshift-variant digital filters through state feedback is presented In some practical applications therequired characteristics of the filter change slowly.Under these circumstances,the proposedmethod is very effective and the resulting filter structure is simple.A numerical example isprovided to show the performance of the method.展开更多
Based on analysis of the structure characteristics and implementation methods of some representative word oriented linear feedback shift registers （LFSRs） in several modem software oriented stream ciphers, this pape...Based on analysis of the structure characteristics and implementation methods of some representative word oriented linear feedback shift registers （LFSRs） in several modem software oriented stream ciphers, this paper firstly classifies the word oriented LFSRs into two classes： the machine instruction type and the arithmetic type. The similarities and differences between each type are illustrated by concrete examples. Then we give a detailed analysis about the word oriented LFSRs in each category from design structure, cryptographic properties and implementation issue aspects. Finally, some basic design criteria for modem word oriented LFSRs and suitable for software implementation are summarized.展开更多
We investigate the restart of the Restarted Shifted GMRES method for solving shifted linear systems. Recently the variant of the GMRES（m） method with the unfixed update has been proposed to improve the convergence o...We investigate the restart of the Restarted Shifted GMRES method for solving shifted linear systems. Recently the variant of the GMRES（m） method with the unfixed update has been proposed to improve the convergence of the GMRES（m） method for solving linear systems, and shown to have an efficient convergence property. In this paper, by applying the unfixed update to the Restarted Shifted GMRES method, we propose a variant of the Restarted Shifted GMRES method. We show a potentiality for efficient convergence within the variant by some numerical results.展开更多
The seed method is used for solving multiple linear systems A (i)x (i) =b (i) for 1≤i≤s, where the coefficient matrix A (i) and the right-hand side b (i) are different in general. It is known that the CG meth...The seed method is used for solving multiple linear systems A (i)x (i) =b (i) for 1≤i≤s, where the coefficient matrix A (i) and the right-hand side b (i) are different in general. It is known that the CG method is an effective method for symmetric coefficient matrices A (i). In this paper, the FOM method is employed to solve multiple linear sy stems when coefficient matrices are non-symmetric matrices. One of the systems is selected as the seed system which generates a Krylov subspace, then the resi duals of other systems are projected onto the generated Krylov subspace to get t he approximate solutions for the unsolved ones. The whole process is repeated u ntil all the systems are solved.展开更多
This paper proposes a method to ascertain the stability of two dimensional linear time invariant discrete system within the shifted unit circle which is represented by the form of characteristic equation. Further an e...This paper proposes a method to ascertain the stability of two dimensional linear time invariant discrete system within the shifted unit circle which is represented by the form of characteristic equation. Further an equivalent single dimensional characteristic equation is formed from the two dimensional characteristic equation then the stability formulation in the left half of Z-plane, where the roots of characteristic equation f(Z) = 0 should lie within the shifted unit circle. The coefficient of the unit shifted characteristic equation is suitably arranged in the form of matrix and the inner determinants are evaluated using proposed Jury’s concept. The proposed stability technique is simple and direct. It reduces the computational cost. An illustrative example shows the applicability of the proposed scheme.展开更多
In the light of some assumptions that are very close to the practical working conditions,a very complicated polishing process of optical element can be simplified as a linear and shift invariant system that is relatd ...In the light of some assumptions that are very close to the practical working conditions,a very complicated polishing process of optical element can be simplified as a linear and shift invariant system that is relatd only to the speed,pres- sure and time of processing.In polishing,the removed material can be represented and entreated by the convolution of the removal function of polishing head and the dwell function.The properties of removal function are presented.The assumptions and methods given by the author have been shown to be correct and applicable by experiments using a ring lap to polish the optical surfac.展开更多
An algorithm based on eigenanalysis technique and Walsh-Hadamard transform （WriT） is proposed. The algorithm contains two steps. Firstly, the received sequence is divided into temporal windows, and a covariance matr...An algorithm based on eigenanalysis technique and Walsh-Hadamard transform （WriT） is proposed. The algorithm contains two steps. Firstly, the received sequence is divided into temporal windows, and a covariance matrix is computed. The linear feedback shift register （LFSR） sequence is reconstructed from the first eigenvector of this matrix. Secondly, equations according to the recovered LFSR sequence are constructed, and the Walsh spectrum corresponding to the equations is computed. The feedback polynomial of LFSR is estimated from the Walsh spectrum. The validity of the algorithm is verified by the simulation result. Finally, case studies are presented to illustrate the performance of the blind reconstruction method.展开更多
The linear complexity of a new kind of keystream sequences.FCSR sequences,is discussed by use of the properties of cyclotomic polynomials.Based on the results of C.Seo's,an upper bound and a lower bound on the li...The linear complexity of a new kind of keystream sequences.FCSR sequences,is discussed by use of the properties of cyclotomic polynomials.Based on the results of C.Seo's,an upper bound and a lower bound on the linear complexity of a significant kind of FCSR sequences—l-sequences are presented.展开更多
This letter proposes algebraic attacks on two kinds of nonlinear filter generators with symmetric Boolean functions as the filter fimctions. Different fxom the classical algebraic attacks, the proposed attacks take th...This letter proposes algebraic attacks on two kinds of nonlinear filter generators with symmetric Boolean functions as the filter fimctions. Different fxom the classical algebraic attacks, the proposed attacks take the advantage of the combinational property of a linear feedback shift register （LFSR） and the symmetric Boolean function to obtain a tow-degree algebraic relation, and hence the complexities of the proposed attacks are independent of the algebraic immunity （AI） of the filter functions. It is shown that improper combining of the LFSR with the filter function can make the filter generator suffer from algebraic attacks. As a result, the bits of the LFSR must be selected properly to input the filter function with large AI in order to withstand the proposed algebraic attacks.展开更多
文摘In this paper a new method to realize rational generalized transfer functions of linearshift-variant digital filters through state feedback is presented In some practical applications therequired characteristics of the filter change slowly.Under these circumstances,the proposedmethod is very effective and the resulting filter structure is simple.A numerical example isprovided to show the performance of the method.
基金Supported by the National Basic Research Program of China (937 Program) (2007CB807902)the National High-Technology Research and Development Program of China (863 Program) (2006AA01Z425)the National Natural Science Foundation of China (60503011, 90704003)
文摘Based on analysis of the structure characteristics and implementation methods of some representative word oriented linear feedback shift registers （LFSRs） in several modem software oriented stream ciphers, this paper firstly classifies the word oriented LFSRs into two classes： the machine instruction type and the arithmetic type. The similarities and differences between each type are illustrated by concrete examples. Then we give a detailed analysis about the word oriented LFSRs in each category from design structure, cryptographic properties and implementation issue aspects. Finally, some basic design criteria for modem word oriented LFSRs and suitable for software implementation are summarized.
基金Supported by the Strategic Programs for Innovative Research(SPIRE)Field5"The origin of matter and the universe"
文摘We investigate the restart of the Restarted Shifted GMRES method for solving shifted linear systems. Recently the variant of the GMRES（m） method with the unfixed update has been proposed to improve the convergence of the GMRES（m） method for solving linear systems, and shown to have an efficient convergence property. In this paper, by applying the unfixed update to the Restarted Shifted GMRES method, we propose a variant of the Restarted Shifted GMRES method. We show a potentiality for efficient convergence within the variant by some numerical results.
基金Project supported by the National Natural Science Foundation of China (Grant No.10271075)
文摘The seed method is used for solving multiple linear systems A (i)x (i) =b (i) for 1≤i≤s, where the coefficient matrix A (i) and the right-hand side b (i) are different in general. It is known that the CG method is an effective method for symmetric coefficient matrices A (i). In this paper, the FOM method is employed to solve multiple linear sy stems when coefficient matrices are non-symmetric matrices. One of the systems is selected as the seed system which generates a Krylov subspace, then the resi duals of other systems are projected onto the generated Krylov subspace to get t he approximate solutions for the unsolved ones. The whole process is repeated u ntil all the systems are solved.
文摘This paper proposes a method to ascertain the stability of two dimensional linear time invariant discrete system within the shifted unit circle which is represented by the form of characteristic equation. Further an equivalent single dimensional characteristic equation is formed from the two dimensional characteristic equation then the stability formulation in the left half of Z-plane, where the roots of characteristic equation f(Z) = 0 should lie within the shifted unit circle. The coefficient of the unit shifted characteristic equation is suitably arranged in the form of matrix and the inner determinants are evaluated using proposed Jury’s concept. The proposed stability technique is simple and direct. It reduces the computational cost. An illustrative example shows the applicability of the proposed scheme.
文摘In the light of some assumptions that are very close to the practical working conditions,a very complicated polishing process of optical element can be simplified as a linear and shift invariant system that is relatd only to the speed,pres- sure and time of processing.In polishing,the removed material can be represented and entreated by the convolution of the removal function of polishing head and the dwell function.The properties of removal function are presented.The assumptions and methods given by the author have been shown to be correct and applicable by experiments using a ring lap to polish the optical surfac.
基金supported by the National Natural Science Foundation of China(61072120)
文摘An algorithm based on eigenanalysis technique and Walsh-Hadamard transform （WriT） is proposed. The algorithm contains two steps. Firstly, the received sequence is divided into temporal windows, and a covariance matrix is computed. The linear feedback shift register （LFSR） sequence is reconstructed from the first eigenvector of this matrix. Secondly, equations according to the recovered LFSR sequence are constructed, and the Walsh spectrum corresponding to the equations is computed. The feedback polynomial of LFSR is estimated from the Walsh spectrum. The validity of the algorithm is verified by the simulation result. Finally, case studies are presented to illustrate the performance of the blind reconstruction method.
基金The work is supported by the Special Fund of National Excellently Doctoral Paper and HAIPURT.
文摘The linear complexity of a new kind of keystream sequences.FCSR sequences,is discussed by use of the properties of cyclotomic polynomials.Based on the results of C.Seo's,an upper bound and a lower bound on the linear complexity of a significant kind of FCSR sequences—l-sequences are presented.
基金Supported by the National Basic Research Program of China （No. 2007CB311201）, the National Natural Science Foundation of China （No.60833008 No.60803149）, and the Foundation of Guangxi Key Laboratory of Information and Communication （No.20902）.
文摘This letter proposes algebraic attacks on two kinds of nonlinear filter generators with symmetric Boolean functions as the filter fimctions. Different fxom the classical algebraic attacks, the proposed attacks take the advantage of the combinational property of a linear feedback shift register （LFSR） and the symmetric Boolean function to obtain a tow-degree algebraic relation, and hence the complexities of the proposed attacks are independent of the algebraic immunity （AI） of the filter functions. It is shown that improper combining of the LFSR with the filter function can make the filter generator suffer from algebraic attacks. As a result, the bits of the LFSR must be selected properly to input the filter function with large AI in order to withstand the proposed algebraic attacks.
