• Journal of Power Electronics
• /
• 제14권1호
• /
• pp.61-73
• /
• 2014

Multiphase machines are characterized by high power density, enhanced fault-tolerant capacity, and low torque pulsation. For a voltage source inverter supplied multiphase machine, the probability of load imbalances becomes greater and unwanted low-order stator voltage harmonics occur. This paper deals with the PWM control of multiphase inverters under unbalanced load conditions and it proposes a novel near-five-vector SVPWM algorithm based on the five-phase six-leg inverter. The proposed algorithm can output symmetrical phase voltages under unbalanced load conditions, which is not possible for the conventional SVPWM algorithms based on the five-phase five-leg inverters. The cause of extra harmonics in the phase voltages is analyzed, and an xy coordinate system orthogonal to the ${\alpha}{\beta}z$ coordinate system is introduced to eliminate low-order harmonics in the output phase voltages. Moreover, the digital implementation of the near-five-vector SVPWM algorithm is discussed, and the optimal approach with reduced complexity and low execution time is elaborated. A comparison of the proposed algorithm and other existing PWM algorithms is provided, and the pros and cons of the proposed algorithm are concluded. Simulation and experimental results are also given. It is shown that the proposed algorithm works well under unbalanced load conditions. However, its maximum modulation index is reduced by 5.15% in the linear modulation region, and its algorithm complexity and memory requirement increase. The basic principle in this paper can be easily extended to other inverters with different phase numbers.

• Journal of Communications and Networks
• /
• 제6권2호
• /
• pp.112-122
• /
• 2004

A nonlinear spectral-line method utilizing the fourth absolute moment of the receiver discrete Fourier transform output is proposed as a non-data-aided fine carrier frequency synchronization algorithm for OFDM receivers. A simple modification of the algorithm resulting in low implementation complexity is also developed. Analytic expressions are derived for the steady-state frequency error variances of the algorithms and verified to be very accurate via computer simulations over AWGN and frequency selective multipath channels. Numerical results show that the proposed algorithms provide reliable and excellent steady-state performance, especially with PSK modulation. Also, the proposed algorithms are insensitive to symbol timing offsets, only requiring a coarse symbol timing recovery.

• 한국통신학회논문지
• /
• 제34권11A호
• /
• pp.862-869
• /
• 2009

본 논문에서는 순간적인 채널 상태에 따라 K, 즉 survivor path의 개수를 적응적으로 조절하는 MIMO(Multiple Input Multiple Output) 검출 기법을 제안한다. 최적의 성능을 가지지만 높은 복잡도의 단점을 가지는 MLD(Maximum Likelihood Detection)의 단점을 개선하기 위해 MLD에 근접한 성능을 가지면서 복잡도는 확연히 감소시킨, 적응형 K-best SD (Sphere Decoding) 기법들이 제안되었지만, 채널 상태를 판별하기 위한 지표로, 채널의 페이딩 이득만을 이용할 뿐 순시적인 SNR(Signa1 to Noise Ratio) 값은 반영하지 못하는 단점을 가진다. 제안된 기법은 이러한 단점을 보완하기 위해 K를 조절하기 위한 채널 지표로 채널의 페이딩 성분뿐 아니라 SNR 성분까지 반영하는 path metric 값의 특성을 이용하여, 기존의 기법과 동일한 성능을 가지면서 낮은 복잡도를 가진다.

• 한국통신학회논문지
• /
• 제35권2C호
• /
• pp.148-154
• /
• 2010

본 연구에서는 무선 랜 표준안인 802.11n에서 채널 부호화 알고리즘으로 채택된 LDPC부호의 복호 알고리즘의 저복잡도에 대해 연구를 하였다. 샤논의 한계에 근접하기 위해서는 큰 블록 사이즈의 LDPC 부호어 길이와 많은 반복횟수를 요구한다. 이는 많은 계산량을 요구하며, 그리고 이에 따른 전력 소비량(power consumption)을 야기시키므로 본 논문에서는 세 가지 형태의 저복잡도 LDPC 복호 알고리즘을 제시한다. 첫째로 큰 블록 사이즈와 많은 반복 횟수는 많은 계산량과 전력 소모량을 요구하므로 성능 손실 없이 반복횟수를 줄일 수 있는 부분 병렬 방법을 이용한 복호 알고리즘, 둘째로 early stop 알고리즘에 대해 연구 하였고, 셋째로 비트 노드 계산과 체크 노드 계산 시 일정한 신뢰도 값보다 크면 다음 반복 시 계산을 하지 않는 early detection 알고리즘에 대해 연구 하였다.

• Journal of Electrical Engineering and Technology
• /
• 제12권3호
• /
• pp.1262-1270
• /
• 2017

Among various decoding algorithms of low-density parity-check (LDPC) codes, the min-sum (MS) algorithm and its modified algorithms are widely adopted because of their computational simplicity compared to the sum-product (SP) algorithm with slight loss of decoding performance. In the MS algorithm, the magnitude of the output message from a check node (CN) processing unit is decided by either the smallest or the next smallest input message which are denoted as min1 and min2, respectively. It has been shown that multiplying a scaling factor to the output of CN message will improve the decoding performance. Further, Zhong et al. have shown that multiplying different scaling factors (called a 2-dimensional scaling) to min1 and min2 much increases the performance of the LDPC decoder. In this paper, the simplified 2-dimensional scaled (S2DS) MS algorithm is proposed. In the proposed algorithm, we figure out a pair of the most efficient scaling factors which multiplications can be replaced with combinations of addition and shift operations. Furthermore, one scaling operation is approximated by the difference between min1 and min2. The simulation results show that S2DS achieves the error correcting performance which is close to or outperforms the SP algorithm regardless of coding rates, and its computational complexity is the lowest comparing to modified versions of MS algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권7호
• /
• pp.3095-3111
• /
• 2018

