• ETRI Journal
• /
• v.45 no.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
• /
• v.16 no.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.

• Journal of the Korean Chemical Society
• /
• v.52 no.3
• /
• pp.223-238
• /
• 2008

this work is given a new pseudoniverse matrix method for balancing chemical equations. Here offered method is founded on virtue of the solution of a Diophantine matrix equation by using of a Moore-Penrose pseudoinverse matrix. The method has been tested on several typical chemical equations and found to be very successful for the all equations in our extensive balancing research. This method, which works successfully without any limitations, also has the capability to determine the feasibility of a new chemical reaction, and if it is feasible, then it will balance the equation. Chemical equations treated here possess atoms with fractional oxidation numbers. Also, in the present work are introduced necessary and sufficient criteria for stability of chemical equations over stability of their extended matrices.

• Journal of the Society of Naval Architects of Korea
• /
• v.28 no.2
• /
• pp.21-27
• /
• 1991

This paper outlines the method of formulating the bi-cubic B-spline surface of ship hull, employing the open uniform knot vector as well as the periodic uniform knot vector. An appropriate set of B-spline control vertices to generate the B-spline surface is determined by obtaining the pseudoinverse matrix of basis functions. The comparison between the given offsets and the resulting coordinates from the generated ship hull surface shows a good agreement. To check the fairness of the surface Gaussian curvature is calculated on many small subpatches and displayed on the black-and-white plot of the isoparametric net of the surface.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.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.

• Information and Communications Magazine
• /
• v.7 no.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.

• Journal of the Korean Society for Precision Engineering
• /
• v.10 no.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.

• Journal of the Korean Mathematical Society
• /
• v.48 no.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.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.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.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.3
• /
• pp.31-37
• /
• 1994

When a lot of input data are not distributed uniformly n a chord-span direction or when the given shape is complicated, it is very difficult to obtain an inverse matrix which represents the smooth Bi-cubic B-spline surface of the initial shape. To overcome this problem, we suggest image Surface Expansion Method(ISE Method) which is suggested for vertex creation of B-spline curves and surfaces. Its basic concept, convergency and verification are shown. Also B-spline curves and Surfaces represented by ISE Method were compared with those represented by the existing method which is based on the inverse matrix method, the pseudoinverse matrix method and the chord length approximation method for vertex yielding. Ship Hull Forms which have Knuckle, Bulbous Bow, Transom and Stern frame were represented by the ISE Method.