• Title/Summary/Keyword: Weight vector

Search Result 513, Processing Time 0.027 seconds

A Study on Interference Cancelling Receiver with Adaptive Blind CMA Array (적응 블라인드 CMA 어레이를 이용한 간섭 제거 수신기에 관한 연구)

  • 우대호;변윤식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4A
    • /
    • pp.330-335
    • /
    • 2002
  • In the direct sequence code division multiple access system, the problem of multiple access interference due to multiple access is generated. A interference cancelling receiver is used to solve this problem. The conventional interference cancelling receiver is structure of successive interference canceller using antenna array. In this structure, the difference of between method I and method II depends on updating weight vector. In this paper, the adaptive blind CMA array interference cancelling receiver using cost function of constant modulus algorithms is proposed to update weight vector at conventional structure. The simulation compared the proposed interference cancelling receiver with two conventional interference cancelling receivers by signal to interference ratio and bit error rate curve under additive white Gaussian noise environment. The simulation results show that the proposed receiver has about the gain of SIR of 1.5[dB] more than method I which is conventional receiver at SIR curve, and about the gain of SIR of 0.5(dB) more than method II. In BER curve, the proposed IC receiver about the gain of SNR of 2[dB] more than method I and about the gain of SNR of 0.5[dB] more than method If, Thus, the proposed interference cancelling receiver has the higher performance than conventional interference cancelling receivers.

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

Adaptive Beamforming Technique of Eigen-space Smart Antenna System (고유공간 스마트 안테나 시스템의 적응 빔형성 기술)

  • 김민수;이원철;최승원
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.13 no.10
    • /
    • pp.989-997
    • /
    • 2002
  • This paper presents a new technique that enhances the performance of the smart antenna system especially in signal environments of wide angular spread by adopting a weight vector obtained from two eigenvectors of theautocovariance matrix of the received data. While the conventional beamformingtechnique employs only one eigenvector corresponding to the largest eigenvalue, the proposed algorithm uses two eigenvectors corresponding to the largest and second largest eigenvalue in such a way that it can be robust enough to the signal environments of wide angular spread. An efficient adaptive procedure is shown to verify that the optimal weight vector consisting of the two eigenvectors is obtained with a reasonable complexity(3.5$N_2$+ 12N) and accuracy. it is also shown in this paper that the numerical results obtained from the proposed adaptive procedure well agree with those obtained from a commercial tool computing the eigen-function of MATLABTM.

General linearly constrained adaptive arrays (일반 선형제약 적응배열)

  • Chang, Byong Kun
    • The Journal of the Acoustical Society of Korea
    • /
    • v.36 no.3
    • /
    • pp.151-157
    • /
    • 2017
  • A general linearly constrained adaptive array is proposed to improve the nulling performance. The nulling performance is examined in the array weight vector space. It is shown that the constraint plane is shifted to the origin perpendicularly by the gain factor such that the increase of the gain factor results in the decrease of the distance from the constraint plane to the origin. Thus the variation of the gain factor has an effect on the extent of orthogonality between the weight vector and the steering vectors for the interferences such that the nulling performance of the general linearly constrained adaptive array is improved by the gain factor. It is observed that the proposed adaptive array with an optimum value of the gain factor yields a better nulling performance in coherent signal environment and a similar nulling performance in noncoherent signal environment compared to the conventional linearly constrained adaptive array.

Intelligibility Improvement of Low Bit-Rate Speech Coder Using Stochastic Spectral Equalizer (통계적 스펙트럼 이퀄라이저를 이용한 저 비트율 음성부호화기의 명료도 향상)

  • Lee, Jeong Hun;Yun, Deokgyu;Choi, Seung Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.10
    • /
    • pp.1183-1185
    • /
    • 2016
  • Low bit-rate speech coder in digital speech communications synthesizes speech using vocal tract model parameters. In this case, the spectra of the synthesized speech can be much distorted since the allocated bits for the parameters are considerably limited, which results in the degradation of speech intelligibility. In this paper, we propose a speech intelligibility improvement method using stochastic spectral equalizer. This method stochastically obtains the weight vector of each speech coder using spectral ratios between original and synthesized speech, then applies this weight vector to synthesized speech. From the experiments of objective speech intelligibility tests, we found that the performance of the proposed method is better than that of the conventional method.

