• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.79-85
• /
• 2008

Dirty Paper Coding(DPC) can achieve the sum capacity of a multiuser multiple-input multiple-output(MU MIMO) broadcast channels. However, due to the high computational complexity of the successive encoding and decoding, deploying DPC in real systems is impractical. As one of practical alternatives to DPC, Block Diagonalization(BD) was researched. BD is an extension of the zero-forcing preceding technique that eliminates interuser interference(IUI) in downlink MIMO systems. Though BD has lower complexity than DPC, BD shows poor sum capacity performance. We show that sum capacity performance of BD is degraded due to no IUI constraint. Then, we modify BD to improve its sum capacity performance with relaxing the constraint and sub optimal channel set searching. With simulation results, it can be verified that our modification in BD induces some improvement in sum capacity performance.

• Journal of KIISE:Software and Applications
• /
• v.27 no.4
• /
• pp.342-356
• /
• 2000

We present a static analysis method to automatically generate test data that raise exceptions in input programs. Using the test data from our analysis, a programmer can check whether the raised exceptions are correctly handled with respect to the program's specification. For a given program, starting from the initial constraint that a particular raise expression should be executed, our analysis derives necessary constraints for its input variable. Correctness of our analysis assures that any value that satisfies the derived constraints for the input variable will activate the designated raise expression. In this paper, we formally present such an analysis for a first-order language with the ML-style exception handling constructs and algebraic data values, prove its correctness, and show a set of examples.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.9
• /
• pp.801-806
• /
• 2015

In this paper, we propose cascade-form velocity controller for a permanent magnet synchronous motor (PMSM). The proposed controller consists of a sliding-mode controller (SMC) for the inner current control loop and a model-predictive controller (MPC) for the outer velocity control loop. With SMC, we can ensure that the current tracking error always converges to zero in finite time. The SMC is designed to track the desired currents. Additionally, with MPC, we can obtain the optimal velocity control input which minimizes the cost function. Constraint conditions for input and input variation are included in the MPC design. The simulation results are included to validate the performance of the proposed controller.

• Proceedings of the Korean Radioactive Waste Society Conference
• /
• 2005.11b
• /
• pp.280-289
• /
• 2005

A pyrochemical process has been introduced and utilized so that the transmutation of spent PWR fuel in PEACER can produce mainly low and intermediate level waste for near surface disposal. Major radioactive nuclides from PEACER pyroprocessing are composed of TRU and LLFP. In this study, the requirement for the final waste from PEACER is evaluated based on the methodology for establishment of waste acceptance criteria. Also, sensitivity analysis for several input parameters is conducted in order to determine acceptable decontamination factor (DF) and LLFP removal efficiency and to find out input parameter that extremely have an effect on DE As a result of the study, LLFP removal efficiency, especially Sr-90 and Tc-99, is proved to be a major nuclide which contributes to annual dose by human intrusion scenario rather than TRU DF. More than $98.5\%$ of LLFP have to be removed to meet below dose constraint within the DF more than 5.0E+03. Besides, because of the relative short half-life of Sr-90, the increasing of the institutional control period is recommended for most important input parameter to determine DF.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.112-117
• /
• 2007

In this paper, we focus on the total transmission power minimization problem for downlink beamforming multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems while ensuring each user's QoS requirement. Although the linear integer programming (LIP) solution we formulate provides the performance upper bound of the margin adaptive (MA) optimization problem, it is hard to be implemented in practice due to its high computational complexity. By regarding each user's equivalent channel gain as approximate independent values and using iterative descent method, we present a heuristic MA resource allocation algorithm. Simulation results show that the proposed algorithm efficiently converges to the local optimum, which is very close to the performance of the optimal LIP solution. Compared with existing space division multiple access (SDMA) OFDM systems with or without adaptive resource allocation, the proposed algorithm achieves significant performance improvement by exploiting the frequency diversity and multi-user diversity in downlink multiple-input single-output (MISO) OFDM systems.

