• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11A
• /
• pp.1244-1252
• /
• 2004

In this paper, we derive some properties of linear detectors (zero forcing or minimum mean square error) at spatial multiplexing systems with alamouti's space-time block code. Based on the derived properies, this paper proposes low-complexity receivers. Implementing MMSE detector adaptively, the number of weight vectors to be calculated and updated is greatly reduced with the derived properties compared to the conventional methods. In the case of recursive least square algorithm, with the proposed approach computational complexity is reduced to less than the half. We also identify that sorted QR decomposition detector, which reduces the complexity of V-Blast detector, has the same properties for unitary matrix Q and upper triangular matrix R. A complexity reduction of about 50%, for sorted QR decomposition detector, can be achieved by using those properties without the loss of performance.

• Journal of Digital Convergence
• /
• v.13 no.5
• /
• pp.205-211
• /
• 2015

Recently, a mobile communication network and the wireless terminal is suddenly develop, mobile office service is more and more the sportlight. However, the user may receive an attack from a malicious third party if the up/download the data in the remote to perform the work in a mobile office environment. In this paper, we propose scheme to manage the information lost due to theft smartphone that contain spill prevention personal information and company information from the mobile office environment (call history, incoming messages, phonebook, calendar, location information, banking information, documents, etc.). The proposed scheme using the number of triangular fuzzy information about the state of the personal information and business intelligence to implement a pair-wise comparison matrix. In particular, the proposed scheme is to prevent the value obtained by constructing a pair-wise comparison matrix for personal information and business intelligence and pair your smartphone is lost when a third party not allow access to personal information and corporate information is leaked to the outside.

• Journal of Digital Convergence
• /
• v.13 no.4
• /
• pp.227-233
• /
• 2015

The recent health care is growing rapidly want to receive offers users a variety of medical services, can be exploited easily exposed to a third party information on the role of the patient's hospital staff (doctors, nurses, pharmacists, etc.) depending on the patient clearly may have to be classified. In this paper, in order to ensure safe use by third parties in the health care environment, classify the attributes of patient information and patient privacy protection technique using hierarchical multi-property rights proposed to classify information according to the role of patient hospital officials The. Hospital patients and to prevent the proposed method is represented by a mathematical model, the information (the data consumer, time, sensor, an object, duty, and the delegation circumstances, and so on) the privacy attribute of a patient from being exploited illegally patient information from a third party the prevention of the leakage of the privacy information of the patient in synchronization with the attribute information between the parties.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.2
• /
• pp.32-38
• /
• 2012

In this paper, we design on nonliner 3 user Dirty Paper Precoding for MIMO adjacant interference signal cancellation based on 3 GPP LTE Release 10. In this paper, in order to reduce the inter-channel interference at the transmitted side, we propose the Dirty Paper Precoding scheme for 3-user MIMO wireless systems using LQ decomposition and Gram-Schmidt algorithm based in its orthonormal basis.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.6
• /
• pp.559-567
• /
• 2012

A level set based topological shape optimization method for nonlinear structure considering hyper-elastic problems is developed. To relieve significant convergence difficulty in topology optimization of nonlinear structure due to inaccurate tangent stiffness which comes from material penalization of whole domain, explicit boundary for exact tangent stiffness is used by taking advantage of level set function for arbitrary boundary shape. For given arbitrary boundary which is represented by level set function, a Delaunay triangulation scheme is used for current structure discretization instead of using implicit fixed grid. The required velocity field in the actual domain to update the level set equation is determined from the descent direction of Lagrangian derived from optimality conditions. The velocity field outside the actual domain is determined through a velocity extension scheme based on the method suggested by Adalsteinsson and Sethian(1999). The topological derivatives are incorporated into the level set based framework to enable to create holes whenever and wherever necessary during the optimization.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.185-191
• /
• 2022

