• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.12A
• /
• pp.1787-1795
• /
• 2000

이 논문에서는 레일레이 감쇄 채널에서 타이밍 또는 위상 오류를 갖는 혼합 간섭 제거 기법을 이용한 DS/CDMA 시스템의 평균 비트 오류 확률을 분석한다. 유도한 결과를 타이밍 또는 위상 오류를 갖는 일반 상관 수신기의 평균 비트 오류 확률과 비교 분석한다. 평균 비트 오류 확률은 정규 근사법을 이용하여 유도하며, 칩 시간에 대한 타이밍 오류의 비, 위상 오류의 정도, Eb/No에 따라 혼합 간섭 제거 기법을 이용한 수신기의 성능을 분석한다. 혼합 간섭 제거 기법을 이용한 수신기의 평균 비트 오류 확률은 타이밍 또는 위상 오류에 의해 증가하나 타이밍 또는 위상 오류가 작은 경우 오류가 없는 일반 상관 수신기에 비해 성능이 크게 개선된다.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.629-637
• /
• 2013

Chaos communication systems have the characteristics such as non-periodic, wide-band, non-predictability of signals and easy implementation. There have been many studies about chaos communication systems because of these advantages. But, chaos communication systems have low BER(Bit Error Rate) compare to general digital communication system. Existing researches on chaos communication systems only analyze BER performance according to various chaos maps. There are no studies on analysis of BER performance according to PDF(Probability Density Function) of chaos maps. In this paper, we analyze the BER performance according to changing parameter, equation, and initial values of chaos map's PDF. In addition, we propose new chaos map to improve BER performance. Simulation results show that BER performance of CDSK(Correlation Delay Shift Keying) is changed when PDF of chaos map changed. And the proposed chaos map has a better BER performance compare to previous chaos maps such as Tent map, Logistic map, and Henon map.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.2
• /
• pp.1-5
• /
• 2002

In this paper, a concatenated turbo and BCH coding is proposed for the wireless ATM cell transmission and the bit error rate(BER) and the cell loss ratio(CLR) for the Nosed system is obtained. Turbo code with code rate of 1/2 and BCH code with error correction capability of 5 and 15 bits are used in the simulations. It is shown that the proposed system obtained about 0.2 and 0.4 ㏈ gain over the conventional Turbo code at bit error rate of 0.001. Also the proposed system obtained about 0.1 and 0.2 ㏈ gain over the conventional Turbo code at cell loss rate of 0.01.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.8A
• /
• pp.1322-1328
• /
• 2001

본 논문에서는 무선 ATM 환경에서 터보코딩을 이용한 UEP(Unequal Error Protection)을 제안한다. 일반적으로 ATM셀의 header 부분은 payload 부분보다 중요시되며 header 부분에 payload 보다 부호율이 낮은 터보코드를 무선 ATM 적용하여 비트오류확률과 셀손실 확률을 구하였다. 무선 ATM 환경에서 터보코드를 사용하고 프레임길이 28바이트의 DLC 셀구조에서 UEP가 가능함을 보였다. 부호율 1/3인 터보 코딩을 이용한 경우 동일한 부호율의 컨벌루션 코드를 이용한 EEP(Equal Error Protection)과 비교하여 비트 오류확률과 셀 손실율에 있어서 최소 1dB와 2dB 신호대잡음비의 개선을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.1080-1089
• /
• 1999

The union upper bounds to the bit error probability of maximum likelihood(ML) soft-decoding of parallel concatenated convolutional codes(PCCC) and serially concatenated convolutional codes(SCCC) can be evaluated through the weight enumerating function(WEF). This union upper bounds become the lower bounds of the BER achievable when iterative decoding is used. In this paper, to compute the WEF, an efficient error event search algorithm which is a combination of stack algorithm and bidirectional search algorithm is proposed. By computor simulation, it is shown that the union boounds obtained by using the proposed algorithm become the lower bounds to BER of concatenated convolutional codes with iterative decoding.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.2
• /
• pp.1-8
• /
• 1990

The unequal bit-error control of rate r=b/n binary convolutional code is analyzed. The error protection afforded to each digit of the viterbi decoded b-tuple information word can be different from that afforded to other digit. The property of the unequal protection can be applied for improvement of SNR in transmitting sampled data of DPCM system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.3
• /
• pp.260-267
• /
• 1992

In this paper, the performance of frequency hopped(FH) M-ary frequency shift keyed(MFSK)system is analyzed with the fading channel and the multione famming. In general, the performance degradation of FH/MFSK system is due to the Rayleigh fading and the multitone jamming environment. In order to improve the system performance. the time diversity is used. When the time diversity is applied to the Rayleigh fading and the mulitone jamming, we get around 18dB and 19dB improvements. respectively. And when it is applied to both the Rayleigh fading and the multitone jamming, we get around 4 dB improvement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.10
• /
• pp.1100-1108
• /
• 1992

The evaluation of coded error probabilities for antijam communication systems is usually difficult to do and, thus, easy-to-evaluate upper bounds are used. Since it is relatively easy to evaluate the cutoff rate for the coding channel, the coded bit error bounds for most antijam systems of interest can be easily expressed directly in terms of this cutoff rate parameter using the relationship between the bit error bounds and cutoff rate for AWGN channel. The key feature of these bounds is the decoupling of the coding aspects of the system from the remaining part of the communication system which includes jamming, suboptimum detectors, and arbitrary decoding metrics which may or may not use jammer state knowledge. In this paper the bit error bounds for the Trumpis coded FH/MFSK with an AWGN channel are translated into the corresponding bit error bounds for boradband and partial band noise jammer. And the impact of the side information about jammer state is also evaluated with these upper bounds. Although it is considered for the soft decision detector, it is also applicable to the hard decision detector.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.10 no.7
• /
• pp.1074-1084
• /
• 1999

In this paper the bit error probability of noncoherent M-ary FSK system is derived from the probability density function of the envelope of the received signal over a frequency-nonselective slowly m-distributed Nakagami fading channel. Also, the performance of coherent M-ray FSK system is theoretically analyzed, using union bound over the similar fading channel. Then we compare uncoded performance results for M-ary FSK and DPSK signals in Nakagami fading channel.