• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.57-62
• /
• 2011

This paper presents a study on the performance analysis on probability of bit error for wavelet in 4-ary SWSK system. The formula for the bit error probability in 4-ary SWSK system was derived from the conventional method. This paper experimentally implements the probability of bit error for Daubechies, Biorthogonal, Coiflet and Symlet wavelet using the conventional formula of bit error probability. Additionally, the performance of bit error probability is analyzed for the period and the number of wavelet taps. Based on the results, we confirmed that the performance of Coiflet and Symlet wavelet for the probability of bit error is superior to the other wavelet, and their probability of bit error are similar.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.183-186
• /
• 2007

We introduction some properties for fuzzy power function of performance of a test. First we define fuzzy type I error and type II error for the probability of the two types of error. And we show that an fuzzy error probability of one kind can only be reduced at cost of increasing the other fuzzy error probability.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.8
• /
• pp.797-803
• /
• 2002

In this paper we derive the probability density function of the phase error of the received signal over Rician fading channel and verify its propriety as the probability density function using the zeroth moment. In general, for the error probability over fading channel we compute the error probability in the first place when it is only AWGN, and then we get the final result by averaging the first result and the probability density function of the corresponding fading channel. In this paper, however, we compute the error probability by double integration after the probability density function over fading channel is computed.

• 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 Institute of Telematics and Electronics A
• /
• v.31A no.9
• /
• pp.34-43
• /
• 1994

The unequal symbol error probability of TCM(trellis coded modulation) is analyzed and applied to the derivation of bit error probability of /RS/Trellis concatenated coded-modulation system. An upper bound of the symbol error probability of TCM concatenated with RS code is obtained by exploiting the unequal symbol error probability of TCM, and it is applied to the derivation of the upper bound of the bit error probability of the RS/Trellis concatenated coded-modulation system. Our upper bounds of the concatenated codes are tighter than the earlier established other upper bounds.

• 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.36 no.12C
• /
• pp.753-758
• /
• 2011

The constant modulus algorithm (CMA) widely used in blind equalization applications minimizes the averaged power of constant modulus error (CME) defined as the difference between an instant output power and a constant modulus. In this paper, a decision feedback version of the linear blind algorithm based on maximization of the zero-error probability for CME is proposed. The Gaussian kernel of the maximum zero-error criterion is analyzed to have the property to cut out excessive CMEs that may be induced from severely distorted channel characteristics. Decision feedback approach to the maximum zero-error criterion for CME is developed based on the characteristic that the Gaussian kernel suppresses the outliers and this prevents error propagation to some extent. Compared to the linear algorithm based on maximum zero-error probability for CME in the simulation of blind equalization environments, the proposed decision feedback version has superior performance enhancement particularly in cases of severe channel distortions.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.253-257
• /
• 2008

In this paper, the performance of generic orthogonal space-time block codes (OSTBCs) introduced by Alamouti [2], Tarokh [3], and Su and Xia [11] is analyzed. We first define one-dimensional component symbol error function (ODSEF) from the exact expression of the pairwise error probability of an OSTBC. Utilizing the ODSEF and the bit error probability (BEP) expression for quadrature amplitude modulation (QAM) introduced by Cho and Yoon [9], the exact closed-form expressions for the BEP of linear OSTBCs with QAM in quasi-static Rayleigh fading channel are derived. We also derive the exact closed-form of the BEP for some OSTBCs which have at least one message symbol transmitted with unequal power via all transmit antennas.

• Journal of Internet Computing and Services
• /
• v.14 no.1
• /
• pp.9-14
• /
• 2013

The criterion of zero-error probability provides a limitation on error probability functions being used for adaptive systems when the error samples are shifted by the influence of DC-bias noise. In this paper, we employ a bias term in the error distribution and propose a new criterion of the biased zero-error probability with error being zero. Also, by maximizing the proposed criterion on expanded filter structures, a supervised adaptive algorithm has been derived. From the simulation results of supervised equalization, the algorithm based on the proposed criterion yielded zero-centered and highly concentrated error samples without disturbance in the environments of strong impulsive and DC-bias noise.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.301-304
• /
• 2014

This paper proposes accurate interference probability and bit error rate formulas for cognitive relay networks with underlay spectrum sharing and channel estimation error (CEE). Numerous results reveal that the CEE not only degrades the performance of secondary systems (SSs) but also increases interference power caused by SSs to primary systems (PSs), eventually unfavorable to both systems. A solution to further protect PSs from this effect through reducing the power of secondary transmitters is investigated and analyzed.