• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.12A
• /
• pp.1781-1786
• /
• 2000

본 논문에서는, 적응 간섭 제거기(AIC : adaptive interference canceller)에 사용되는 적응 알고리즘 중 계산량이 적고, 하드웨어적 복잡성이 낮은 최소 평균 자승(LMS)알고리즘의 적응화 상수(constant step size)를 여러 개 사용하여 빠른 수렴 속도와 낮은 평균 자승 에러를 가지는 방법을 제안한다. 최소 평균 자승 알고리즘에서 적응화 상수는 수렴속도와 평균 자승 에러를 제거하는데, 적응화 상수가 증가할수록 수렴속도가 빨라지는 반면, 평균 자승 에러는 증가하게 된다. 이 논문에서는 수렴속도를 증가하는 동시에 평균 자승 에러를 줄이기 위해, 최소 평균 자승 알고리즘에서 세 개의 적응화 상수를 가지는 새로운 검출기를 제안한다. 이 구조에서, 매 반복횟수에 따른 각 그룹 출력 값들을 가지고, 선택(selection)부분에서 평균 자승 에러들을 비교하며, 가장 작은 평균 자승 에러를 나타내는 그룹의 에러 값과 필터 계수 값들이 선택되어져 여러 적응화 상수 최소 평균 자승 알고리즘(several step size LMS algorithm)부분에서 각 그룹의 필터 계수를 갱신하는데 필요한 정보로 이용된다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.5
• /
• pp.549-554
• /
• 2014

In the paper, we propose a new Signed LMS(Least Mean Square) algorithm for ICS(Interference Cancellation System). The proposed Signed LMS algorithm improved performances by adjusting step size values. At the convergence of 1000 iteration state, the MSE(Mean Square Error) performance of the proposed Signed LMS algorithm with step size of 0.067 is about 3 ~ 18 dB better than the conventional LMS, CMA algorithm. And the proposed Signed LMS algorithm requires 500 ~ 4000 less iterations than the and LMS and CMA algorithms at MSE of -25dB.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.805-810
• /
• 2019

Recently, a majority of 4G mobile telecommunication manufacturers prefer repeaters with good adaptability. In this paper, we propose a new LMF(: Least Means Fourth) algorithm for LTE(: Long Term Evolution) RF(: Radio Frequency) Repeater. The proposed algorithm is a modification of the LMF, which appropriately adjusts the step size and improves performance according to the Sign function. The steady state MSE(: Mean Square Error) performance of the proposed LMF algorithm with step size of 0.009 is low level at about -25dB, and the proposed LMF algorithm requires 500 less iterations than the conventional algorithms at MSE of -25dB.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.280-282
• /
• 1999

적응 횡단선 심볼간의 채널에 발생하는 상호 심볼간 간섭을 억압하기 위해 LMS 알고리즘을 사용한다. 이 알고리즘은 원하는 응답과 실제 출력간의 차인 에러를 이용하여 탭 가중치 조절 메카니즘을 통해 탭 가중치를 갱신함으로서 효과적으로 간섭을 제거하였다. 본 논문은 상호 심볼간 간섭을 효율적으로 억압해온 기존의 LMS알고리즘에 다계층 퍼셉트론 신경망을 조합 한 새로운 LMSBP 알고리즘을 제안하였으며, 제안된 알고리즘을 토해 탭 가중치 갱신이 보다 효율적으로 이루어짐을 알 수 있다. 시뮬레이션 결과를 통해 제안된 알고리즘의 평균 자승 에러의 수렴 특성이 LMS 알고리즘을 이용한 수렴특성보다 우월하다는 것을 나타내었다.

• Journal of IKEEE
• /
• v.15 no.4
• /
• pp.293-298
• /
• 2011

In the paper, we propose a new CMF(Constant Modulus Fourth) algorithm for WCDMA(Wideband Code Multiple Access) RF(Radio Frequency) Repeater. CMF algorithm is proposed by modifying the CMA(Constant Modulus Algorithm) algorithm and improved performances are achieved by properly adjusting step size values. The steady state MSE(Mean Square Error) performance of the proposed CMF algorithm with step size of 0.35 is about 4dB better than that of the conventional CMA algorithm. And the proposed CMF algorithm requires 400~1100 less iterations than the LMS(Least Mean Square) and NLMS(Normalized Least Mean Square) algorithms at MSE of -25dB.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.4
• /
• pp.11-22
• /
• 1999

