• International Area Studies Review
• /
• v.15 no.2
• /
• pp.101-123
• /
• 2011

The paper is basically attempted to reveal the factor price equalization(FPE) on Korea, United States, and Japan by the ARDL-bounds testing. Wage-rental ratio and relative commodity prices between Korea, United States, and Japan are analyzed by employing equality and convergence frameworks. Empirical evidences are shown that necessary and sufficient conditions for the FPE seems to be easily satisfied in a small country such as Korea rather than large ones as like United States and Japan. And, the FPE is more easily achieved by a nominal term rather than the real term. Due to the fact that an error correction term in the Error Correction Model is insignificant, direct mobility of labor and capital between the countries is not that effective to a short run adjustment. It implies that the FPE is in general going through a long run path. It also has to be mentioned that a trade policy has to selectively implemented depending on the weight of trading volumes and it has to be build up by a long run basis.

• Journal of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.475-486
• /
• 2011

The paper deals with repeated low-density burst error detecting codes with a specied weight or less. Linear codes capable of detecting such errors have been studied. Further codes capable of correcting and simultaneously detecting such errors have also been dealt with. The paper obtains lower and upper bounds on the number of parity-check digits required for such codes. An example of such a code has also been provided.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.187-196
• /
• 2003

We consider the use of error control coding in direct sequence-code-division multiple access (OS-COMA) systems that employ multiuser detection (MUO) and space diversity. The relative performance gain between Reed-Solomon (RS) code and convolutional code (CC) is well known in [1] for the single user, additive white Gaussian noise (AWGN) channel. In this case, RS codes outperform CC's at high signal-to-noise ratios. We find that this is not the case for the multiuser interference channel mentioned above. For useful error rates, we find that soft-decision CC's to be uniformly better than RS codes when used with DS-COMA modulation in multiuser space-time channels. In our development, we use the Gaussian approximation on the interference to determine performance error bounds for systems with low number of users. Then, we check their accuracy in error rate estimation via system's simulation. These performance bounds will in turn allow us to consider a large number of users where we can estimate the gain in user-capacity due to channel coding. Lastly, the use of turbo codes is considered where it is shown that they offer a coding gain of 2.5 dB relative to soft-decision CC.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.8
• /
• pp.19-26
• /
• 1993

The bit error probability of Reed-Solomon/convolutional concatenated codes can be more exactly calculated by using a more approximate bound of the symbol error probability of the convolutional codes. This paper obtains the unequal symbol error bound of the convolutional codes, and applies to the calculation of the bit error probability of the concatenated codes. Our results are tighter than the earlier studied other bounds.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.43-47
• /
• 2000

In regions of low signal-to-noise ratio (SNR), performance analysis uses simulations of hybrid concatenated coding systems. However, for higher SNR regions beyond simulation capabilities, average upper bounds to bit error rate (BER) and word error rate (WER) are used. In [1], all weight enumerating functions are needed to obtain average bounds. In this paper, we use RSC as constituent codes, by using effective free distances instead of WEF, we derive average BER and WER bounds of hybrid concatenated convolutional codes (HCCC) and analyze the BER and WER over AWGN and Rayleigh/Rician fading channels.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.2 no.2
• /
• pp.49-56
• /
• 1998

In this paper, by the use of an Ostrowski type integral inequality for double integrals, we establish an upper bound for the estimation error variance of a continuous stream with stationary variogram.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.4 no.1
• /
• pp.93-100
• /
• 2000

This paper deals with some fundamental matters pertaining to estimation of critical quantities associated with continuous processes which are frequently related to the quality rating of the product. Specifically, it examines bounds on estimation and bounds on the estimation error variance. It draws on recent results from the theory of mathematical inequalities and their applications.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.1-16
• /
• 2006

The classical perturbation theory is extended to the weighted Kronecker product linear systems $W(A{\bigotimes}B)W\chi=h$. Upper bounds are derived for the normwise condition number.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.3
• /
• pp.17-24
• /
• 2004

We present a P-type iterative learning control(ILC) scheme for uncertain robotic systems that perform the same tasks repetitively. The proposed ILC scheme comprises a linear feedback controller consisting of position error, and a feedforward and feedback teaming controller updated by current velocity error. As the learning iteration proceeds, the joint position and velocity mrs converge uniformly to zero. By adopting the learning gain dependent on the iteration number, we present joint position and velocity error bounds which converge at the arbitrarily tuned rate, and the joint position and velocity errors converge to zero in the iteration domain within the adopted error bounds. In contrast to other existing P-type ILC schemes, the proposed ILC scheme enables analysis and tuning of the convergence rate in the iteration domain by designing properly the learning gain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.958-964
• /
• 2007

In this paper, we derive the relationship between the bit error probability (BEP) of maximum a posteriori (MAP) bit detection and the bit minimum mean square error (MMSE), that is, the BEP is greater than a quarter of the bit USE and less than a half of the bit MMSE. By using this result, the lower and upper bounds of the derivative of the mutual information are derived from the BEP and the lower and upper bounds are easily obtained in the multiple-input multiple-output (MIMO) communication systems with the bit-linear linear-dispersion (BLLD) codes in the Gaussian channel.