• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.750-758
• /
• 2013

In this paper, we introduce the low-density parity-check (LDPC) coded orthogonal frequency division multiplexing (OFDM) subframe reordering scheme for achieving equal combined power allocation in type I hybrid automatic repeat request (H-ARQ) systems and analyze the performance improvement by using the channel capacity. Also, it is confirmed that the layered decoding for subframe reordering scheme in H-ARQ systems gives faster convergence speed. It is verified from numerical analysis that a subframe reordering pattern having larger channel capacity shows better bit error rate (BER) performance. Therefore the subframe reordering pattern achieving equal combined power allocation for each subframe maximizes the channel capacity and outperforms other subframe reordering patterns. Also, it is shown that the subframe reordering scheme for achieving equal combined power allocation gives better performance than the conventional Chase combining scheme without increasing the decoding complexity.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.459-465
• /
• 2010

A new blind equalization algorithm that is based on maximizing the probability that the constant modulus errors concentrate near zero is proposed. The cost function of the proposed algorithm is to maximize the probability that the equalizer output power is equal to the constant modulus of the transmitted symbols. Two blind information-theoretic learning (ITL) algorithms based on constant modulus error signals are also introduced: One for minimizing the Euclidean probability density function distance and the other for minimizing the constant modulus error entropy. The relations between the algorithms and their characteristics are investigated, and their performance is compared and analyzed through simulations in multi-path channel environments. The proposed algorithm has a lower computational complexity and a faster convergence speed than the other ITL algorithms that are based on a constant modulus error. The error samples of the proposed blind algorithm exhibit more concentrated density functions and superior error rate performance in severe multi-path channel environments when compared with the other algorithms.

• Journal of the Korean Statistical Society
• /
• v.27 no.4
• /
• pp.485-494
• /
• 1998

In the white noise model we construct an adaptive estimate for f(0) for a decreasing function f. We also show that the maximum mean square error of this estimate attains the same rate as the minimax risk simultaneously over a range of Lipschitz classes of order less than or equal to one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8A
• /
• pp.1126-1132
• /
• 1999

In this paper, we consider the superposed 16-QAM CDMA system for subband coded (SBC) image transmissions. We divide the SBC image bit into two group according to its significance. First, we investigate the average bit error rate (BER) of the overall system when the significance of bits is ignored. Next, we investigate the optimal signal constellation and processing gain that maximizes the peak signal-to-noise ratio (PSNR) of SBC image, subject to a fixed power and bandwidth constraint. We examine the performance improvement over the conventional equal distane, equal processing gain system, and the equal error protection (EEP) system.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.2
• /
• pp.190-198
• /
• 2002

In general, we have used the Viterbi algorithm of Speech recognition for decoding. But a decoder in speaker verification has to recognize same word of every speaker differently. In this paper, we propose a noble decoding algorithm that could replace the typical Viterbi algorithm for the speaker verification system. We utilize for the proposed algorithm the speaker adaptation algorithms that transform feature vectors into the region of the client' characteristics in the speech recognition. There are many adaptation algorithms, but we take MLLR (Maximum Likelihood Linear Regression) and MAP (Maximum A-Posterior) adaptation algorithms for proposed algorithm. We could achieve improvement of performance about 30% of EER (Equal Error Rate) using proposed algorithm instead of the typical Viterbi algorithm.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.11
• /
• pp.1209-1216
• /
• 2009

This paper presents an efficient Quantized Equal Gain Transmission(QEGT) codebook index searching technique for MISO beamforming system in a Rayleigh flat fading channel. The searching time for the optimum weight vector among the codebook vectors increases exponentially when the codebook size increases linearly, although the bit error rate decreases. So, newly defined simple metric is proposed for fast searching, which determines a few candidates. Then the conventional method combined with accurate search algorithm selects the optimal index. This strategy significantly reduces the overall search time, while maintaining almost the same bit error rate performance. Furthermore, as the codebook size increases, the search time is considerably decreased compared to that of the conventional approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.337-344
• /
• 2011

In this paper, a multiple-input and multiple-output (MIMO) spatial multiplexing (SM) relay system is studied in a bit error rate (BER) sense, where every node is deployed with multiple antennas. In order to efficiently use the limited power resource, it is essential to optimally allocate the power to nodes and antennas. In this context, the power allocation (PA) algorithm based on minimum BER (MBER) for a MIMO SM relay system is proposed, which is derived by direct minimization of the average BER, and divided into inter-node and inter-antenna PA algorithm. The proposed scheme outperforms the conventional equal power allocation (EPA) algorithm without extra power consumption.

• Geomechanics and Engineering
• /
• v.13 no.4
• /
• pp.685-699
• /
• 2017

In order to determine the rate of penetrability, water pressure test is used before the grouting. One of the parameters which have the highest effect is pressure. Mathematical modeling is used for the first time in this study to determine the optimum pressure. Thus, the joints that exist in the rock mass are simulated using cylindrical shell model. The joint surroundings are also modeled through Pasternak environment. In order to validate the modeling, pressure values obtained by the model were used in the sites of Seymareh and Aghbolagh dams and the relative error rates were measured considering the differences between calculated and actual pressures recorded in these operations. In water pressure test, in Seymareh dam, the error values were equal to 4.75, 3.93, 4.8 percent and in the Aghbolagh dam, were 22.43, 5.22, 2.6 percent and in grouting operation in Seymareh dam were equal to 9.09, 32.50, 21.98, 5.57, 29.61 percent and in the Aghbolagh dam were 2.96, 5.40, 4.32 percent. Due to differences in rheological properties of water and grout and based on the overall results, modeling in water pressure test is more accurate than grouting and this error in water pressure test is 7.28 percent and in grouting is 13.92 percent.

• Journal of the Korean Statistical Society
• /
• v.35 no.2
• /
• pp.157-166
• /
• 2006

This research proposes an efficient Monte Carlo algorithm for computing error probability in high performance digital communication st stems. It characterizes special features of the problem and suggests an importance sampling algorithm specially designed to handle the problem. It uses a shifted exponential density as the importance sampling density, and shows an adaptive way of choosing the rate and the origin of the shifted exponential density. Instead of equal allocation, an intelligent allocation of the samples is proposed so that more samples are allocated to more important part of the error probability. The algorithm uses the nested feature of the error space and avoids redundancy in estimating the probability. The algorithm is applied to an example data set and shows a great improvement in accuracy of the error probability estimation.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.3
• /
• pp.589-595
• /
• 2010

In discriminant analysis, we consider an intraclass correlation pattern by principal component analysis. We assume that the two populations are equally likely and the costs of misclassification are equal. In this situation, we consider two procedures, i.e., the test and proportion procedures, for selecting the principal components in classifica-tion. We compare the regular classification method and the proposed two procedures. We consider two methods for estimating error rate, i.e., the leave-one-out method and the bootstrap method.