This paper proposed a division algorithm of performance complexity $O{\frac{n(n+1)}{2}}$ for a change-making problem(CMP) in which polynomial time algorithms are not known as NP-hard problem. CMP seeks to minimize the sum of the x_j number of coins exchanged when a given amount of money C is exchanged for c_j,j=1,2,⋯,n coins. Known polynomial algorithms for CMPs are greedy algorithms(GA), divide-and-conquer (DC), and dynamic programming(DP). The optimal solution can be obtained by DP of O(nC), and in general, when given C>2ⁿ, the performance complexity tends to increase exponentially, so it cannot be called a polynomial algorithm. This paper proposes a simple algorithm that calculates quotient by dividing upper triangular matrices and main diagonal for k×n matrices in which only j columns are placed in descending order of c_j of n for c_j ≤ C and i rows are placed k excluding all the dividers in c_j. The application of the proposed algorithm to 39 benchmarking experimental data of various types showed that the optimal solution could be obtained quickly and accurately with only a calculator.

• Journal of Digital Convergence
• /
• v.13 no.10
• /
• pp.509-516
• /
• 2015

Intangibility, measurement difficulty and irreversibility, which are the characteristics of service, have such problems as obscurity and uncertainty in quality evaluation. Technical entrepreneurship education, a sort of public service, also contains such characteristics of service. To objectively evaluate the service quality of technical entrepreneurship education, this paper drew up factors as hierarchical structure, centered on FAHP technique, and conducted pre-processing, inputted those factors into triangular fuzzy number fuzzy judgement matrix, and calculated their weights. In this manner, this paper proposed a TESE system, through which an analysis can be conducted by drawing relative importance and priorities of the factors. The proposed system can efficiently evaluate the qualitative technical start-up education service quality factors quantitatively in the diversely changing technical start-up environment in view of the highest result quality (41%), which means performance in the relative importance of major factors. Namely, this paper confirmed that clear decision making can be made through an experiment.

• School Mathematics
• /
• v.8 no.1
• /
• pp.27-43
• /
• 2006

The objective of this paper is to design teaching units to foster secondary pre-service teachers' mathematising abilities. In these teaching units we focus on generalizing area of a 2-dimensional triangle and volume of a 3-dimensional tetrahedron to n-volume of n-simplex In this process of generalizing, principle of the permanence of equivalent forms and Cavalieri's principle are applied. To find n-volume of n-simplex, we define n-orthogonal triangular prism, and inquire into n-volume of it. And we find n-volume of n-simplex by using vectors and determinants. Through these teaching units, secondary pre-service teachers can understand and inquire into n-simplex which is generalized from a triangle and a tetrahedron, and n-volume of n-simplex which is generalized from area of a triangle and volume of a tetrahedron. They can also promote natural connection between school mathematics and academic mathematics.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.5
• /
• pp.1-6
• /
• 2016

Image rotation is one of main pre-processing step in image processing or image pattern recognition. It is implemented with rotation matrix multiplication. However it requires lots of floating point arithmetic operations and trigonometric function calculations, so it takes long execution time. We propose a new high speed image rotation algorithm without two major time-consuming operations. It use just 2 shear translation operations, so it is very fast. In addition, we apply a parallel computing technique with CUDA. CUDA is a massively parallel computing architecture using prevailed GPU recently. As GPU is a dedicated graphic processor, it is exellent for parallel processing of pixels. We compare the proposed algorithm with the conventional rotation one with various size images. Experimental results show that the proposed algorithm is superior to the conventional rotation ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1C
• /
• pp.45-54
• /
• 2010

This paper studies the design of a multiuser multiple-input multiple-output (MIMO) system, where a base station (BS) transmits independent messages to multiple users. The remarkable "dirty paper coding (DPC)" result was first presented by Costa that the capacity does not change if the Gaussian interference is known at the transmitter noncausally. While several implementable DPC schemes have been proposed recently for single-user dirty-paper channels, DPC is still difficult to implement directly in practical multiuser MIMO channels. In this paper, we propose a network channel matrix triangulation (NMT) algorithm for utilizing interference known at the transmitter. The NMT algorithm decomposes a multiuser MIMO channel into a set of parallel, single-input single-output dirty-paper subchannels and then successively employs the DPC to each subchannel. This approach allows us to extend practical single-user DPC techniques to multiuser MIMO downlink cases. We present the sum rate analysis for the proposed scheme. Simulation results show that the proposed schemes approach the sum rate capacity of the multiuser MIMO downlink at moderate signal-to-noise ratio (SNR) values.