• ETRI Journal
• /
• 제45권2호
• /
• pp.277-290
• /
• 2023

This paper proposes a method that can reduce the complexity of a system matrix by analyzing the characteristics of a pseudoinverse matrix to receive a binomial frequency division multiplexing (BFDM) signal and decode it using the least squares (LS) method. The system matrix of BFDM can be expressed as a band matrix, and as this matrix contains many zeros, its amount of calculation when generating a transmission signal is quite small. The LS solution can be obtained by multiplying the received signal by the pseudoinverse matrix of the system matrix. The singular value decomposition of the system matrix indicates that the pseudoinverse matrix is a band matrix. The signal-to-interference ratio is obtained from their eigenvalues. Meanwhile, entries that do not contribute to signal generation are erased to enhance calculation efficiency. We decode the received signal using the pseudoinverse matrix and the removed pseudoinverse matrix to obtain the bit error rate performance and to analyze the difference.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제16권2호
• /
• pp.125-130
• /
• 2016

The proposal of this study is a fast version of the conventional extreme learning machine (ELM), called pseudoinverse matrix decomposition based incremental ELM (PDI-ELM). One of the main problems in ELM is to determine the number of hidden nodes. In this study, the number of hidden nodes is automatically determined. The proposed model is an incremental version of ELM which adds neurons with the goal of minimization the error of the ELM network. To speed up the model the information of pseudoinverse from previous step is taken into account in the current iteration. To show the ability of the PDI-ELM, it is applied to few benchmark classification datasets in the University of California Irvine (UCI) repository. Compared to ELM learner and two other versions of incremental ELM, the proposed PDI-ELM is faster.

• 대한화학회지
• /
• 제52권3호
• /
• pp.223-238
• /
• 2008

이 논문에 화학반응식 균형을 맞추기 위한 새로운 유사 역행렬법이 기술되었다. 여기에 제공된 방법은 Moore-Penrose 유사 역행렬을 사용한 Diophantin 행렬식의 해에 기초를 둔다. 방법은 전형적인 여러 화학반응식에 시험적용되었고 폭넓은 균형연구에서 모든 반응식에 매우 성공적이었다. 이 방법은 아무 제한없이 성공적으로 적용되고, 또한 새로운 화학반응식의 타당성에 대한 검증력도 있고, 만일 새식이 타당하다면 화학식 균형을 이룰 것이다. 여기서 다루어진 화학반응식들은 소수산화수를 지닌 원자를 포함하고 있다. 또한, 화학반응식의 확장된 행렬의 안정성에 대한 화학반응식의 안정성의 필요충분조건을 이 연구에 소개하였다.

• 대한조선학회논문집
• /
• 제28권2호
• /
• pp.21-27
• /
• 1991

이 논문에서는 periodic 균일 knot vector 뿐만아니라 open 균일 knot vector를 사용하여 선체형상을 Bi-cubic B-spline곡면으로 수식화하는 방법을 보인다. B-spline곡면을 형성하기 위한 B-spline control vertex는 기본 함수의 pseudoinverse matrix를 사용하여 결정된다. 주어진 offset과 형성된 선체곡면을 비교한 결과 잘 일치하였다. 곡면의 순정을 검토하기 위하여 Gaussian곡률을 많은 작은 곡면조각에 대해 계산하여 흑백의 농도 차이를 이용하여 도시화하였다.

• 대한기계학회논문집
• /
• 제17권10호
• /
• pp.2543-2554
• /
• 1993

In this paper, the kinematic and dynamic analyses of spatial complex kinematic chain are studied. Through the new method both using the set of identification numbers and applying the DenavitHartenberg link representation method to the spatial complex kinematic chain, the kinematic configuration of the chain is represented. Some link in the part of closed chain being fictitiously cutted, the complex kinematic chain is transformed to the branched chain. The kinematic constraint equations are derived from the constraint conditions which the cutted sections of the link have to satisfy. And the joint variables being partitioned in the independent joint variables and the dependent joint variables, the dependent variables are calculated from the independent variables by using the Newton-Raphson iterative method and the pseudoinverse matrix. The equations of motion are derived under the independent joint variables by using the principle of virtual work. Algorithms for dynamic analysis are presented and simulations are done to verify accuracy and efficiency of the algorithms.

