• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.025 seconds

A new dual-mode blind equalization algorithm combining carrier phase recovery (반송파 위상 복원을 결합한 새로운 이중모드 블라인드 등화 알고리즘)

  • 오길남;진용옥
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.5
    • /
    • pp.14-23
    • /
    • 1995
  • A new dual-mode algorithm for blind equalization of quadrature amplitude modulation (QAM) signals is proposed. To solve the problem that the constant modulus algorithm (CMA) converges to the constellation with the arbitrary phase rotation, with the modification of the CMA, the proposed algorithm accomplishes blind equalization and carrier phase recovery simultaneously. In addition, the dual-mode algorithm combining the modified constant modulus algorithm (MCMA) with decision-directed (DD) algorithm achieves the performance enhancement of blind convergence speed and steady-state residual ISI. So we can refer the proposed algorithm to as a scheme for joint blind equalization and carrier phase recovery. Simulation results for i.i.d. input signals confirm that the dual-mode algorithm results in faster convergence speed, samller residual ISI, and better carrier phase recovery than those of the CMA and DD algorithm without any significant increase in computational complexity.

  • PDF

Decentralized Control with Input Compensation Form for Gantry Crane Systems (갠트리 크레인의 입력 보상형 분산제어)

  • Kim, Hwan-Seong;Kim, Myeong-Gyu;Yu, Sam-Seong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.4
    • /
    • pp.281-287
    • /
    • 2001
  • In this paper, we deal with a decentralized control scheme with input compensation form for gantry crane systems. By considering the gantry cranes characteristics, the system is decentralized into two subsystems, the travelling and swaying subsystem and the hoisting subsystem. For decentralizing the system, a simple algorithm is proposed using the observability canonical form. The decentralized subsystems include unknown inputs that one coupled with other subsystems and actuator failures. These unknown input and actuator failures are estimated by using PI observation techniques. And those estimated values are used to construct an input compensation form. Finally, the proposed decentralized control scheme for the gantry crane systems is verified by crane simulation.

  • PDF

Sensorless Control of Three Phase Converter using estimated Input Phase-Voltage and DC-link Voltage (전원전압과 DC-link 전압 추정을 통한 3상 컨버터 센서리스 제어)

  • Chu, Hung-Seok;Park, Sung-Jun;Kim, Kwong-Tae;Kim, Cheul-U
    • Proceedings of the KIEE Conference
    • /
    • 2000.07b
    • /
    • pp.1233-1235
    • /
    • 2000
  • A new control method of three phase converter without measuring input phase-voltage and DC-link voltage is proposed. Input phase-voltage of these required voltages is estimated using EKF(Extended Kalman Filter) and DC-link voltage is estimated from the measured line currents and the estimated input phase-voltage. This control method is achieved without PLL(Phase Locked Loop) which senses the angle of input phase-voltage and DC-link voltage sensor. In addition, the proposed method controls high power factor and DC-link voltage utilizing the estimated phase angle. This paper describes the effectiveness of the proposed estimated algorithm through simulations.

  • PDF

Transceiver Optimization for the Multi-Antenna Downlink in MIMO Cognitive System

  • Zhu, Wentao;Yang, Jingbo;Jia, Tingting;Liu, Xu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.12
    • /
    • pp.5015-5027
    • /
    • 2015
  • Transceiver optimization in multiple input multiple output (MIMO) cognitive systems is studied in this paper. The joint transceiver beamformer design is introduced to minimize the transmit power at secondary base station (SBS) while simultaneously controlling the interference to primary users (PUs) and satisfying the secondary users (SUs) signal-to-interference-plus-noise ratio (SINR) based on the convex optimization method. Due to the limited cooperation between SBS and PUs, the channel state information (CSI) usually cannot be obtained perfectly at the SBS in cognitive system. In this study, both perfect and imperfect CSI scenarios are considered in the beamformer design, and the proposed method is robust to CSI error. Numerical results validate the effectiveness of the proposed algorithm.

A Consideration of the Optimal Thinning Algorithm For Contour Line Vectorizing in the Geographic Information System (지리정보시스템에서 등고선 벡터화를 위한 최적 세선화 알고리즘에 대한 고찰)

  • Won, Nam-Sik;Jeon, Il-Soo;Lee, Doo-Han;Bu, Ki-Dong
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.2 no.1
    • /
    • pp.45-53
    • /
    • 1999
  • Geographic Information System(GIS) which facilitates efficient storage and retrieval of geographic information is very useful tools. It is of extreme importance to develop automated vectorizing system as input method for GIS, because it takes a large amount of time and effort in constructing a GIS. In all kinds of map processed by GIS, contour line map specially takes a large amount of effort. In this paper we have considered an optimal thinning algorithm for the contour line vectorizing in the GIS. Based on the experimental results, it has been proved that thinning algorithm using the connection value is most excellent algorithm in the similarity and connectivity.

  • PDF