• Journal of Korea Water Resources Association
• /
• v.33 no.5
• /
• pp.647-658
• /
• 2000

The purpose of this study is to estimate the forward impact of water supply bottleneck using a supply-side input-output model. The failure cost analysed in this study can be used to estimate the values of the water supply reliability and can provide the bases of policy decision for the effective reallocation when water supply constraint will occur. So the position of water supply in the national economy is identified, and direct and indirect impacts are estimated by means of the interindustry analysis. Also the failure cost index is suggested to determine the prior order of water supply important in drought. By the way, the occurrence of drought having regional properties, the failure cost of the regional level using a national input-output table may be overestimated or underestimated. For the preceding reason, the failure cost estimated by a national input-output table is compared with and analysed to a regional input-output table for Kyung- Nam.g- Nam.

• Journal of KIISE:Software and Applications
• /
• v.37 no.7
• /
• pp.584-589
• /
• 2010

The dynamic time warping algorithm generally used in time series pattern recognition spends most of the time in generating the correlation table, and it establishes the global path constraint to reduce the corresponding time complexity. However, the constraint restrains just in terms of the time axis, not considering the contents of input patterns. In this paper, we therefore propose an efficient branch and bound dynamic time warping algorithm which sets the global constraints by adaptively reflecting the patterns. The experimental results show that the proposed method outperforms conventional methods in terms of the speed and accuracy.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.3
• /
• pp.169-180
• /
• 2013

The modification of conditional Fuzzy C-Means (CFCM) with Gaussian weights (CFCM_GW) is accomplished for blind equalization of channels in this paper. The proposed CFCM_GW can deal with both of linear and nonlinear channels, because it searches for the optimal desired states of an unknown channel in a direct manner, which is not dependent on the type of channel structure. In the search procedure of CFCM_GW, the Bayesian likelihood fitness function, the Gaussian weighted partition matrix and the conditional constraint are exploited. Especially, in contrast to the common Euclidean distance in conventional Fuzzy C-Means(FCM), the Gaussian weighted partition matrix and the conditional constraint in the proposed CFCM_GW make it more robust to the heavy noise communication environment. The selected channel states by CFCM_GW are always close to the optimal set of a channel even when the additive white Gaussian noise (AWGN) is heavily corrupted. These given channel states are utilized as the input of the Bayesian equalizer to reconstruct transmitted symbols. The simulation studies demonstrate that the performance of the proposed method is relatively superior to those of the existing conventional FCM based approaches in terms of accuracy and speed.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.103-108
• /
• 2016

In communication systems the solution of the problem of maximizing the mutual information between the input and output of a channel composed of several subchannels under total power constraint has a waterfilling structure. OFDM and MIMO can be decomposed into parallel subchannels with CSI. Waterfilling solves the problem of optimal power allocation to these subchannels to achieve the rate approaching the channel capacity under total power constraint. In waterfilling, more power is alloted to good channels(high SNR) and less or no power to bad channels to increase the rate of good channels, resulting in channel capacity. Waterfilling finds the exact water level satisfying the power constraint employing an iterative algorithm to estimate and update the water level. In this process computation of partial sums of inverse of square of subchannel gain is repeatedly required. In this paper we reduced the computation time of waterfilling algorithm by replacing the partial sum computation with reference to an array which contains the precomputed partial sums in initialization phase.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1304-1319
• /
• 2004

We can significantly reduce the cost o# program testing by automating the process of test data generation. Test data generation usually concerns identifying input values on which a selected path is executed. Although lots of research has been done so far, there still remains a lot of issues to be addressed. One of the issues is the shape problem. The shape problem refers to the problem of figuring out a shape of the input data structure required to cause the traversal of a given path. In this paper, we introduce a new method for the shape problem. The method converts the selected path into static single assignment (SSA) form without pointer dereferences. This allows us to consider each statement in the selected path as a constraint involving equality or inequality. We solve the constraints to get a solution which will be represented in terms of the points-to relations for each input variable. Simple, but illustrative examples are given to explain the proposed method.