• Title/Summary/Keyword: CGM algorithm

Search Result 11, Processing Time 0.082 seconds

Implementation of Interference Cancellation System for Relay Utilizing the CGM Algorithm (CGM 알고리즘을 이용한 중계기 간섭제거기 구현)

  • Ahn, Sung Soo;Ko, Jung Hwan
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.1
    • /
    • pp.139-145
    • /
    • 2012
  • This paper shows a novel interference cancellation method of relay utilizing to the CGM algorithm in wireless communication environments. It is a problem that relay have interference cause by feedback signal of it. CGM algorithm obtained weight value that can remove the interference due to feedback signal of relay. In this paper, we confirm that performance of CGM algorithm is far superior with suitable cancellation value to remove the feedback signal. Also, we implement CGM module to verify the real-time processing of CGM algorithm using to DSP. Based on the analysis from computer simulation, it is observed that proposed algorithm is suitable for the relay in time-varying environment.

Iterative Image Restoration Based on Wavelets for De-Noising and De-Ringing (잡음과 오류제거를 위한 웨이블렛기반 반복적 영상복원)

  • Lee Nam-Yong
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.5 no.4
    • /
    • pp.271-280
    • /
    • 2004
  • This paper presents a new iterative image restoration algorithm with removal of boundary/object-oriented ringing, The proposed method is based on CGM(Conjugate Gradient Method) iterations with inter-wavelet shrinkage. The proposed method provides a fast restoration as much as CGM, while having adaptive do-noising and do-ringing by using wavelet shrinkage. In order to have effective do-noising and do-ringing simultaneously, the proposed method uses a space-dependent shrinkage rule. The improved performance of the proposed method over more traditional iterative image restoration algorithms such as LR(Lucy-Richardson) and CGM in do-noising and do-ringing is shown through numerical experiments.

  • PDF

Study on CGM-LMS Hybrid Based Adaptive Beam Forming Algorithm for CDMA Uplink Channel (CDMA 상향채널용 CGM-LMS 접목 적응빔형성 알고리듬에 관한 연구)

  • Hong, Young-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.895-904
    • /
    • 2007
  • This paper proposes a robust sub-optimal smart antenna in Code Division Multiple Access (CDMA) basestation. It makes use of the property of the Least Mean Square (LMS) algorithm and the Conjugate Gradient Method (CGM) algorithm for beamforming processes. The weight update takes place at symbol level which follows the PN correlators of receiver module under the assumption that the post correlation desired signal power is far larger than the power of each of the interfering signals. The proposed algorithm is simple and has as low computational load as five times of the number of antenna elements(O(5N)) as a whole per each snapshot. The output Signal to Interference plus Noise Ratio (SINR) of the proposed smart antenna system when the weight vector reaches the steady state has been examined. It has been observed in computer simulations that proposed beamforming algorithm improves the SINR significantly compared to the single antenna case. The convergence property of the weight vector has also been investigated to show that the proposed hybrid algorithm performs better than CGM and LMS during the initial stage of the weight update iteration. The Bit Error Rate (BER) characteristics of the proposed array has also been shown as the processor input Signal to Noise Ratio (SNR) varies.

A systolic Array to Effectively Solve Large Sparce Matrix Linear System of Equations (대형 스파스 메트릭스 선형방정식을 효율적으로 해석하는 씨스톨릭 어레이)

  • 이병홍;채수환;김정선
    • 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.

  • PDF

Initial Design Domain Reset Method for Genetic Algorithm with Parallel Processing

  • Lim, O-Kaung;Hong, Keum-Shik;Lee, Hyuk-Soo;Park, Eun-Ho
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.7
    • /
    • pp.1121-1130
    • /
    • 2004
  • The Genetic Algorithm (GA), an optimization technique based on the theory of natural selection, has proven to be a relatively robust means of searching for global optimum. It converges to the global optimum point without auxiliary information such as differentiation of function. In the case of a complex problem, the GA involves a large population number and requires a lot of computing time. To improve the process, this research used parallel processing with several personal computers. Parallel process technique is classified into two methods according to subpopulation's size and number. One is the fine-grained method (FGM), and the other is the coarse-grained method (CGM). This study selected the CGM as a parallel process technique because the load is equally divided among several computers. The given design domain should be reduced according to the degree of feasibility, because mechanical system problems have constraints. The reduced domain is used as an initial design domain. It is consistent with the feasible domain and the infeasible domain around feasible domain boundary. This parallel process used the Message Passing Interface library.

Face Recognition on complex backgrounds using Neural Network (복잡한 배경에서 신경망을 이용한 얼굴인식)

  • Han, Jun-Hee;Nam, Kee-Hwan;Park, Ho-Sik;Lee, Young-Sik;Jung, Yeon-Gil;Ra, Sang-Dong;Bae, Cheol-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.1149-1152
    • /
    • 2005
  • Detecting faces in images with complex backgrounds is a difficult task. Our approach, which obtains state of the art results, is based on a generative neural network model: the Constrained Generative Model (CGM). To detect side view faces and to decrease the number of false alarms, a conditional mixture of networks is used. To decrease the computational time cost, a fast search algorithm is proposed. The level of performance reached, in terms of detection accuracy and processing time, allows to apply this detector to a real word application: the indexation of face images on the Web.

  • PDF

