• Journal of Power Electronics
• /
• 제17권5호
• /
• pp.1160-1172
• /
• 2017

A novel space vector modulation strategy in the non-orthogonal three-dimensional coordinate system for multi-level three-phase four-wire inverters is proposed in this paper. This new non-orthogonal three-dimensional space vector modulation converts original trigonometric functions in the orthogonal three-dimensional space coordinate into simple algebraic operations, which greatly reduces the algorithm complexity of three-dimensional space vector modulation and preserves the independent control of the zero-sequence component. Experimental results have verified the correctness and effectiveness of the proposed three-dimensional space vector modulation in the new non-orthogonal three-dimensional coordinate system.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집C
• /
• pp.408-413
• /
• 2001

The structural optimization is carried out in the continuous design space or discrete design space. Methods for discrete variables such as genetic algorithms are extremely expensive in computational cost. In this research, an iterative optimization algorithm using orthogonal arrays is developed for design in discrete space. An orthogonal array is selected on a discrete design space and levels are selected from candidate values. Matrix experiments with the orthogonal array are conducted. New results of matrix experiments are obtained with penalty functions for constraints. A new design is determined from analysis of means(ANOM). An orthogonal array is defined around the new values and matrix experiments are conducted. The final optimum design is found from iterative process. The suggested algorithm has been applied to various problems such as truss and frame type structures. The results are compared with those from a genetic algorithm and discussed.

• Nonlinear Functional Analysis and Applications
• /
• 제26권5호
• /
• pp.903-915
• /
• 2021

In this paper, we introduce the concepts of an orthogonal generalized F-contraction mapping and prove some fixed point theorems for a self mapping in an orthogonal metric space. The given results are generalization and extension some of the well-known results in the literature. An example to support our result is presented.

• 대한기계학회논문집A
• /
• 제25권10호
• /
• pp.1621-1626
• /
• 2001

The structural optimization have been carried out in the continuous design space or in the discrete design space. Methods fur discrete variables such as genetic algorithms , are extremely expensive in computational cost. In this research, an iterative optimization algorithm using orthogonal arrays is developed for design in discrete space. An orthogonal array is selected on a discrete des inn space and levels are selected from candidate values. Matrix experiments with the orthogonal array are conducted. New results of matrix experiments are obtained with penalty functions leer constraints. A new design is determined from analysis of means(ANOM). An orthogonal array is defined around the new values and matrix experiments are conducted. The final optimum design is found from iterative process. The suggested algorithm has been applied to various problems such as truss and frame type structures. The results are compared with those from a genetic algorithm and discussed.

• 한국ITS학회 논문지
• /
• 제9권1호
• /
• pp.34-41
• /
• 2010

본 논문에서는 복조후 전송 (DF: Decode-and-Forward) 중계기를 사용하는 협력통신 (Cooperative Communication) 시스템에서 동일 채널로 전송된 다른 신호에 의해 단말기에 발생할 수 있는 간섭 완화 방법에 대해 분석하고 실험하였다. 간섭완화 방법은 동일 채널로 전송할 신호를 직교 부호를 이용하여 부호화한 후 전송하면, 수신기는 미리 알고 있는 직교 부호를 이용하여 자신이 원하는 신호만 수신하는 것이다. 본 논문에서 이용한 직교 부호는 직교 골드 부호 (Orthogonal Gold Code) 를 이용하였다. 하지만 직교 골드 부호 이외에 직교 성질을 가지는 다른 부호를 직교 부호로 사용할 수 있다. 또한 추가적인 배열 이득으로 인해 시스템 성능을 향상시키기 위해 시공간 블록 부호화 (STBC : Space Time Block Coding) 개념을 적용하였다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2004년도 추계학술대회
• /
• pp.858-863
• /
• 2004

In the optimized design of an actual structure, the design variable should be selected among any certain values or corresponds to a discrete design variable that needs to handle the size of a pre-formatted part. Various algorithms have been developed for discrete design. As recently reported, the sequential algorithm with orthogonal arrays(SOA), which is a local minimum search algorithm in discrete space, has excellent local minimum search ability. It reduces the number of function evaluation using orthogonal arrays. However it only finds a local minimum and the final solution depends on the initial value. In this research, the genetic algorithm, which defines an initial population with the potential solution in a global space, is adopted in SOA. The new algorithm, sequential algorithm with orthogonal arrays and genetic algorithm(SOAGA), can find a global solution with the properties of genetic algorithm and the solution is found rapidly with the characteristics of SOA.

• 한국통신학회논문지
• /
• 제33권4A호
• /
• pp.426-433
• /
• 2008

In this paper, we present a method to improve the performance of the four transmit antenna quasi-orthogonal space-time block code (STBC) in the coded system. For the four transmit antenna case, the quasi-orthogonal STBC consists of two symbol groups which are orthogonal to each other, but intra group symbols are not. In uncoded system with the matched filter detection, constellation rotation can improve the performance. However, in coded systems, its gain is absorbed by the coding gain especially for lower rate code. We propose an iterative decoding method to improve the performance of quasi-orthogonal codes in coded systems. With conventional quasi-orthogonal STBC detection, the joint ML detection can be improved by iterative processing between the demapper and the decoder. Simulation results shows that the performance improvement is about 2dB at 1% frame error rate.

• Journal of Communications and Networks
• /
• 제5권2호
• /
• pp.124-134
• /
• 2003

In this paper, we investigate the error probability performance of noncoherently detected orthogonal modulation combined with Alamouti space-time block coding. We find that there are two types of pair-wise error probabilities that characterize the performance. We employ methods that allow a direct evaluation of exact, closed-form expressions for these error probabilities. Theoretical as well as numerical results show that noncoherent orthogonal modulation combined with space-time block coding (STBC) achieves full spatial diversity. We derive an expression for approximate average bit error probability for-ary orthogonal signaling that allows one to show the tradeoff between increased rate and performance degradation.

• 대한전자공학회논문지TC
• /
• 제46권3호
• /
• pp.15-18
• /
• 2009

본 논문에서는 수신기에서 채널 추정을 필요로 하지 않는 MWSK (M-ary orthogonal Walsh sequence keying)를 적용한 ST-MWSK (space-time MWSK)를 제안한다. ST-MWSK의 noncoherent ML (maximum-likelihood) 검출기의 계산 복잡도는 기존의 ST-FSK (ST frequency-shift keying) 방식에 비해 크게 줄어든다. 또한 ST-MWSK는 ST-FSK와 거의 동일한 성능을 나타낸다.

• 대한전자공학회논문지TC
• /
• 제45권3호
• /
• pp.40-45
• /
• 2008

본 논문은 MIMO 시스템에서, 최대 전송률을 유지하면서 최대 다이버시티를 갖는 준직교 시공간 블록 부호 (QO-STBC : quasi orthogonal space time block codes)를 다차원 신호 공간에서 설계한다. QO-STBC 부호기 중 원형심볼(based-symbols)을 두 개의 신호 쌍으로 묶어서 변형된 새로운 신호를 전송하는 방식을 grouping QO-STBC 라고 한다. 이러한 grouping QO-STBC의 최대 다이버시티 조건을 기하학적으로 살펴보고, 다차원 신호 공간에서 신호를 설계하는 방법을 제안한다. 또한 다양한 신호 성상에 대하여 설계한 부호기의 성능을 분석하고 전산 모의실험을 통하여 성능분석의 타당성을 입증한다.