• 정보와 통신
• /
• 제7권3호
• /
• pp.27-34
• /
• 1990

The $(L,\psi)$ feature description on the binary boundary air craft image is introduced of classifying 3-D object (aircraft) identification. Three types for associative matrix memories are employed and tested for their classification performance. The fast association involved in these memories can be implemented using a parallel optical matrix-vector operation. Two associative memories are based on pseudoinverse solutions and the third one is interoduced as a paralell version of a nearest-neighbor classifier. Detailed simulation results for each associative processor are provided.

• 한국정밀공학회지
• /
• 제10권2호
• /
• pp.170-177
• /
• 1993

In robotic arc welding, the roll (rotation) of the torch about its direction vector does not have any effect on the welding operation. Thus we could use this redundant degree of greedom for the motion control of the robot manipulator. This paper presents an algorithm for the pseudo- inverse kinematic motion control of the 6-axis robot, which utilizes the above mentioned redunancy. The prototype welding operation and the tool path are also graphically simulated. Since the proposed algorithm requires only the position and normal vector of the weldine as an input data, it is useful for the CAD-based off-line programming of the arc welding robot. In addition, it also has the advantages of the redundant manipulator motion control, like singularity avoidance and collision free motion planning, when compared with the other motion control method based on the direct inverse kinematics.

• 대한수학회지
• /
• 제48권1호
• /
• pp.33-48
• /
• 2011

The notion of the generalized Fibonacci matrix $\mathcal{F}_n^{(a,b,s)}$ of type s, whose nonzero elements are generalized Fibonacci numbers, is introduced in the paper [23]. Regular case s = 0 is investigated in [23]. In the present article we consider singular case s = -1. Pseudoinverse of the generalized Fibonacci matrix $\mathcal{F}_n^{(a,b,-1)}$ is derived. Correlations between the matrix $\mathcal{F}_n^{(a,b,-1)}$ and the Pascal matrices are considered. Some combinatorial identities involving generalized Fibonacci numbers are derived. A class of test matrices for computing the Moore-Penrose inverse is presented in the last section.

• 대한전자공학회논문지
• /
• 제25권4호
• /
• pp.379-385
• /
• 1988

A kinematic control for redundant manipulators is consisdered. An efficient computation method is proposed to determine the joint variable solutions for a given Cartesian path of the end effector. In the proposed method, the Jacobian matrix and its pseudoinverse matrix are calculated intermittently only when the errors exceed the prescribed tolerance. Thereby, the computational burdens are greatly reduced, and at the same time, the errors are maintained within a tolerable range. To show the effectiveness of the mehtod, the result of the simulation is provided in which the redundancy of the manipulator is resolved to avoid the singularity.

• 대한조선학회논문집
• /
• 제31권3호
• /
• pp.31-37
• /
• 1994

선체 형상을 표현하기 위하여 Bi-Cubic B-spline이 가장 널리 사용되고 있다. B-spline곡선 곡면 정의에 있어서 입력 데이터가 불규칙하거나, 주어진 데이터의 갯수가 많은 경우, 또는 형상이 복잡한 경우에 주어진 형상의 부드러운 곡선 곡면(Smooth curves or surfaces)을 재현할 수 있는 역행렬을 구하기 어렵다. 이러한 문제점을 극복하기 위해 새로운 버텍스 산출법(ISE 방법: Image Surface Expansion Method)을 제시한다. 곡선정의를 이용하여 ISE방법을 검증하였고, 수렴성을 확인하였다. 또한 선체형상을 정의하였으며, Open Uniform B-spline으로 형성된 곡면과 비교하였고, ISE방법의 신뢰도를 검증하였다.