Architectural Analysis of Type-2 Interval pRBF Neural Networks Using Space Search Evolutionary Algorithm (공간탐색 진화알고리즘을 이용한 Interval Type-2 pRBF 뉴럴 네트워크의 구조적 해석)

  • Oh, Sung-Kwun;Kim, Wook-Dong;Park, Ho-Sung;Lee, Young-Il
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.1
    • /
    • pp.12-18
    • /
    • 2011
  • In this paper, we proposed Interval Type-2 polynomial Radial Basis Function Neural Networks. In the receptive filed of hidden layer, Interval Type-2 fuzzy set is used. The characteristic of Interval Type-2 fuzzy set has Footprint Of Uncertainly(FOU), which denotes a certain level of robustness in the presence of un-known information when compared with the type-1 fuzzy set. In order to improve the performance of proposed model, we used the linear polynomial function as connection weight of network. The parameters such as center values of receptive field, constant deviation, and connection weight between hidden layer and output layer are optimized by Conjugate Gradient Method(CGM) and Space Search Evolutionary Algorithm(SSEA). The proposed model is applied to gas furnace dataset and its result are compared with those reported in the previous studies.

Design of adaptive equalizer for wide-band mobile communications (광대역 이동통신을 위한 적응등화기의 설계)

  • 이찬복;최승원
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.1
    • /
    • pp.14-25
    • /
    • 1995
  • The main contribution of this paper can be summarized in two items as follws. Firstly, a modelling of mobile communication channel with Rayleigh fading characteristics is presented. Actual signal environments can be approximated as being real measurements by a proper mathematical representation of fluctuation of channel parameters due to Doppler effect, that is determined by the relative speed between transmitter and receiver, and noises, that vary at each sampling time. Secondly, an alternative procedure of synthesizing an adaptive equalizers is presented for recovering original signals that have been corrupted through the modelled channel. In order to compute the optimal tap coefficients for a high speed data(512 k symbol/sec) on a real-time basis, the CGM that guarantees fast and stable convergency is adopted during the training period of each frame. The coefficients obtained by the CGM are used as initial values for the LMS algorithm to trace the optimal coefficients during the data period that vary at each sampling time due to the mobility and noise at the receiver. Using the modelling presented in this paper, distributions of received signal power in various signal environments are demonstrated. The performance of the eqalizer proposed in this paper is shown as a function of BER under the various signal circumstances of mobile communications.

  • PDF

A Smart Antenna Test-bed Utilizing TMS320C30 in Smart Antenna System (TMS320C30을 이용한 스마트 안테나 시스템의 Test-bed 구현)

  • 김종욱;권세용;안성수;최승원
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.11 no.4
    • /
    • pp.523-533
    • /
    • 2000
  • In this paper, we present the hardware implementation of a smart antenna test-bed for a real -time performance analysis of the beam-forming algorithm operating in a wide-band CDMA environments of the WLL(Wireless Local Loop) standard. The test-bed introduced in this paper includes an external PC and signal generating module as well as the beam-forming module in order to perform, analyze, and evaluate the performance of the proposed smart antenna system. In the beam-forming module, the optimal weight vector is provided by the modified CGM algorithm. The computed weight vector is transferred back to the external PC for the performance analysis based on the off-line processing. From our analysis obtained in the hardware of the test-bed, it is concluded that the proposed smart antenna system for the WLL system is appropriate for enhancing the communication quality and capacity tremendously at the cell-site of the CDMA environment.

  • PDF

A New Blind Beamforming Procedure Based on the Conjugate Gradient Method for CDMA Mobile Communications

  • Shin, Eung-Soon;Choi, Seung-Won;Shim, Dong-Hee;Kyeong, Mun-Geon;Chang, Kyung-Hi;Park, Youn-Ok;Han, Ki-Chul;Lee, Chung-Kun
    • ETRI Journal
    • /
    • v.20 no.2
    • /
    • pp.133-148
    • /
    • 1998
  • The objective of this paper is to present an adaptive algorithm for computing the weight vector which provides a beam pattern having its maximum gain along the direction of the mobile target signal source in the presence of interfering signals within a cell. The conjugate gradient method (CGM) is modified in such a way that the suboptimal weight vector is produced with the computational load of O(16N), which has been found to be small enough for the real-time processing of signals in most land mobile communications with the digital signal processor (DSP) off the shelf, where N denotes the number of antenna elements of the array. The adaptive procedure proposed in this paper is applied to code division multiple access (CDMA) mobile communication system to show its excellent performance in terms of signal to interference plus noise ratio (SINR), bit error rate (BER), and capacity, which are enhanced by about 7 dB, ${\frac{1}{100}}$ times, and 7 times, respectively, when the number of antenna elements is 6 and the processing gain is 20 dB.

  • PDF