Semantic Visualization of Dynamic Topic Modeling (다이내믹 토픽 모델링의 의미적 시각화 방법론)

  • Yeon, Jinwook;Boo, Hyunkyung;Kim, Namgyu
    • Journal of Intelligence and Information Systems
    • /
    • v.28 no.1
    • /
    • pp.131-154
    • /
    • 2022
  • Recently, researches on unstructured data analysis have been actively conducted with the development of information and communication technology. In particular, topic modeling is a representative technique for discovering core topics from massive text data. In the early stages of topic modeling, most studies focused only on topic discovery. As the topic modeling field matured, studies on the change of the topic according to the change of time began to be carried out. Accordingly, interest in dynamic topic modeling that handle changes in keywords constituting the topic is also increasing. Dynamic topic modeling identifies major topics from the data of the initial period and manages the change and flow of topics in a way that utilizes topic information of the previous period to derive further topics in subsequent periods. However, it is very difficult to understand and interpret the results of dynamic topic modeling. The results of traditional dynamic topic modeling simply reveal changes in keywords and their rankings. However, this information is insufficient to represent how the meaning of the topic has changed. Therefore, in this study, we propose a method to visualize topics by period by reflecting the meaning of keywords in each topic. In addition, we propose a method that can intuitively interpret changes in topics and relationships between or among topics. The detailed method of visualizing topics by period is as follows. In the first step, dynamic topic modeling is implemented to derive the top keywords of each period and their weight from text data. In the second step, we derive vectors of top keywords of each topic from the pre-trained word embedding model. Then, we perform dimension reduction for the extracted vectors. Then, we formulate a semantic vector of each topic by calculating weight sum of keywords in each vector using topic weight of each keyword. In the third step, we visualize the semantic vector of each topic using matplotlib, and analyze the relationship between or among the topics based on the visualized result. The change of topic can be interpreted in the following manners. From the result of dynamic topic modeling, we identify rising top 5 keywords and descending top 5 keywords for each period to show the change of the topic. Existing many topic visualization studies usually visualize keywords of each topic, but our approach proposed in this study differs from previous studies in that it attempts to visualize each topic itself. To evaluate the practical applicability of the proposed methodology, we performed an experiment on 1,847 abstracts of artificial intelligence-related papers. The experiment was performed by dividing abstracts of artificial intelligence-related papers into three periods (2016-2017, 2018-2019, 2020-2021). We selected seven topics based on the consistency score, and utilized the pre-trained word embedding model of Word2vec trained with 'Wikipedia', an Internet encyclopedia. Based on the proposed methodology, we generated a semantic vector for each topic. Through this, by reflecting the meaning of keywords, we visualized and interpreted the themes by period. Through these experiments, we confirmed that the rising and descending of the topic weight of a keyword can be usefully used to interpret the semantic change of the corresponding topic and to grasp the relationship among topics. In this study, to overcome the limitations of dynamic topic modeling results, we used word embedding and dimension reduction techniques to visualize topics by era. The results of this study are meaningful in that they broadened the scope of topic understanding through the visualization of dynamic topic modeling results. In addition, the academic contribution can be acknowledged in that it laid the foundation for follow-up studies using various word embeddings and dimensionality reduction techniques to improve the performance of the proposed methodology.

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.

Comparative Evaluation of User Similarity Weight for Improving Prediction Accuracy in Personalized Recommender System (개인화 추천 시스템의 예측 정확도 향상을 위한 사용자 유사도 가중치에 대한 비교 평가)

  • Jung Kyung-Yong;Lee Jung-Hyun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.6
    • /
    • pp.63-74
    • /
    • 2005
  • In Electronic Commerce, the latest most of the personalized recommender systems have applied to the collaborative filtering technique. This method calculates the weight of similarity among users who have a similar preference degree in order to predict and recommend the item which hits to propensity of users. In this case, we commonly use Pearson Correlation Coefficient. However, this method is feasible to calculate a correlation if only there are the items that two users evaluated a preference degree in common. Accordingly, the accuracy of prediction falls. The weight of similarity can affect not only the case which predicts the item which hits to propensity of users, but also the performance of the personalized recommender system. In this study, we verify the improvement of the prediction accuracy through an experiment after observing the rule of the weight of similarity applying Vector similarity, Entropy, Inverse user frequency, and Default voting of Information Retrieval field. The result shows that the method combining the weight of similarity using the Entropy with Default voting got the most efficient performance.

Bayesian Neural Network with Recurrent Architecture for Time Series Prediction

  • Hong, Chan-Young;Park, Jung-Hun;Yoon, Tae-Sung;Park, Jin-Bae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.631-634
    • /
    • 2004
  • In this paper, the Bayesian recurrent neural network (BRNN) is proposed to predict time series data. Among the various traditional prediction methodologies, a neural network method is considered to be more effective in case of non-linear and non-stationary time series data. A neural network predictor requests proper learning strategy to adjust the network weights, and one need to prepare for non-linear and non-stationary evolution of network weights. The Bayesian neural network in this paper estimates not the single set of weights but the probability distributions of weights. In other words, we sets the weight vector as a state vector of state space method, and estimates its probability distributions in accordance with the Bayesian inference. This approach makes it possible to obtain more exact estimation of the weights. Moreover, in the aspect of network architecture, it is known that the recurrent feedback structure is superior to the feedforward structure for the problem of time series prediction. Therefore, the recurrent network with Bayesian inference, what we call BRNN, is expected to show higher performance than the normal neural network. To verify the performance of the proposed method, the time series data are numerically generated and a neural network predictor is applied on it. As a result, BRNN is proved to show better prediction result than common feedforward Bayesian neural network.

  • PDF

Characteristic Analysis of Rotor Losses in High-Speed Permanent Magnet Synchronous Motor (초고속 영구자석형 동기 전동기의 회전자 손실 특성해석)

  • 장석명;조한욱;이성호;양현섭
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.53 no.3
    • /
    • pp.143-151
    • /
    • 2004
  • High-speed permanent magnet machines are likely to be a key technology for electric drives and motion control systems for many applications, since they are conductive to high efficiency, high power density, small size and low weight. In high-speed machines, the permanent magnets are often contained within a retaining sleeve. However, the sleeve and the magnets are exposed to high order flux harmonics, which cause parasitic eddy current losses. Rotor losses of high-speed machines are of great importance especially in high-speed applications, because losses heat the rotor, which is often very compact construction and thereby difficult to cool. This causes a danger of demagnetization of the NdFeB permanent magnets. Therefore, special attention should be paid to the prediction of the rotor losses. This paper is concerned with the rotor losses in permanent magnet high-speed machines that are caused by permeance variation due to stator slotting. First, the flux harmonics are determined by double Fourier analysis of the normal flux density data over the rotor surface. And then, the rectilinear model was used to calculate rotor losses in permanent magnet machines. Finally, Poynting vector have been used to investigate the rotor eddy current losses of high-speed Permanent magnet machine.