In this paper,the kinoform of a specific snowflake pattern is designed,the original size of the input image is set to be10 mm ×10mm,according to the sampling theorem of designing diffraction optical element,the n...
详细信息
In this paper,the kinoform of a specific snowflake pattern is designed,the original size of the input image is set to be10 mm ×10mm,according to the sampling theorem of designing diffraction optical element,the numerical calculation is needed,and that the sample interval and the number of sampling points of the input plane and output plane could be determined as1508×1508for the number of sampling points and 6.63 um for the sample *** iterative Fourier transform algorithm is used to calculate the kinoform of the snowflake pattern,the reconstructed image is simulated by computer,the size of the kinoform and the phase structure are *** is shown that the kinoform could be obtained by controlling the size of height and width of the microstructural of the surface of recording substrate with a certain refractive *** that the design method is *** reconstruction result shows that the design method of the kinoform of a specific snowflake pattern is *** method can also be used in design of the kinoform of other specific *** of its relief surface,it is convenient for manufacture by the single point diamond turning technique and replica ***,the kinoform is illuminated by a plane wave,the high diffraction efficiency could be gotten because only zero order diffraction image could be reconstructed without higher-order diffraction images.
In this paper,we propose the novel iterative detection which operates iteratively on blocks of the received signal in downlink in massive MIMO(Massive Multiple-input Multiple-output) *** article will combine the equiv...
详细信息
In this paper,we propose the novel iterative detection which operates iteratively on blocks of the received signal in downlink in massive MIMO(Massive Multiple-input Multiple-output) *** article will combine the equivalent channel with soft detection and soft decoder,and finally propose a new structure for the iterative detection in downlink based on 5 G simulation test platform of NCRL and analysis the performance of the novel *** simulation result shows iterative algorithm performs better than conventional detection with lower amount of iterations.
In this paper, an iterative method is proposed to solve the second-order Sylvester matrix equation EXF 2 +AXF+CX+BY=D with unknown matrix pair [X, Y], based on a matrix form of LSQR algorithm. By this iterative method...
详细信息
In this paper, an iterative method is proposed to solve the second-order Sylvester matrix equation EXF 2 +AXF+CX+BY=D with unknown matrix pair [X, Y], based on a matrix form of LSQR algorithm. By this iterative method, we can obtain the minimum Frobenius norm solution pair or the minimum Frobenius norm least squares solution pair over some constrained matrices, such as symmetric, generalized bisymmetric and (R, S)-symmetric matrices.
To address the unconstrained optimization problem, the Conjugate Gradient Method (CG) uses the sequence of iterations to approach the minimum point of aim function. Because of the effect of rounding errors, many merit...
详细信息
To address the unconstrained optimization problem, the Conjugate Gradient Method (CG) uses the sequence of iterations to approach the minimum point of aim function. Because of the effect of rounding errors, many merits of CG are no longer in existence in practical use. Hence the rate of convergence is not ideal and a practical problem confronting us is how to improve conjugate gradient iteration so as to accelerate the convergence. Common improvements include better descent directions and restart strategies on the precondition of conjugate gradients. From the angle of the search step length, another major factor that influences the rate of convergence, the author proposes the use of the neural network model to introduce ‘priori knowledge’ in CG so that it may predict the next search step length. Large quantities of experimental data prove that this method can effectively improve the rate of convergence.
This paper tries to provide a stability analysis approach for the single input rule modules (SIRMs) based type-2 fuzzy logic control systems. First, in the neighbor of the equilibrium point, the closed-form input-outp...
详细信息
This paper tries to provide a stability analysis approach for the single input rule modules (SIRMs) based type-2 fuzzy logic control systems. First, in the neighbor of the equilibrium point, the closed-form input-output mappings of type-2 SIRMs (T2SIRMs) are explored, and the derivatives of T2SIRMs at the equilibrium point are computed. Then, how to compute the Jacobian matrix of the SIRMs based type-2 fuzzy logic control systems, which is a fundamental step for local stability analysis, is presented. At last, two examples on stabilization control of the TORA system and the inverted pendulum system are given. The results in both examples demonstrate that the stability analysis results agree completely with the control results.
This paper examines the problem of static output feedback control of a Takagi-Sugeno (TS) fuzzy system. The existence of a static output feedback control law is given in terms of the solvability of bilinear matrix ine...
详细信息
ISBN:
(纸本)0780393953
This paper examines the problem of static output feedback control of a Takagi-Sugeno (TS) fuzzy system. The existence of a static output feedback control law is given in terms of the solvability of bilinear matrix inequalities. An iterative algorithm based on the linear matrix inequality is proposed to compute the static output feedback gain. To reduce the conservatism of the design, the structural information of the rule base is incorporated. A numerical example is used to illustrate the validity of the methods.
In data mining, SVD is a popular method that has been used for compressing high dimensional data. Binary matrix factorization (BMF) is a variant of SVD. There are two methods for binary factorization compression: the ...
详细信息
In data mining, SVD is a popular method that has been used for compressing high dimensional data. Binary matrix factorization (BMF) is a variant of SVD. There are two methods for binary factorization compression: the iterative heuristic and greedy algorithms. However, both of them are not perfect in applications. The iterative heuristic does not guarantee the convergence in most cases and greedy algorithms can't fit the need of large-scale matrices factorization. In this paper a new method is used for BMF: consensus algorithms. Consensus algorithms are a brand-new approach to enumerating all the maximal bicliques for a given graph, which is proved to be an NP-complete problem and can give the solution in incremental polynomial time. For some bipartite graphs, the time complexity is polynomial. Experiments show that when the iterative heuristic does not work, consensus algorithm improves far more badly the efficiency than greedy algorithms, and ensures the stability.
In this paper,an iterative language model adaptation algorithm for large vocabulary continuous speech recognition is proposed.A closed loop feedback system is established for language model *** the help of confidence ...
详细信息
In this paper,an iterative language model adaptation algorithm for large vocabulary continuous speech recognition is proposed.A closed loop feedback system is established for language model *** the help of confidence measure,the testing material is transferred back for language model *** acoustic score is used as confidence measure to generate the feedback speech *** proposed algorithm is designed to improve the performance of automatic speech recognition(ASR)systems in terrible situations such as insufficient training material and out of vocabulary *** tests are performed on the TIMIT database which is chosen as a simulation of the above mentioned *** results with different iteration numbers are *** results show that significant improvement has been reached by the proposed algorithm. The word error rate(WER)reduction reaches 11.1%.For the sentence level recognition result,a relative improvement of 12.78%is achieved.
We propose a gradient based iterative algorithm with multiple iterative factors(MGI) to find the solutions of the Sylvester discrete-time periodic matrix equations Aj Xj + Xj+1 Bj = Cj(j = 1, 2, ···, T)...
详细信息
We propose a gradient based iterative algorithm with multiple iterative factors(MGI) to find the solutions of the Sylvester discrete-time periodic matrix equations Aj Xj + Xj+1 Bj = Cj(j = 1, 2, ···, T). It is proved that the exact solution of the periodic matrix equations can be converged by the MGI method for any initial matrices. Then, we study the optimal convergence rate of gradient based iterative algorithm with single iterative factor(SGI). Nextly, we compare the convergence rate of the two algorithms, and find that MGI is faster than SGI when the appropriate convergence factors μj are selected. Finally, a numerical example is given to verify that MGI is superior to SGI in both speed and iterative steps.
In this paper, we introduce and study the Rectangle Escape Problem (REP), which is motivated by PCB bus escape routing. Given a rectangular region R and a set S of rectangles within R, the REP is to choose a direction...
详细信息
ISBN:
(纸本)9781424475162
In this paper, we introduce and study the Rectangle Escape Problem (REP), which is motivated by PCB bus escape routing. Given a rectangular region R and a set S of rectangles within R, the REP is to choose a direction for each rectangle to escape to the boundary of R, such that the resultant maximum density over R is minimized. We prove that the REP is NP-Complete, and show that it can be formulated as an Integer Linear Program (ILP). A provably good approximation algorithm for the REP is developed by applying Linear Programming (LP) relaxation and a special rounding technique to the ILP. This approximation algorithm is also shown to work for a more general version of REP with weights (weighted REP). In addition, an iterative refinement procedure is proposed as a postprocessing step to further improve the results. Our approach is tested on a set of industrial PCB bus escape routing problems. Experimental results show that the optimal solution can be obtained within 3 seconds for each of the test cases.
暂无评论