• Title/Summary/Keyword: 비트 에러 확률

Search Result 55, Processing Time 0.028 seconds

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

  • Jeong, Tae-Il
    • 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.

A Study on the Performance Analysis of 4-ary Scaling Wavelet Shift Keying (4-ary 스케일링 웨이브릿 편이 변조 시스템의 성능 분석에 관한 연구)

  • Jeong, Tae-Il;Ryu, Tae-Kyung;Kim, Jong-Nam;Moon, Kwang-Seok;Kim, Hyun-Deok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.5
    • /
    • pp.1155-1163
    • /
    • 2010
  • An algorithm of the conventional wavelet shift keying is carried out that the scaling function and wavelet are encoded to 1(mark) and 0(space) for the input binary data, respectively. Two bit modulation technique which uses four carrier frequencies is existed. Four carrier frequencies are defined as scaling function, inversed scaling function, wavelet, and inversed wavelet, which are encoded to 10, 11, 00 and 01, respectively. In this paper, we defined 4-ary SWSK (4-ary scaling wavelet shift keying) which is two bit modulation, and it is derived to the probability of bit error and symbol error of the defined system from QPSK. In order to analyze to the performance of 4-ary SWSK, we are obtained in terms of the probability of bit error and symbol error for QPSK (quadrature phase shift keying), MFSK(M-ary frequency shift keying) and proposed method. As a results of simulation, we confirmed that the proposed method was superior to the performance in terms of the probability of bit error and symbol error.

Performance Analysis for Wavelet in 4-ary SWSK (4-ary SWSK 시스템에서 웨이브릿에 대한 성능분석)

  • Jeong, Tae-Il;Kim, Jong-Nam
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.51-53
    • /
    • 2010
  • 본 논문에서는 4-ary SWSK(4-ary scaling wavelet shift keying) 시스템에서 웨이브릿에 대한 성능을 분석코자 한다. 기존의 4-ary SWSK 시스템에서 비트 에러확률이 유도된 바 있다. 그래서 기존의 비트 에러확률과 부호 에러확률을 이용하여 Daubechies, Biorthogonal, Coiflet, Symlet 웨이브릿에 대한 비트 및 부호 에러확률을 실험적으로 구하였다. 또 웨이브릿의 탭 개수와 주기 변화에 대해서 그 성능을 분석하였다.

  • PDF

Error Resilience Coding Techniques for Mobile Videotelephony (모바일 화상통신을 위한 오류강인 부호화 기법)

  • Suh, Jae-Won
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.12
    • /
    • pp.303-310
    • /
    • 2007
  • Compressed video bitstreams are intended for real-time transmission over communication networks. Because video compression algorithms eliminate the temporal, spatial, and statistical redundancies, the coded video bitstreams are very sensitive to transmission errors. We propose an error resilient video coding technique to limit the effect of error propagation in low bit-rate video coding. The success of error resilient coding techniques relies on how accurately the transmission errors can be detected. To detect the transmission error, we propose a very simple error detection technique based on data hiding Next, we conceal the corrupted MB data using intra MB refresh and motion compensation with the estimated motion vector and compare the simulation results. This method will be useful in video communication in error Prone environment such as WCDMA networks.

A Modified BCH Code with Synchronization Capability (동기 능력을 보유한 변형된 BCH 부호)

  • Shim, Yong-Geol
    • The KIPS Transactions:PartC
    • /
    • v.11C no.1
    • /
    • pp.109-114
    • /
    • 2004
  • A new code and its decoding scheme are proposed. With this code, we can correct and detect the errors in communication systems. To limit the runlength of data 0 and augment the minimum density of data 1, a (15, 7) BCH code is modified and an overall parity bit is added. The proposed code is a (16, 7) block code which has the bit clock signal regeneration capability and high error control capability. It is proved that the runlength of data 0 is less than or equal to 7, the density of data 1 is greater than or equal to 1/8, and the minimum Hamming distance is 6. The decoding error probability, the error detection probability and the correct decoding probability are presented for the proposed code. It is shown that the proposed code has better error control capability than the conventional schemes.

