• Journal of Power Electronics
• /
• v.17 no.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.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• 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
• /
• v.26 no.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.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.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.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.1
• /
• pp.34-41
• /
• 2010

In this paper, we analyze and simulate co-channel interference (CCI) mitigation method for cooperative communication systems employing decode-and-forward relays. In co-channel interference mitigation method, A source transmits signals that are encoded by orthogonal code. Then, the receiver can distinguish its own signals form the received signals by using the orthogonal code which is already known to the receiver. The orthogonal codes applied to this paper are orthogonal Gold codes. However, we can employ other codes, which have orthogonality, as the orthogonal code. In addition, we utilize a space time block coding (STBC) scheme for enhancing the system performance by obtaining additional array gain.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.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
• /
• v.5 no.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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.3
• /
• pp.15-18
• /
• 2009

In this paper, we propose ST-MWSK (space-time M-ary orthogonal Walsh sequence keying) employing MWSK which does not require channel estimation at the receiver. The computational complexity for the noncoherent ML (maximum-likelihood) detector of ST-MWSK is significantly reduced compared to that of ST-FSK (ST frequency-shift keying). Also, the performance of ST-MWSK is virtually identical to that of ST-FSK.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.3
• /
• pp.40-45
• /
• 2008

This paper proposes the signal design techniques of quasi-orthogonal space time block codes (QO-STBCS) on the multi-dimensional signal space. In the multiple antenna system(MIMO), QO-STBC achieves the full-diversity and full-rate by grouping two based-symbols. We study the condition for the full-diversity of the grouping QO-STBC geometrically and the performance analysis of codes on the multi-dimensional signal space regarding the various signal constellations. Simulation results show that the way of the performance analysis is validity.