• Journal of the Optical Society of Korea
• /
• v.18 no.2
• /
• pp.129-133
• /
• 2014

In this paper, we propose a simple Double random phase encryption (DRPE)-based orthogonal encoding technique for color image encryption. In the proposed orthogonal encoding technique, a color image is decomposed into red, green, and blue components before encryption, and the three components are independently encrypted with DRPE using the same key in order to decrease the complexity of encryption and decryption. Then, the encrypted data are encoded with a Hadamard matrix that has the orthogonal property. The purpose of the proposed orthogonal encoding technique is to improve the security of DRPE using the same key at the cost of a little complexity. The proposed orthogonal encoder consists of simple linear operations, so that it is easy to implement. We also provide the simulation results in order to show the effects of the proposed orthogonal encoding technique.

• Journal of the Optical Society of Korea
• /
• v.18 no.3
• /
• pp.201-206
• /
• 2014

In this paper we extend double random phase encryption (DRPE) using orthogonal encoding from single-image transmission to multiple-image transmission. The orthogonal encoding for multiple images employs a larger Hadamard matrix than that for a single image, which can improve security. We provide a scheme for DRPE with an orthogonal codec, and a method for orthogonal encoding/decoding for multiple-image transmission. Finally, simulation results verify that the DRPE using orthogonal encoding for multiple images is more secure than both the conventional DRPE and the DRPE using orthogonal encoding for a single image.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.2
• /
• pp.117-123
• /
• 2017

N-continuous orthogonal frequency division multiplexing (OFDM) is a precoding method for sidelobe suppression of OFDM signals and seamlessly connects OFDM symbols up to the high-order derivative for sidelobe suppression, which is suitable for suppressing out-of-band radiation. However, it severely degrades the error rate as it increases the continuous derivative order. Two schemes for orthogonal precoding of N-continuous OFDM have been proposed to achieve an ideal error rate while maintaining sidelobe suppression performance; however, the large size of the precoder matrices in both schemes causes very high computational complexity for precoding and decoding. This paper proposes matrix decomposition of precoder matrices with a large size in the orthogonal precoding schemes in order to reduce computational complexity. Numerical experiments show that the proposed method can drastically reduce computational complexity without any performance degradation.

• The Pure and Applied Mathematics
• /
• v.9 no.1
• /
• pp.63-72
• /
• 2002

An inverse interpolation problem for rational matrix functions with a certain type of symmetricity in zero-pole structure is studied.

• Journal of the Korean Mathematical Society
• /
• v.46 no.2
• /
• pp.281-294
• /
• 2009

Accuracy of the scaling function is very crucial in wavelet theory, or correspondingly, in the study of wavelet filter banks. We are mainly interested in vector-valued filter banks having matrix factorization and indicate how to choose block central symmetric matrices to construct multi-wavelets with suitable accuracy.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.261-265
• /
• 2008

This work presents a simplified efficient blind detection algorithm for orthogonal space-time codes(OSTBC). First, the proposed decoder exploits a proper decomposition approach of the upper triangular matrix R, which resulted from Cholesky-factorization of the composition channel matrix, to form an easy-to-solve blind detection equation. Secondly, in order to avoid suffering from the high computational load, the proposed decoder applies a sub-optimal QR-based decoder. Computer simulation results verify that the proposed decoder allows to significantly reduce computational complexity while still satisfying the bit-error-rate(BER) performance.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.12
• /
• pp.2073-2080
• /
• 1997

Recently, the plane strain puch stretching test(called PSST) has been developed and used successfully in the evaluation of the press formability of automotive steel sheets. In this paper, the optimum punch geometry of the original PSST tool was investigated by the FEM analysis. The puch length, crown and corner radius are chosen to be optimized according to the Taguchi's experiment technique with the $L_4$ orthogonal array.

• Coupled systems mechanics
• /
• v.6 no.4
• /
• pp.487-499
• /
• 2017

This paper investigates the approximate solution bounds of radon diffusion equation in soil pore matrix coupled with uncertainty. These problems have been modeled by few researchers by considering the parameters as crisp, which may not give the correct essence of the uncertainty. Here, the interval uncertainties are handled by parametric form and solution of the relevant uncertain diffusion equation is found by using Galerkin's Method. The shape functions are taken as the linear combination of orthogonal polynomials which are generated based on the parametric form of the interval uncertainty. Uncertain bounds are computed and results are compared in special cases viz. with the crisp solution.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.9
• /
• pp.1188-1197
• /
• 1995

This paper describes an algorithm that reduces computational requirement of the Kalman filter and estimates the signal efficiently. The reference signals are mapped onto the orthogonal wavelet transform domain so that the eigenvalue spread of its autocorrelation matrix could be smaller than that in the time domain. In the wavelet transform domain the autocorrelation matrix is nearly diagonal. Therefore, the transformed signal can be decomposed each orthogonal elements. The Kalman filter can be applied to each orthogonal elements and computational requirement is reduced. The possibility of applying the parallel Kalman filter was verified through the theory and simulation. The eigenvalue spread in the wavelet transform domain is smaller 8.35 times than that in the time domain and the computational requirement is reduced from 1.4 times to 2. 93 times than that of the conventional Kalman filter.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.868-874
• /
• 2018

In this paper, we propose a new jammer suppression algorithm that uses orthogonal waveform space projection (OWSP) processing for a multiple input multiple output (MIMO) radar system exposed to a jamming signal. Generally, a conventional suppression algorithm based on adaptive beamforming (ABF) needs a covariance matrix composed of the jammer and noise only. By exploiting the orthogonality of the transmitting waveforms of MIMO, we can construct a transmitting waveform space (TWS). Then, using the OWSP processing, we can build a space orthogonal to the TWS that contains no SOI. By excluding the SOI from the received signal, even in the case that contains the SOI and jamming signal, the proposed algorithm makes it possible to evaluate the covariance matrix for ABF. We applied the proposed OWSP processing to suppressing the jamming signal in bistatic MIMO radar. We verified the performance of the proposed algorithm by comparing the SINR loss to that of the ideal covariance matrix composed of the jammer and noise only. We also derived the computational complexity of the proposed algorithm and compared the estimation of the DOD and DOA using the SOI with those using the generalized likelihood ratio test (GLRT) algorithm.