Spectrum sensing (SS) is one of the fundamental tasks for cognitive radio. In SS, decisions can be made via comparing the test statistics with a threshold. Conventional adaptive algorithms for SS usually adjust their thresholds according to the radio environment. This paper concentrates on the issue of adaptive SS whose threshold is adjusted based on the Markovian behavior of primary user (PU). Moreover, Bayesian cost is adopted as the performance metric to achieve a trade-off between false alarm and missed detection probabilities. Two novel adaptive algorithms, including Markov Bayesian energy detection (MBED) algorithm and IMBED (improved MBED) algorithm, are proposed. Both algorithms model the behavior of PU as a two-state Markov process, with which their thresholds are adaptively adjusted according to the detection results at previous slots. Compared with the existing Bayesian energy detection (BED) algorithm, MBED algorithm can achieve lower Bayesian cost, especially in high signal-to-noise ratio (SNR) regime. Furthermore, it has the advantage of low computational complexity. IMBED algorithm is proposed to alleviate the side effects of detection errors at previous slots. It can reduce Bayesian cost more significantly and in a wider SNR region. Simulation results are provided to illustrate the effectiveness and efficiencies of both algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권2호
• /
• pp.253-270
• /
• 2013

To achieve accurate localization information, complex algorithms that have high computational complexity are usually implemented. In addition, many of these algorithms have been developed to overcome several limitations, e.g., obstruction interference in multi-path and non-line-of-sight (NLOS) environments. However, localization systems those have complex design experience latency when operating multiple mobile nodes occupying various channels and try to compensate for inaccurate distance values. To operate multiple mobile nodes concurrently, we propose a localization system with both low complexity and high accuracy and that is based on a chirp spread spectrum (CSS) radio. The proposed localization system is composed of accurate ranging values that are analyzed by simple linear regression that utilizes a Big-$O(n^2)$ of only a few data points and an algorithm with a self-calibration feature. The performance of the proposed localization system is verified by means of actual experiments. The results show a mean error of about 1 m and multiple mobile node operation in a $100{\times}35m^2$ environment under NLOS condition.

• 융합신호처리학회논문지
• /
• 제13권2호
• /
• pp.99-105
• /
• 2012

본 논문은 직교주파수 분할 다중접속 시스템 (Orthogonal Frequency-division Multiple Access: OFDMA)에서 계산 효율적인 동적 부반송파 할당 (Dynamic subcarrier allocation :DSA) 기법을 제안하였다. 제안된 DSA 기법은 계산량을 크게 줄일 수 있을 뿐 아니라 전체 Channel quality information (CQI)를 전송하는 Amplitude Craving Greedy (ACG) 기법에 비해 CQI 정보량도 줄일 수 있다. 하지만 제안된 기법의 성능은 ACG 기법과 거의 유사하게 나타난다. 또한, 신호 대 잡음비에 기반한 대역폭 할당기법 (Bandwidth assignment based on the signal-to-noise ratio: BABS) 개선한 대역폭 할당기법을 제안하였다. 개선된 BABS 기법은 제안된 DSA 기법과 결합되어 기존 기법에 비해 더욱 높은 아웃티지 성능 이득을 나타낸다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권5호
• /
• pp.2299-2318
• /
• 2019

Location-aware networks are of great importance for both civil lives and military applications. Methods based on line-of-sight (LOS) measurements suffer sever performance loss in harsh environments such as indoor scenarios, where sensors can receive both LOS and non-line-of-sight (NLOS) measurements. In this paper, we propose a data association (DA) process based on the expectation maximization (EM) algorithm, which enables us to exploit multipath components (MPCs). By setting the mapping relationship between the measurements and scatters as a latent variable, coefficients of the Gaussian mixture model are estimated. Moreover, considering the misalignment of sensor position, we propose a space-alternating generalized expectation maximization (SAGE)-based algorithms to jointly update the target localization and sensor position information. A two dimensional (2-D) circularly symmetric Gaussian distribution is employed to approximate the probability density function of the sensor's position uncertainty via the minimization of the Kullback-Leibler divergence (KLD), which enables us to calculate the expectation step with low computational complexity. Moreover, a distributed implementation is derived based on the average consensus method to improve the scalability of the proposed algorithm. Simulation results demonstrate that the proposed centralized and distributed algorithms can perform close to the Monte Carlo-based method with much lower communication overhead and computational complexity.

• 한국정보전자통신기술학회논문지
• /
• 제8권1호
• /
• pp.45-50
• /
• 2015

본 논문은 능동 소음 제어를 위한 적응 알고리즘들의 성능을 비교함으로써 효과적인 적응 알고리즘을 보인다. 일반적인 적응 알고리즘으로는 normalized least mean square (NLMS) 알고리즘이 있다. NLMS는 구조가 간단하고 수렴 속도가 빠르다는 장점이 있어서 널리 사용되고 있다. 하지만 상관도가 높은 신호에 대해서는 수렴 성능이 떨어지는 문제가 발생한다. 이에 수렴 성능을 개선하기 위해 affine projection (AP) 알고리즘을 사용하고 있다. 하지만 연산량의 문제로 AP 알고리즘의 사용이 제한적이다. 이러한 사실을 바탕으로 협대역 소음 제어를 위한 능동 소음 제어 시스템에서 NLMS와 AP 알고리즘을 연산량과 수렴 성능을 비교함으로써 효과적인 알고리즘을 도출하였다. 실험을 통해 NLMS와 AP 알고리즘의 소음 제어 성능이 차이가 크게 발생하지 않는 것을 확인함으로써 NLMS가 AP 알고리즘에 비해 소음 제어에 효과적임을 확인하였다.