• 제목/요약/키워드: decision-directed algorithm

검색결과 89건 처리시간 0.025초

IMT-2000 시스템을 위한 QPSK 복조기 구현 (Implementation of QPSK Demodulator for IMT-2000 System)

  • 김상명;김상훈;황원철;정지원
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2000년도 춘계종합학술대회
    • /
    • pp.226-230
    • /
    • 2000
  • 본 논문에서는 CPLD 칩을 이용하여 QPSK 복조기를 구현하고, 그 결과를 검토하였다. 복조기는 비트 동기를 포착하는 STR(Symbol Timing Recovery) loop와 반송파 동기를 포착하는 CPR(Carrier Phase Recovery) loop로 구성된다 STR loop는 DD-Gardner 방식을, CPR loop는 빠른 반송파 포착을 위하여 Decision-Directed 동기화 방식을 이용하여 구현한 결과를 제시하였다. Altera사의 Design Compiler를 이용하여 FLEX10K 칩에 합성한 QPSK 복조기의 속도는 약 2 (Mbps)의 전송속도를 가지며, ASIC으로 구현시에는 CPLD 속도의 5-6배 이상의 고속화가 가능하다.

  • PDF

A BLMS Adaptive Receiver for Direct-Sequence Code Division Multiple Access Systems

  • Hamouda Walaa;McLane Peter J.
    • Journal of Communications and Networks
    • /
    • 제7권3호
    • /
    • pp.243-247
    • /
    • 2005
  • We propose an efficient block least-mean-square (BLMS) adaptive algorithm, in conjunction with error control coding, for direct-sequence code division multiple access (DS-CDMA) systems. The proposed adaptive receiver incorporates decision feedback detection and channel encoding in order to improve the performance of the standard LMS algorithm in convolutionally coded systems. The BLMS algorithm involves two modes of operation: (i) The training mode where an uncoded training sequence is used for initial filter tap-weights adaptation, and (ii) the decision-directed where the filter weights are adapted, using the BLMS algorithm, after decoding/encoding operation. It is shown that the proposed adaptive receiver structure is able to compensate for the signal-to­noise ratio (SNR) loss incurred due to the switching from uncoded training mode to coded decision-directed mode. Our results show that by using the proposed adaptive receiver (with decision feed­back block adaptation) one can achieve a much better performance than both the coded LMS with no decision feedback employed. The convergence behavior of the proposed BLMS receiver is simulated and compared to the standard LMS with and without channel coding. We also examine the steady-state bit-error rate (BER) performance of the proposed adaptive BLMS and standard LMS, both with convolutional coding, where we show that the former is more superior than the latter especially at large SNRs ($SNR\;\geq\;9\;dB$).

회전결정경계를 이용한 QPSK 복조용 자동주파수 제어 알고리즘 (A rotational decision-directed AFC algorithm for QPSK demodulation)

  • 황유모;박경배
    • 전자공학회논문지S
    • /
    • 제34S권11호
    • /
    • pp.16-24
    • /
    • 1997
  • In order to prevent the presence of the residual phase difference at the discriminator output by the existing AFC techniques, we propose a new automatic frequency control(AFC) tracking algorithm for QPSK demodulation at the digital direct broadcasting satellite(DBS) receiver, which we call a rotational decision-directed AFC(RDDAFC). The RDDAFC rotates the decision boundary for the kth received symbol by the frequency deterctor output of the (k-1)th received symbol. Tracking performances of carrier frequency offset by the proposed RDDAFC algorithm are evaluated through computer simulations under the practical DBS channel conditions with a carrier frequency offset of 2.3MHz when S/N equals 2dB. Test results show that the total pull-in time of the RDDAFC is 1.697msec for 10$^{-3}$ SER before forwared error correction at the receiver.

  • PDF

수정된 DD LMS 알고리즘 (A Modified Decision-Directed LMS Algorithm)

  • 오길남
    • 전자공학회논문지
    • /
    • 제53권7호
    • /
    • pp.3-8
    • /
    • 2016
  • 자기적응 등화기의 최적화에 널리 사용되는 판정의거(decision-directed: DD) least mean square(LMS) 알고리즘의 수정된 형태를 제안하고, 수정된 형태가 기존 알고리즘의 초기 수렴 특성을 크게 개선함을 보인다. 기존 DD LMS는 등화기 출력과 그에 대한 양자화 값의 차이를 오차로 간주하고, 오차의 제곱을 비용 함수로 하여 등화기 계수에 대해 이를 최소화함으로써 등화기의 최적화를 달성한다. 이 오차 발생 방법은 이진 신호 또는 단일레벨 신호에 유용하나, 다치레벨 신호의 경우 등화기의 초기화에는 효과적이지 못하다. 수정된 DD LMS에서는 오차 발생을 수정하여 이 문제를 해결하였다. 다치레벨 신호를 대상으로 한 모의실험을 통해 심볼간 간섭에 의한 왜곡과 부가 잡음 하에서 수정된 DD LMS의 유용성과 성능을 검증하였다.

Knowledge Representation Using Decision Trees Constructed Based on Binary Splits

  • Azad, Mohammad
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권10호
    • /
    • pp.4007-4024
    • /
    • 2020
  • It is tremendously important to construct decision trees to use as a tool for knowledge representation from a given decision table. However, the usual algorithms may split the decision table based on each value, which is not efficient for numerical attributes. The methodology of this paper is to split the given decision table into binary groups as like the CART algorithm, that uses binary split to work for both categorical and numerical attributes. The difference is that it uses split for each attribute established by the directed acyclic graph in a dynamic programming fashion whereas, the CART uses binary split among all considered attributes in a greedy fashion. The aim of this paper is to study the effect of binary splits in comparison with each value splits when building the decision trees. Such effect can be studied by comparing the number of nodes, local and global misclassification rate among the constructed decision trees based on three proposed algorithms.

