• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.317-325
• /
• 2012

In this paper, we consider the encoding scheme of Low Density Parity Check codes. In particular, using the Jacket Pattern and circulant permutation matrices, we propose the simple encoding scheme of Richardson's lower triangular matrix. These encoding scheme can be extended to a flexible code rate. Based on the simple matrix process, also we can design low complex and simple encoders for the flexible code rates.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.739-748
• /
• 1992

A CGM iterative systolic algorithm to solve large sparse linear systems of equations is presented. For implementation of the algorithm, a systolic array using the stripe structure is proposed. The matrix A is decomposed into a strictly lower triangular matrix, a diagonal matrix, and a strictly up-per triangular matrix, and the two formers and the tatter· are concurrently computed by different linear arrays. Hence, the execution time of this approach Is reduced to half of the execution time of the that a linear array is used. computation of the Irregularly distributed sparse matrix can be executed effectively by using the stripe structure.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.1
• /
• pp.117-124
• /
• 2012

In this paper, we propose a simple H parity check matrix from the CPM(circulant permutation matrix), which can easily avoid the cycle-4, and approach to flexible code rates and lengths. As a result, the operations of the submatrices will become the multiplications between several CPMs, the calculations of the LDPC(low density parity check) encoding could be simplest. Also we consider the fast encoding problem for LDPC codes. The proposed constructions could lead to fast encoding based on the simplest matrices operations for both regular and irregular LDPC codes.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.1
• /
• pp.9-14
• /
• 2008

This paper presents an observer design methodology for a special class of multi input multi output(MIMO) nonlinear systems. First, we characterize the class of MIMO nonlinear systems with a triangular structure. Also, the observability matrices that plays an important role in proving the convergence of the proposed observer are generalized to MIMO systems. By using the generalized observability matrices, it is shown that under the boundedness conditions of system state and input, the proposed observer guarantees the local exponential convergence to zero of the estimation error.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.8
• /
• pp.1785-1791
• /
• 2003

This paper presents the mosaic method that the video sequence with shift and rotation information after Mellin Transform. The results are used to compute the projection matrix for each image registration. So before registration, we process camera calibration in order to reduce the image warp by camera and then compute the global projection matrix for image registration for reducing errors from rut image to last image. This paper describes the mosaic method that compute duplication and movement information quickly and robust noise using projection matrix on Mellin Transform.

• 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 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.

• 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.

• 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.