Least-mean-square(LMS) adaptive filters have proven to be extremely useful in a number of signal processing tasks. However LMS adaptive filter suffer from a slow rate of convergence for a given steady-state mean square error as compared to the behavior of recursive least squares adaptive filter. In this paper an efficient signal interference control technique is introduced to improve the convergence speed of LMS algorithm with tap weighted vectors updating which were controled by reusing data which was abandoned data in the Adaptive transversal filter in the scheme with data recycling buffers. The computer simulation show that the character of convergence and the value of MSE of proposed algorithm are faster and lower than the existing LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer algorithm could efficiently reject ISI of channel and increase speed of convergence in avoidance burden of computational complexity in reality when it was experimented having the same condition of LMS algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.691-698
• /
• 2003

We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-l, we may compute the updated estimate of this vector at iteration n upon the arrival of new data. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. In this paper, we propose new tap weight updated RLS algorithm in adaptive transversal filter with data-recycling buffer structure. We prove that convergence speed of learning curve of RLS algorithm with data-recycling buffer is faster than it of exiting RLS algorithm to mean square error versus iteration number. Also the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired sample is portion to increase to converge the specified value from the three dimension simulation result of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of convergence character in performance, is achieved at the B times of convergence speed of mean square error increase in data recycle buffer number with new proposed RLS algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.5
• /
• pp.459-464
• /
• 2016

The mobile communication service is widely used and the repeaters is rapidly increasing because of the extending service areas. we propose a new Signed CMA(: Constant Modulus Algorithm) algorithm for ICS(: Interference Cancellation System) as a larger service area of mobile communication service. The proposed Signed CMA algorithm improved performances by adjusting step size values. We showed that the proposed algorithm could improve the Mean Square Error(: MSE) performance of Signed CMA. MATLAB(: Matrix Laboratory) is employed to analyze the proposed algorithm and to compare it with the experimental results. At the convergence of 1000 iteration state, the MSE(: Mean Square Error) performance of the proposed Signed CMA algorithm with step size of 0.0065 is about 5 dB better than the conventional CMA algorithm.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.171-174
• /
• 1998

A class of non-parametric detectors based on quantized m-dimensional noise sample space is introduced. Due to assuming the nongaussian noise as a channel model, it is not easy to design the detector through estimating the unknown functional form of noise; instead equiprobably partitioning m-dimensional noise into a finite number of regions, using a VQ and quantiles obtained by RMSA algorithm is used in this paper to design detectors. To show the comparison of performance between single sample detector and system suggested here, Monte-Carlo simulations were used. The effect of signal pulse shape on the receiver performance is analyzed too.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.712-716
• /
• 2003

본 논문은 신경망을 이용한 간섭 신호 제어로써 복합 다중 퍼셉트론에서 DS/SS 이동 통신에서의 수신된 신호들을 역전파 학습알고리즘을 이용하여 검출하는 것에 대하여 연구한다. 수신 신호가 일정한 비트율을 갖는 채널에 전송하기 위하여 신경망을 이용한 새로운 탭 가중치 갱신 제어 방법을 제안한다. 적응 횡단선 필터는 심볼간의 채널에 발생하는 상호 심볼간 간섭을 억압하기 위해 LMS 알고리즘 사용한다. 이 알고리즘은 원하는 응답과 실제 출력간의 차인 에러를 이용하여 탭 가중치 조절 메카니즘을 통해 탭 가중치를 갱신함으로서 효과적으로 간섭을 제거하였다. 본 논문은 상호 심볼간 간섭을 효율적으로 억압해온 기존의 LMS 알고리즘에 다계층 퍼셉트론 신경망을 조합한 새로운 BISP 알고리즘을 제안하였으며, 제안된 알고리즘을 통해 탭 가중치 갱신이 보다 효율적으로 이루어짐을 알 수 있다. 시뮬레이션 결과를 통해 제안된 알고리즘의 평균 자승 에러의 수렴 특성이 기존 LMS 알고리즘을 이용한 수렴특성보다 우월하다는 것을 나타내었다.