Key Recovery Algorithm of Erroneous RSA Private Key Bits Using Generalized Probabilistic Measure (일반화된 확률 측도를 이용하여 에러가 있는 RSA 개인키를 복구하는 알고리즘)

  • Baek, Yoo-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.5
    • /
    • pp.1089-1097
    • /
    • 2016
  • It is well-known that, if additional information other than a plaintext-ciphertext pair is available, breaking the RSA cryptosystem may be much easier than factorizing the RSA modulus. For example, Coppersmith showed that, given the 1/2 fraction of the least or most significant bits of one of two RSA primes, the RSA modulus can be factorized in a polynomial time. More recently, Henecka et. al showed that the RSA private key of the form (p, q, d, $d_p$, $d_q$) can efficiently be recovered whenever the bits of the private key are erroneous with error rate less than 23.7%. It is notable that their algorithm is based on counting the matching bits between the candidate key bit string and the given decayed RSA private key bit string. And, extending the algorithm, this paper proposes a new RSA private key recovery algorithm using a generalized probabilistic measure for measuring the consistency between the candidate key bits and the given decayed RSA private key bits.

A Study on MPEG-4 Video Transmission on Burst Loss Environments of IMT-2000 (IMT-2000 버스트 에러 환경에서 MPEG-4 비디오 전송에 관한 연구)

  • 서덕영;홍인기;유인태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.6B
    • /
    • pp.828-839
    • /
    • 2001
  • 이동 통신 환경에서는 비트 에러가 버스트 형태로 일어난다. 본 논문은 이러한 환경에서 MPEG-4 비디오를 전송하였을 때, 영향을 분석한다. MPEG-4에서 제공되는 에러 강인성 도구들이 얼마나 효과적인가를 에러의 버스트 정도에 따라 얼마나 효과적인가를 확률론적으로 해석하고, 컴퓨터 시뮬레이션 결과와 비교 분석한다. 이 분석 결과에 따라 버스트 에러의 정도에 따라 에러 강인성 도구들을 효과적으로 운용하는 방법을 정량적으로 제시한다.

  • PDF

The Bit Synchronizer of the Frequency Hopping System using The Error Symbol Detector (에러 심볼 검출기를 이용한 주파수 도약용 비트 동기방식)

  • Kim, Jung-Sup;Hwang, Chan-Sik
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.7
    • /
    • pp.9-15
    • /
    • 1999
  • In this paper, we propose a bit synchronizer which is suitable for frequency hopping systems. The proposed bit synchronizer is an ADPLL in which the digital loop filter is combined with an error symbol detecting circuit. Suppressing the tracking process, when hop mute and impulse noises are detected, improves the performance of the digital loop filter and enhances the probability of the frequency hopping system. Simulation results demonstrate an improved performance of the proposed bit synchronizer compared with existing ones.

  • PDF

A Study on Optimize Access of Multiple Communication Network (다중통신망의 최적접속에 관한 연구)

  • 이관형
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.7
    • /
    • pp.937-942
    • /
    • 2002
  • In this paper, using diversity the DS-CDMA system to modulation, performance of DS/CDMA system we have been analyzed. Channels is multipath resolution, and receiver is assemed maximal ratio combining(MRC) using to rake receiver. Simulations have been using element number of communication channels. Therefore, progress average bit error probability have been element number of increment.

  • PDF

A Study on Received Sensitivity of Optical Preamplifier (광전치증폭기의 수신감도에 관한 연구)

  • Kim, Sun-Youb;Park, Hyung-Geun
    • Proceedings of the KAIS Fall Conference
    • /
    • 2008.11a
    • /
    • pp.219-222
    • /
    • 2008
  • 본 논문에서는 WDM시스템에서 사용될 수 있는 광전치증폭기의 수신감도를 해석하였다. $10^{-9}$의 에러확률에 대하여 FSK전송을 이용하여 비트당 광자수를 계산하여다. 결과로 일반적인 PIN 수신기의 수신감도는 $9.2{\times}10^4$ photon/bit이고, 광전치증폭수신기의 경우는 $7{\times}10^2$의 phton/bit를 갖음을 확인하였다. 또한 FSK전송의 경우에는 표준에러확률인 $10^{-9}$을 유지하기 위해 필요로 하는 비트당 광자의 수를 계산하였는데, 가우시안 근사해석법을 사용한 경우와 정확한 해석법(k자승법)을 이용한 결과 m=30인 경우 k자승법의 경우는 $2.36{\times}10^2$ photon/bit, 가우시안 근사법의 경우에는 $4.01{\times}10^2$ photon/bit을 얻었다. 이를 통해 동일한 BER의 경우에 광전치증폭수신기가 PIN수신기에 비해 우수함을 확인하였다.

  • PDF