• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.1
• /
• pp.12-18
• /
• 2014

In this paper, a new peak-to-average power ratio (PAPR) reduction method for spatial modulation(SM) is presented. By using the matrix with all non-zero elements to precode the signals before transmitting, the transmit power is scattered over all transmit antennas for achieving the goal of PAPR reduction. If this matrix is also an unitary matrix, the distribution of transmit power over transmit antennas will be uniform and it also could retain the characteristic of avoiding inter channel interference (ICI) due to the orthogonality of unitary matrix. In case of a non-ideal amplifier, the proposed method can produce a considerable improvement that increases with a number of transmit antennas in performance. Furthermore, the new scheme achieves an identical performance with conventional one in the case of ideal amplifier.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1534-1542
• /
• 1997

In this paper, we present a performance improvement method for the direction-of-arrival (DOA) estimation algorithm of the narrowband signals incident on a uniform circular array. It is very important to estimate the covariance matrix effectively because the performance of DOA algorithm mainly depends on the exactness of the sampel coveriance matrix which is computed from the received samples of signals. In case of uniform circular array with the even number sensors, the structure of the arrray has a useful geometrical property. Therefore we present the method which can estimate covariance matrix more effectively using this property. The simulation results are shown to demonstrate the superior perfodrmance obtained by the proposed covariance matrix estimation method relative to that of the conventional estimation method.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.4
• /
• pp.807-814
• /
• 2012

We know that the exponentially weighted moving average (EWMA) control charts are sensitive to detecting relatively small shifts. Multivariate EWMA control charts are considered for monitoring of variance-covariance matrix when the distribution of process variables is multivariate normal. The performances of the proposed EWMA control charts are evaluated in term of average run length (ARL). The performance is investigated in three types of shifts in the variance-covariance matrix, that is, the variances, covariances, and variances and covariances are changed respectively. Numerical results show that all multivariate EWMA control charts considered in this paper are effective in detecting several kinds of shifts in the variance-covariance matrix.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.4
• /
• pp.937-945
• /
• 2017

The purpose of using a control chart is to detect any change that occurs in the process. When control charts are used to monitor processes, we want to identify this changes as quickly as possible. Many problems in quality control involve a vector of observations of several characteristics rather than a single characteristic. Multivariate CUSUM or EWMA charts have been developed to address the problem of monitoring covariance matrix or the joint monitoring of mean vector and covariance matrix. However, control charts tend to work poorly when we use the highly correlatted variables. In order to overcome it, Hawkins (1991) proposed the use of regression adjustment variables. In this paper, to monitor covariance matrix, we investigate the performance of MEWMA-type control charts with and without the use of regression adjusted variables.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.3
• /
• pp.407-413
• /
• 2008

In this paper, scattering matrix for the open ended rectangular waveguide with infinite flange is derived. To validate the scattering matrix approach, load admittance $Y_{L,10}$ obtained from the present scattering matrix method is compared with the results of the previous work. The convergence for scattering matrix solution versus TE and TM mode numbers is investigated. Also far field power pattern radiated from the aperture of the waveguide is given.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.902-903
• /
• 2009

Matrix multiplication is widely used in scientific and engineering field. Locality can improve the execution performance of matrix multiplication. A method for accelerating matrix multiplication is presented. This method uses both CPU and GPU computing power in PC. The presented method improved execution time about %15~30% than the method which uses only GPU.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.4
• /
• pp.646-651
• /
• 2012

Meaningful logos or random sequences have been used in the current digital watermarking techniques of 2D bar code. The meaningful logos can not only be created by copyright holders based on their unique information, but are also very effective when representing their copyrights. The random sequences enhance the security of the watermark for verifying one's copyrights against intentional or unintentional attacks. In this paper, we propose a new watermarking technique taking advantage of Data Matrix as well as encryption keys. The Data Matrix not only recovers the original data by an error checking and correction algorithm, even when its high-density data storage and barcode are damaged, but also encrypts the copyright verification information by randomization of the barcode, including ownership keys. Furthermore, the encryption keys and the patterns are used to localize the watermark, and make the watermark robust against attacks, respectively. Through the comparison experiments of the copyright information extracted from the watermark, we can verify that the proposed method has good quality and is robust to various attacks, such as JPEG compression, filtering and resizing.

• Journal of Korea Multimedia Society
• /
• v.17 no.12
• /
• pp.1446-1452
• /
• 2014

Existing LDA uses the transform matrix that maximizes distance between classes. So we have to convert from an image to one-dimensional vector as training vector. However, in 2D-LDA, we can directly use two-dimensional image itself as training matrix, so that the classification performance can be enhanced about 20% comparing LDA, since the training matrix preserves the spatial information of two-dimensional image. However 2D-LDA uses same calculation schema for transformation matrix and therefore both LDA and 2D-LDA has the heteroscedastic problem which means that the class classification cannot obtain beneficial information of spatial distances of class clusters since LDA uses only data correlation-based covariance matrix of the training data without any reference to distances between classes. In this paper, we propose a new method to apply training matrix of 2D-LDA by using WPS-LDA idea that calculates the reciprocal of distance between classes and apply this weight to between class scatter matrix. The experimental result shows that the discriminating power of proposed 2D-LDA with weighted between class scatter has been improved up to 2% than original 2D-LDA. This method has good performance, especially when the distance between two classes is very close and the dimension of projection axis is low.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.400-402
• /
• 2006

Matrix multiplication is an important problem in linear algebra. its main significance for combinatorial algorithms is its equivalence to a variety of other problems, such as transitive closure and reduction, solving linear systems, and matrix inversion. Thus the development of high-performance matrix multiplication implies faster algorithms for all of these problems. In this paper. we present a quantitative comparison of the theoretical and empirical performance of key matrix multiplication algorithms and use our analysis to develop a faster algorithm. We propose a Hybrid approach on Winograd's and Strassen's algorithms that improves the performance and discuss the performance of the hybrid Winograd-Strassen algorithm. Since Strassen's algorithm is based on a $2{\times}2$ matrix multiplication it makes the implementation very slow for larger matrix because of its recursive nature. Though we cannot get the theoretical threshold value of Strassen's algorithm, so we determine the threshold to optimize the use of Strassen's algorithm in nodes through various experiments and provided a summary shown in a table and graphs.

• Journal of Forest and Environmental Science
• /
• v.33 no.4
• /
• pp.295-304
• /
• 2017

This study compared and analyzed the construction of a land use change matrix for the Intergovernmental Panel on Climate Change's (IPCC) land use, land use change, and forestry area (LULUCF). We used National Forest Inventory (NFI) permanent sample plots (with a sample intensity of 4 km) and permanent sample plots with 500 m sampling intensity. The land use change matrix was formed using the point sampling method, Level-2 Land Cover Maps, and forest aerial photographs (3rd and 4th series). The land use change matrix using the land cover map indicated that the annual change in area was the highest for forests and cropland; the cropland area decreased over time. We evaluated the uncertainty of the land use change matrix. Our results indicated that the forest land use, which had the most sampling, had the lowest uncertainty, while the grassland and wetlands had the highest uncertainty and the least sampling. The uncertainty was higher for the 4 km sampling intensity than for the 500 m sampling intensity, which indicates the importance of selecting the appropriate sample size when constructing a national land use change matrix.