• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7C
• /
• pp.562-568
• /
• 2008

This paper proposes the scheme which obtain the coefficients of TDL filter and two normalization algorithms among methods which get solution of equivalent Wiener-Hopf Equation in Gram-Schmidt algorithm. Compared to the conventional NLMS algorithm, normalizes with sum of power of inputs, the presented algorithms normalize using sums of eigenvalues. Using computer simulation, we perform an system identification in an unstable environment where two poles are located in near position outside unit circle. Consequently, the proposed algorithms get the coefficients of TDL filter in Gram-Schmidt algorithm recursively and show better convergence performance than conventional NLMS algorithm.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.703-710
• /
• 2001

In this paper, we consider a multiple watermarking for image copyright protection. Multiple watermarking can be defined that two or more watermarks are inserted into the same content. Multiple watermarking using spread spectrum technique is able to extract the correct watermarks from the watermarked content when the orthogonality among keys should be guaranteed only. To keep the orthogonal property between keys, we perform the process of Gram-Schmidt on the random sequences. The orthogonalized sequences are used as keys to embed the watermarks. The proposed method can not only extract correctly the embedded watermarks but also show the robustness against various attacks such as Gaussian noise addition, histogram equalization, gamma correlation, sharpening and brightness/contrast adjustment.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.2
• /
• pp.96-101
• /
• 2003

Recently, Fractal Image Coding has been studied as a way of efficient data compressing scheme. In the beginning, Fractal Image Coding has been studied for the data compressing in black ＆ white images and linear images. A. E. Jacquin suggested LIFS which expends to Fractal Image Coding for a gray scale image. Currently, YTKT's LIFS scheme which is using Gram-Schmidt is so efficient that enough to compete with the JPEG which is the national standards. This paper investigates the way of greatly reduced calculation for the orthogonalization algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.5
• /
• pp.28-34
• /
• 2001

In stereo acoustic echo canceller scheme, coefficients of adaptive filter converge very slowly or misconverge to real acoustic echo path in receiving room. This is due to cross-correlation in stereo signals. In this paper, a new preprocess algorithm is proposed to improve the performance of stereo AEC(acoustic echo canceller) without computational burden. The proposed algorithm reduces cross-correlation using Gram-Schmidt orthogonality principles and nonlinear filtering. Computer simulations demonstrate that this algorithm performs well compared to conventional ones. When the acoustic path of transmitting room is changed, stereo AEC using proposed algorithm is well performed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.157-160
• /
• 2000

다중 워터마킹은 하나의 컨텐츠에 2개 이상의 다른 워터마크를 삽입하는 것으로 각 워터마크는 유일한 키로 정확하게 추출할 수 있어야 한다. 대역확산법(spread spectrum)을 이용한 다중 워터마킹은 삽입되는 워터마크간의 직교성(orthogonality)이 제공되어야 삽입된 워터마크들의 정확한 추출이 가능하다. 랜덤계열과 Hadamard 계열을 이용한 기존의 방법은 직교성이 보장되지 않기 때문에 워터마크가 정확히 추출되지 않은 문제가 발생한다. 따라서, 본 논문에서는 랜덤계열들을 Gram-schmidt 직교화 과정을 이용하여 직교화시킨 후, 직교화 된 랜덤계열로 워터마크를 삽입하여 정확한 추출이 가능한 방법을 제안하였다.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.216-221
• /
• 2010

In this paper, we propose and develop a new algorithm for the principle subspace tracking by orthonormalizing the eigenvectors using an approximation of Gram-Schmidt procedure. We carry out a novel mathematical derivation to show that when this approximated version of Gram-Schmidt procedure is added to a modified form of projection approximation subspace tracking deflation (PASTd) algorithm, the eigenvectors can be orthonormalized within a linear computational complexity. While the PASTd algorithm tries to extracts orthonormalized eigenvectors, the new scheme orthonormalizes the eigenvectors after their extraction, yielding much more tacking efficiency. We apply the new tracking scheme for blind adaptive multiuser detection for non-stationary cellular CDMA environment and use extensive simulation results to demonstrate the performance improvement of the proposed scheme.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.4
• /
• pp.88-93
• /
• 1999

Several Iterative methods are considered, Gram-Schmidt algerian for thin orthogonalization and Lanczos methodfor a few extreme eigenvalues. For these methods, a variants of method is derived for which only one synchronization point per on iteration is required; that is one global communication in a message passing distributed-memory machine per one iteration is required The variant is called restructured method, and restructured method has better parallel properties to the conventional method.

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

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.6
• /
• pp.17-25
• /
• 2001

Traditional adaptive noise cancelling methods rely their performance on various interfering parameters, such as convergence speed, tracking ability, numerical stability, relative frequency characteristics between target and reverberation signals, and activity of the target. In this paper, an adaptive noise cancelling method is suggested, which Provides a successful tradeoff mon these factors. It is designed to work on the transform domain, adopts the Gram-Schmidt orthogonalization process, and is implemented by the escalator algorithm. The transform domain approach supports a tradeoff between the convergence speed and numerical cost. The proposed method is verified by applying a real-data collected in the shallow waters off the east coasts of korea. It is shown that it has a good reverberation-rejection capability even for the target signal with adjacent frequency components to those of the reverberation, and its performance is invariant for the activity of the target.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1785-1794
• /
• 1999

The affine projection algorithm has known t require less computational complexity than RLS but have much faster convergence than NLMS for speech-like input signals. But the affine projection algorithm is still much more computationally demanding than the LMS algorithm because it requires the matrix inversion. In this paper, we show that the affine projection algorithm can be realized with the Gram-Schmidt orthogonalizaion of input vectors. Using the derived relation, we propose an approximate but much more efficient implementation of the affine projection algorithm. Simulation results show that the proposed algorithm has the convergence speed that is comparable to the affine projection algorithm with only a slight extra calculation complexity beyond that of NLMS.