A New Implementation of the LMS Algorithm as a Decision-directed Adaptive Equalizer with Decoding Delay

  • Ahn, Sang-Sik
    • The Journal of the Acoustical Society of Korea
    • /
    • 제15권1E호
    • /
    • pp.89-94
    • /
    • 1996
  • This paper deals with the application of the LMS algorithm as a decision-directed adaptive equalizer in a communication receiver which also employs a sophisticated decoding scheme such as the Viterbi algorithm, in which the desired signal, hence the error, is not available until several symbol intervals later because of decoding delay. In such applications the implemented weight updating algorithm becomes DLMS and major penalty is reduced convergence speed. Therefore, every effort should by made to keep the delay as small as possible if it is not avoidable. In this paper we present a modified implementation in which the effects of the decoding delay can be avioded and perform some computer simulations to check the validity and the performance of the new implementation.

  • PDF

고차 QAM 신호에 대한 결정 지향 오차 신호의 크기 값을 이용한 이중 모드 블라인드 등화 알고리즘의 성능 분석 (Performance Evaluation of a Dual-Mode Blind Equalization Algorithm Using the Size of Decision-Directed Error Signal for High-Order QAM Signals)

  • 정영화
    • 한국인터넷방송통신학회논문지
    • /
    • 제16권3호
    • /
    • pp.89-95
    • /
    • 2016
  • 본 논문에서는 결정 지향 오차 신호의 크기 값을 이용하여 두개의 블라인드 등화 알고리즘이 자동으로 전환되는 이중 모드 블라인드 등화 알고리즘을 제안한다. 제안한 알고리즘은 등화초기에는 주로 큰 고정 스텝 크기를 가지는 MSAGF-SMMA를 통하여 보다 빠른 수렴 속도를 얻도록 하고, 어느 정도 등화가 이루어진 시점부터는 주로 가변 스텝 크기를 가지는 MSAGF-SMMA가 동작하도록 함으로써 정상상태에서 보다 작은 잔류 오차를 얻도록 하였다. 가변 스텝 크기는 고정 스텝 크기에 결정 지향 오차 신호의 크기 값을 곱하여 구한다. 본 논문에서 제안한 알고리즘에 대한 성능을 분석하였다. 컴퓨터 모의실험을 통하여 제안한 알고리즘이 MMA, SMMA, 그리고 MSAGF-SMMA에 비해 정상상태에서의 잔류 심볼간 간섭과 잔류 오차 등에서 크게 향상된 성능을 가짐을 확인하였다.

8-VSB HDTV 수신기용 자동 변환 채널등화 알고리즘 (Auto-switching Equalization Algorithm for 8-VSB HDTV Receiver)

  • 박경도;황유모
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 추계학술대회 논문집 학회본부 B
    • /
    • pp.624-626
    • /
    • 1998
  • Adaptive channel equalization accomplished without resorting to a training sequence is known as blind equalization. In this paper, we present a auto-switching blind, equalization for 8-VSB HDTV receiver. The scheme operate in two mode : blind equalization mode and decision-directed equalization mode. This proposed scheme changes from the blind equalization mode at high error levels to the decision-directed equalization mode at lower error levels smoothly and automatically. Manual switch from the blind equalization mode to the decision-directed mode is not necessary.

  • PDF

Machine Layout Decision Algorithm for Cellular Formation Problem

  • Lee, Sang-Un
    • 한국컴퓨터정보학회논문지
    • /
    • 제21권4호
    • /
    • pp.47-54
    • /
    • 2016
  • Cellular formation and layout problem has been known as a NP-hard problem. Because of the algorithm that can be solved exact solution within polynomial time has been unknown yet. This paper suggests a systematic method to be obtain of 2-degree partial directed path from the frequency of consecutive forward order. We apply the modified Kruskal algorithm of minimum spanning tree to be obtain the partial directed path. the proposed reverse constructive algorithm can be solved for this problem with O(mn) time complexity. This algorithm performs same as best known result of heuristic and metaheuristic methods for 4 experimental data.

강인한 자력복구 채널등화 알고리즘 및 8-VSB 수신시스템에의 응용 (Robust Blind Equalization Algorithms and Its Application to 8-VSB Receiver)

  • 박경도;황유모
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제48권8호
    • /
    • pp.1037-1045
    • /
    • 1999
  • We propose two new classes of robust blind equalization algorithms against abrupt changes of channel conditions, which we call a triple-mode algorithm(TMA) and an automatic switch-over algorithm(ASA). The conventional DMGSA exhibits slow convergence rates due to the incorrect equalizer tap-updating process under the severe channel conditions. In order to speed up the convergence process, the TMA operates in triple-mode that is based on the dual-mode of the DMGSA incorporated with the tap-updating control modes of the SGA as well as the MSGA. Without resorting to the decision region for selecting the operation mode in the TMA, the ASA automatically switches the blind mode to the smoother conventional decision-directed mode. The ASA uses the error functional that is the weighted sum of the Generalized Sato error and the decision-directed error, where the weights correspond to the channel conditions. Test results on 16-QAM and 8-VSB datas confirm that the TMA and the ASA perform well under the sudden changes of channel conditions.

  • PDF