• 제목/요약/키워드: Probability of Error

검색결과 1,360건 처리시간 0.026초

4-ary SWSK 시스템에서 웨이브릿에 대한 비트 에러 확률에 관한 연구 (A Study on Probability of Bit Error for Wavelet in 4-ary SWSK System)

  • 정태일
    • 한국정보통신학회논문지
    • /
    • 제15권1호
    • /
    • pp.57-62
    • /
    • 2011
  • 본 논문은 4-ary SWSK(4-ary scaling wavelet shift keying) 시스템에서 여러 가지 웨이브릿 종류에 대하여 비트 에러 확률에 대한 성능을 연구하고자 한다. 기존의 4-ary SWSK 시스템에서 비트 에러 확률이 유도된 바 있다. 그래서 기존의 비트 에러 확률을 이용하여 Daubechies, Biorthogonal, Coiflet, Symlet 웨이브릿에 대한 비트 에러 확률을 실험적으로 구하였다. 또 웨이브릿의 탭 개수와 주기 변화에 대해서 그 성능을 분석하였다. 실험결과 4-ary SWSK 시스템에서 Coiflet, Symlet 웨이브릿이 비트 에러 확률면에서 좋은 성능을 보였고, 두 웨이브릿의 성능은 비슷하였음을 확인하였다.

검정에 관한 퍼지 검정력 함수의 성질 (The Fuzzy Power Function of a Test)

  • 강만기;정지영;박영례;최규탁
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국지능시스템학회 2007년도 추계학술대회 학술발표 논문집
    • /
    • 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.

  • PDF

라이시안 감쇄 채널에서의 위상오류 분포 (On the Distribution of Phase Error in the Rician Fading Channel)

  • 김민종;한영열
    • 한국전자파학회논문지
    • /
    • 제13권8호
    • /
    • pp.797-803
    • /
    • 2002
  • 본 논문에서는 라이시안(Rician) 감쇄가 존재하는 채널 환경에서 협대역 잡음이 더하여진 경우에 대역 여파기를 통과한 수신신호의 위상오류에 대한 확률 밀도 함수를 유도하고 0차 모먼트가 1이 됨을 보임으로써 확률밀도 함수로서의 타당성을 검증한다. 일반적으로 감쇄 환경에서 시스템의 오류 확률은 먼저 가산성 백색 가우시안 잡음(AWGN : Additive White Gaussian Noise)만이 존재할 때의 오류 확률을 구한 후, 그 결과 식을 해당 감쇄에 대한 확률 밀도 함수로 평균을 취하여 구한다. 하지만 본 논문에서는 감쇄 환경에서의 수신 신호에 대한 위상 오류식을 구한 다음, 그 식을 한번의 이중 적분을 취함으로써 오류 확률을 구하게 된다.

Maximization of Zero-Error Probability for Adaptive Channel Equalization

  • Kim, Nam-Yong;Jeong, Kyu-Hwa;Yang, Liuqing
    • Journal of Communications and Networks
    • /
    • 제12권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.

Reed-Solomon/Trellis 연접 부호변조 시스템의 비트오율 해석 (An Analysis of Bit Error Probability of Reed-Solomon/Trellis concatenated Coded-Modulation System)

  • 김형락;이상곤;문상재
    • 전자공학회논문지A
    • /
    • 제31A권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.

  • PDF

Reed-Solomon/길쌈 연쇄부호의 비트오율해석 (An Analysis of Bit Error Probability of Reed-Solomon/Convolutional Concatenated Codes)

  • 이상곤;문상재
    • 전자공학회논문지A
    • /
    • 제30A권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.

  • PDF

Blind Algorithms with Decision Feedback based on Zero-Error Probability for Constant Modulus Errors

  • 김남용;강성진
    • 한국통신학회논문지
    • /
    • 제36권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.

Exact Bit Error Probability of Orthogonal Space-Time Block Codes with Quadrature Amplitude Modulation

  • Kim, Sang-Hyo;Yang, Jae-Dong;No, Jong-Seon
    • Journal of Communications and Networks
    • /
    • 제10권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.

비-가우시안 잡음하의 적응 시스템을 위한 바이어스된 영-오차확률 (Biased Zero-Error Probability for Adaptive Systems under Non-Gaussian Noise)

  • 김남용
    • 인터넷정보학회논문지
    • /
    • 제14권1호
    • /
    • pp.9-14
    • /
    • 2013
  • 영-오차확률 성능 기준은 오차 샘플들이 직류 바이어스 잡음의 영향을 받을 때 적응 시스템에 사용되기에는 제약이 따른다. 이 논문에서는 바이어스 변수를 오차 분포에 도입하고 바이어스된 오차확률에서 오차를 0 으로 하여 새로운 성능 기준인 바이어스된 영-오차확률을 제안하였다. 또한, 확장 필터 구조를 기반으로 제안된 성능 기준을 최대화 함으로써 적응 알고리듬을 도출하였다. 통신 채널 등화에 대한 시뮬레이션 결과로부터 제안된 성능기준에 기반한 이 알고리듬이 강한 충격성 잡음과 직류-바이어스 잡음의 환경에서 동요 없이 오차 샘플들을 0 으로 집중시키는 성능을 보였다.

Effect of Microdiversity and Macrodiversity on Average Bit Error Probability in Gamma-Shadowed Rician Fading Channels

  • Milenkovic, Vladeta Vasilije;Sekulovic, Nikola Milos;Stefanovic, Mihajlo Caslav;Petrovic, Mile Branko
    • ETRI Journal
    • /
    • 제32권3호
    • /
    • pp.464-467
    • /
    • 2010
  • In this letter, we analyze the error performance of a mobile communication system with microdiversity and macrodiversity reception in gamma-shadowed Rician fading channels for a binary differential phase-shift keying modulation scheme. Analytical expressions for the probability density function (PDF) and moment-generating function (MGF) are derived. The average bit error probability can be calculated by averaging the conditional bit error probability over the PDF or using the MGF-based approach. Numerical results are graphically presented to show the effects of macrodiversity, correlation, number of diversity branches, and severity of both fading and shadowing.