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

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

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.3
• /
• pp.128-134
• /
• 2002

In this paper, the performance on the PN code acquisition of DS/CDMA system was analyzed using the Nakagami-m probability density function considered fading environment. The equations on detection probability, $P_D$ and false alarm probability, $P_{FA}$, decision variables affecting the PN code acquisition time were derived and proved using simulation in order to analyze the performance. In conclusion, It was necessary increasing the gain of PLL for correcting phase errors and improving the acquisition performance of PN code in apply to the rake receiver.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.75-80
• /
• 2004

An iterative soft-decision decoding algorithm of block codes is proposed. With careful examinations of the first hard-decision decoding result, the candidate codewords are efficiently searched for. An approach to reducing decoding complexity and lowering error probability is to select a small number of candidate codewords. With high probability, we include the codewords which are at the short distance from the received signal. The decoder then computes the distance to each of the candidate codewords and selects the codeword which is the closest. We can search for the candidate codewords which make the error patterns contain the bits with small reliability values. Also, we can reduce the cases that we select the same candidate codeword already searched for. Computer simulation results are presented for (23,12) Golay code. They show that decoding complexity is considerably reduced and the block error probability is lowered.

• 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 웨이브릿에 대한 비트 및 부호 에러확률을 실험적으로 구하였다. 또 웨이브릿의 탭 개수와 주기 변화에 대해서 그 성능을 분석하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.730-738
• /
• 1992

This paper alms to analyse the performance of frequency hopping /spread spectrum multiple access system by employing the channel with mixture of AWGN, partial band Jamming, fading and user interference. The performance analysis of FH /SSMA system, taking account of frequency 'hit'(user Interference ) which occurs in the presence of multiple user, produces the following numerical results by computing error probability and throughput of each code in two cases whether the side Information about channel is used or not. The numerical results are as follows : When composite interferences coexist In channel, RS code Is significantly superior to convolutional code in terms of performance. Concatenated code provides the same performance as RS code. The above results show that RS code is pertinent as error-correction code.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2014-2026
• /
• 1997

In this paper, the performances of wireless asynchronous transfer mode (ATM) cell transmission in mobile work are analyzed. We adopt 16Star QAM as amodulation technique in wireless channel and considered Reed-Solomon, convolutional, and concatenated coding to improve the error rate performances, and also proposed the Partial Concatenated Coding (PCC) technique as UEP(unequal error protection) code for efficient transmission of ATM cell in the air interface. We consider Doppler's effect, Rician fading, and diversity technique of maximal-ratio combining (MRC) for mobile channel model. For performance measure, we analyze bit error rate, ATM cell loss probability, ATM cell error probability, and network performances of ATM cell transmission delay and throughput. The numerical results show that the adoption of PCC is a prospective way for the evolution of future wireless ATM network on mobile environment.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.9-16
• /
• 2006

Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of redundancies is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its usage should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code(EREC) is well blown method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes EREREC method to improve FEREC(Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset can be adjusted to insure all offset sequence values can be used. The proposed EREREC algorithm can speed up the construction of FEREC slots, and can improve the compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about $0.3{\sim}3.5dB$ compared with the existing FEREC when random channel error happens.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6C
• /
• pp.570-579
• /
• 2003

The performance of turbo codes is investigated in the direct detection optical PPM channel. We assume that an ideal photon counter is used as an optical detector and that the channel has background noise as well as quantum noise. Resulting channel model is M-ary PPM Poisson channel. We propose the structure of the transmitter and receiver for applying turbo codes to this channel. We also derive turbo decoding algorithm for the proposed coding system, by modifying the calculation of the branch metric inherent in the original turbo decoding algorithm developed for the AWGN channel. Analytical bounds are derived and computer simulation is performed to analyze the performance of the proposed coding scheme, and the results are compared with the performances of Reed-Solomon codes and convolutional codes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1010-1019
• /
• 2004

In this paper, we represent Nakagami-m fading channel as finite-State Markov Channel (FSMC) and analyze the performance of wireless communication system with varying the fading channel condition. In FSMC model, the received signal's SNR is divided into finite intervals and these intervals are formed into Markov chain states. Each state is modeled by a BSC and the transition probability is dependent upon the physical characterization of the channel. The steady state probability and average symbol error rate of each state and transition probability are derived by numerical analysis and FSMC model is formed with these values. We found that various fading channels can be represented with FSMC by changing state transition index. In fast fading environment in which state transition index is large, the channel can be viewed as i.i.d. channel and on the contrary, in slow fading channel where state transition index is small, the channel can be represented by simple FSMC model in which transitions occur between just adjacent states. And we applied the proposed FSMC model to analyze the coding gain of random error correcting code on various fading channels via computer simulation.