Adaptive K-best Sphere Decoding Algorithm Using the Characteristics of Path Metric (Path Metric의 특성을 이용한 적응형 K-best Sphere Decoding 기법)

  • Kim, Bong-Seok;Choi, Kwon-Hue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11A
    • /
    • pp.862-869
    • /
    • 2009
  • We propose a new adaptive K-best Sphere Decoding (SD) algorithm for Multiple Input Multiple Output (MIMO) systems where the number of survivor paths, K is changed based on the characteristics of path metrics which contain the instantaneous channel condition. In order to overcome a major drawback of Maximum Likelihood Detection (MLD) which exponentially increases the computational complexity with the number of transmit antennas, the conventional adaptive K-best SD algorithms which achieve near to MLD performance have been proposed. However, they still have redundant computation complexity since they only employ the channel fading gain as a channel condition indicator without instantaneous Signal to Noise Ratio (SNR) information. hi order to complement this drawback, the proposed algorithm use the characteristics of path metrics as a simple channel indicator. It is found that the ratio of the minimum path metric to the other path metrics reflects SNR information as well as channel fading gain. By adaptively changing K based on this ratio, the proposed algorithm more effectively reduce the computation complexity compared to the conventional K-best algorithms which achieve same performance.

k-Fragility Maximization Problem to Attack Robust Terrorist Networks

  • Thornton, Jabre L.;Kim, Donghyun;Kwon, Sung-Sik;Li, Deying;Tokuta, Alade O.
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.1
    • /
    • pp.33-38
    • /
    • 2014
  • This paper investigates the shaping operation problem introduced by Callahan et al., namely the k-fragility maximization problem (k-FMP), whose goal is to find a subset of personals within a terrorist group such that the regeneration capability of the residual group without the personals is minimized. To improve the impact of the shaping operation, the degree centrality of the residual graph needs to be maximized. In this paper, we propose a new greedy algorithm for k-FMP. We discover some interesting discrete properties and use this to design a more thorough greedy algorithm for k-FMP. Our simulation result shows that the proposed algorithm outperforms Callahan et al.'s algorithm in terms of maximizing degree centrality. While our algorithm incurs higher running time (factor of k), given that the applications of the problem is expected to allow sufficient amount of time for thorough computation and k is expected to be much smaller than the size of input graph in reality, our algorithm has a better merit in practice.

Modulation Recognition of MIMO Systems Based on Dimensional Interactive Lightweight Network

  • Aer, Sileng;Zhang, Xiaolin;Wang, Zhenduo;Wang, Kailin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.10
    • /
    • pp.3458-3478
    • /
    • 2022
  • Automatic modulation recognition is the core algorithm in the field of modulation classification in communication systems. Our investigations show that deep learning (DL) based modulation recognition techniques have achieved effective progress for multiple-input multiple-output (MIMO) systems. However, network complexity is always an additional burden for high-accuracy classifications, which makes it impractical. Therefore, in this paper, we propose a low-complexity dimensional interactive lightweight network (DilNet) for MIMO systems. Specifically, the signals received by different antennas are cooperatively input into the network, and the network calculation amount is reduced through the depth-wise separable convolution. A two-dimensional interactive attention (TDIA) module is designed to extract interactive information of different dimensions, and improve the effectiveness of the cooperation features. In addition, the TDIA module ensures low complexity through compressing the convolution dimension, and the computational burden after inserting TDIA is also acceptable. Finally, the network is trained with a penalized statistical entropy loss function. Simulation results show that compared to existing modulation recognition methods, the proposed DilNet dramatically reduces the model complexity. The dimensional interactive lightweight network trained by penalized statistical entropy also performs better for recognition accuracy in MIMO systems.

A Real-Time Video Stitching Algorithm in H.264/AVC Compressed Domain (실시간 H.264/AVC 압축 영역에서의 영상 합성 알고리즘)

  • Gankhuyag, Ganzorig;Hong, Eun Gi;Kim, Giyeol;Kim, Younghwan;Choe, Yoonsik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.6
    • /
    • pp.503-511
    • /
    • 2014
  • In this paper, a novel, real-time video stitching algorithm in an H.264/AVC compressed domain is proposed. This enables viewers to watch multiple video contents using a single device. The basic concept of this paper is that the server is asked to combine multiple streams into one bit-stream based in a compressed domain. In other words, this paper presents a new compressed domain combiner that works in boundary macroblocks of input videos with re-calculating intra prediction mode, intra prediction MVD, a re-allocation of the coefficient table, and border extension methods. The rest of the macroblocks of the input video data are achieved simply by copying them. Simulation experiments have demonstrated the possibility and effectiveness of the proposed algorithm by showing that it is able to generate more than 103 frames per second, stitching four 480p-sized images into each frame.

Study on the pronunciation correction in English Learning (영어 학습 시의 발성 교정 기술에 관한 연구)

  • Kim Jae-Min;Beack Seung-Kwon;Hahn Minsoo
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • spring
    • /
    • pp.119-122
    • /
    • 2000
  • In this paper, we implement an elementary system to correct accent, pronunciation, and intonation in English spoken by non-native English speakers. In case of the accent evaluation, energy and pitch information are used to find stressed syllables, and then we extract the segment information of input patterns using a dynamic time warping method to discriminate and evaluate accent position. For the pronunciation evaluation. we utilize the segment information using the same algorithm as in accent evaluation and calculate the spectral distance measure for each phoneme between input and reference. For the intonation evaluation. we propose nine pattern of slope to estimate pitch contour, then we grade test sentences by accumulated error obtained by the distance measure and estimated slope. Our result shows that 98 percent of accent and 71 percent of pronunciation evaluation agree with perceptual measure. As the result of the intonation evaluation. system represent the similar order of grade for the four sentences having different intonation patterns compared with perceptual evaluation.

  • PDF