• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.203-209
• /
• 2006

In this paper, proposed diversity algorithm that decrease fading. In the wireless channel, if fading occurs due to the multipaths the performance of the system is apparently reduced. This study applied tap-delay receiver. It applied QPSK and OQPSK modulation methods and applied the convolutional codes, where the code rate is 1/2 and 1/3 and the constraint length is 11 and the turbo code where the constraint length is 6. The diversity algorithm proposed in this paper could be compared and analyzed the average error probability of modulation method variable of fading factor to uplink and downlink channels.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.37-43
• /
• 2008

The performance and hardware complexity of LDPC decoders depend on the design parameters of quantization, the clipping threshold $c_{th}$ and the number of quantization bits q, and also on the maximum number of decoding iterations. In this paper, the BER performances of LDPC codes are evaluated according to the clipping threshold $c_{th}$ and the number of quantization bits q through the simulation studies. By comparing the quantized Min-Sum algorithm with the ideal Min-Sum algorithm, it is shown that the quantized case with $c_{th}=2.5$ and q=6 has the best performance, which approaches the idea case. The decoding complexities are calculated and the word error rates(WER) are estimated by using the pdf which is obtained through the statistical analyses on the iteration numbers. These results can be utilized to tradeoff between the decoding performance and the complexity in LDPC decoder design.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.66-74
• /
• 2010

Recently distributed video coding (DVC) is spotlighted for the environment which has restriction in computing resource at encoder. Wyner-Ziv (WZ) coding is a representative scheme of DVC. The WZ encoder independently encodes key frame and WZ frame respectively by conventional intra coding and channel code. WZ decoder generates side information from reconstructed two key frames (t-1, t+1) based on temporal correlation. The side information is regarded as a noisy version of original WZ frame. Virtual channel noise can be removed by channel decoding process. So the performance of WZ coding greatly depends on the performance of channel code. Among existing channel codes, Turbo code and LDPC code have the most powerful error correction capability. These channel codes use stochastically iterative decoding process. However the iterative decoding process is quite time-consuming, so complexity of WZ decoder is considerably increased. Analysis of the complexity of LPDCA with real video data shows that the portion of complexity of LDPCA decoding is higher than 60% in total WZ decoding complexity. Using the HDA (Hard Decision Aided) method proposed in channel code area, channel decoding complexity can be much reduced. But considerable RD performance loss is possible according to different thresholds and its proper value is different for each sequence. In this paper, we propose an adaptive HDA method which sets up a proper threshold according to sequence. The proposed method shows about 62% and 32% of time saving, respectively in LDPCA and WZ decoding process, while RD performance is not that decreased.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.3
• /
• pp.121-127
• /
• 1998

In this paper, using diversity and convolution code in the DS/CDMA system, have been the performance analized. In this modulation shceme is using QPSK. Channel to CDMA system has been approximated by Rayleight fading channel considering effect for multi-path. In this assumed that receiver is WTDL(Wide-band Tappped Delay Line) receiver, and in this condition, average error probability of DS/CDMA.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2003.11a
• /
• pp.61-64
• /
• 2003

무손실 이미지 압축은 (Lossless Image Compression)은 손실이미지 압축(Lossy Image Compression)에 비해, 압축률(compression ratio)은 떨어지지만, 반면 원이미지와 복원이미지가 완전히 일치하므로, 원인이미지의 품질을 그대로 유지학 수 있다. 따라서, 이미지의 품질(Quality)과 압축효율(compression ratio)은 서로 상반된 관계에 있으며, 지금도 좀 더 놀은 압축효과를 얻으려는 여러 무손실 압축 방법이 발표되고 있다. 무손실 이미지 압축은 이미지의 정확성과 정밀성이 요구되는, 의료영양분야에서 가장 널리 쓰이고 있으며, 그밖에, 원본이미지를 기본으로 다른 이미지프로세싱이 필요한 경우, 압축 복원을 반복적으로 수행할 필요가 있을 때, 기타 사진 예술분야, 원격 영상 등 정밀성이 요구되는 분양에서 쓰이고 있다. [7]. 무손실 이미지 압축의 가장 대표적인 CALIC[3]과 JPEG_LS[2]를 들 수 있다. CALIC은 비교적 높은 압축률을 나타내지만, 3-PASS의 과정을 거치는 복잡도가 지적되고 있다. 반면 JPEG-LS는 압축률은 CALIC에 미치지 못하지만 빠른 코딩/디코딩 속도를 보인다. 본 논문에서는 여거 가지의 예측 모드를 두어, 블록단위별로 주변 CONTEXT에 따라, 최상의 예측 모드를 판단하여, 이를 적용, 픽셀의 여러 값을 최소화하였다. 그 후 적응산술 부호기(Adaptive arithmetc coder)를 이용하여, 인코딩을 하였다. 이때 최대 에러값은 64를 넘지 않게 했으며, 또한 8*8블록별로 에러의 최대값을 측정하여 그 값을 $0\~7$까지의 8개의 대표값으로 양자화하는 방법을 통하여 그에 따라 8개의 보호화 심볼 모델중 알맞은 모델에 적용하였다. 이를 통해, 그 소화값의 확률 구간을 대폭 넓힘으로써, 에러 이미지가 가지고 있는 엔트로피에 좀 근접하게 코딩을 할 수 있게 되었다. 이 방법은 실제로 Arithmetic Coder를 이용하는 다른 압축 방법에 그리고 적용할 수 있다. 실험 결과 압축효율은 JPEG-LS보다 약 $5\%$의 압축 성능 개선이 있었으며, CALIC과는 대등한 압축률을 보이며, 부호화/복호화 속도는 CALIC보다 우수한 것으로 나타났다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.994-1004
• /
• 2000

In this paper, bitstreams are composed of using H.263 for a moving picture coding in the band-limited and error-prone environment such as wireless environment. EREC sub-frames are implemented by applying the proposed EREC algorithm in order to be UEP for the real data parts of implemented bitstreams. Because those are able to do resynchronization with a block unit, propagation of the error can be minimized, and the position of the important bits such as INTRADC and MVD can be known. Class is separated using the position of these important bits, and variable puncturing tables are designed by the class informations and the code rates of turbo codes are differently designed in according to the class. Channel coding used the turbo codes, and an interleaver to be designed in the turbo codes does not eliminate redundancy bits of the important bits in applying variable code rates of EREC sub-frames unit and is always the same at the transmitter and the receiver although being variable frame size. As a result of simulation, UEP with the code rate similar to EEP is obtained a improved result in the side of bit error probability. And the result of applying it to image knows that the subjective and objective quality have been improved by the protection of important bits.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12A
• /
• pp.1147-1155
• /
• 2008

In this paper, we derive the probability density function (PDF) of end-to-end signal-to-noise ratio (SNR) for t he dual-hop MIMO (Multiple-Input Multiple-Output) DCF (Decouple-and-Forward) system. We also provide the end-to-end bit error ratio (BER) with M-ary PSK constellations for four antenna combinations. These are (1,8,1), (8,1,8), (2,4,2), and (4,2,4). Each number in the parentheses is the number of the transmit antenna at the source, the transmit and receive antenna at the relay and the receive antenna at the destination, respectively. We show t hat the end-to-end BER expression with M-ary PSK constellations makes an exact match with numerical results. We also show that MIMO DCF relay system achieves spatial diversity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.2
• /
• pp.120-126
• /
• 1988

In this paper the performance of the asynchronous Repeated FH/MFSK system for the CDMA(Code Division Multiple Access) was analyzed. Actually there was no difference in the probabilities of hit of frequency between Random Coding method and frequency hopping pattern vector suggested by Einarsso. Actual situation was adopted as a model in thie simulation, on the assumption thet;a:there was no Noise, Multipath propagation, b:there was only mutual interference. c:the number of users M was given. Also it was found that there is almost no deviation between the value calculated from the formula of word error probability expressed by bound and that obtained from this simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.69-82
• /
• 1993

본 논문에서는 디지틀 이동 통신 시스템의 열악한 페이딩 채널에 적합한 변복조 반식중의 하나인${\pi}$/4-shift QPSK 성능을 논하고, 그 성능 개선을 위한 새로운 TCM(trellis-coded modulation)을 적응하여 trellis-부호화된${\pi}$/8-shift 8SPSK 방식을 제안 한다. 기존의 ${\pi}$/4-shift QPSK변조 방식에 TCM의 도입은 요구된 대역폭과 송신 전력과 전송을 그대로 유지하면서 부호화와 변조를 일체화함으로서 부호화 이득(coding gain)을 얻을 수 있다. 이동 통신 채널에서 trellis-부호화된 ${\pi}$/8-shift 8PSK방식의 시스템 성능을 추정하기 위해서, 가산 백색 가우시안 잡음과 레일레이 페이딩 현상이 존재하는 채널에서, 차량속도 변화에 따른 도플러 효과에 의한 페이딩율이 10Hz와 30Hz인 두 경우에 대해 시스템을 모델링한다. Trellis-부호화된${\pi}$/8-shift 8PSK에 대한 부호화 이득은 비트 에러 확률을 적용하여 분석하고, 기본 시스템과 새롭게 모델링 되어진 시스템의 개선된 성능을 비교하기 위해, TCM의 상태수를 4,8,16으로 선정하여 비교 구현해 본 결과, 상태수가 커질수록 더 좋은 성능을 나타내고, 기존의 ${\pi}$/4-shift QPSK보다 trellis-부호된 ${\pi}$/8-shift 8PSK는 가산 백색 가우시안 잡음채널에서는 3~4dB의 부호화 이득을 얻고, 레일레이 페이티 채널하에서 3~16dB정도의 부호화 이득을 얻음을 알 수 있다.

• Journal of Advanced Navigation Technology
• /
• v.12 no.6
• /
• pp.634-639
• /
• 2008

In mobile communication networks, the main power consumption is due to the actual transmissions power. Therefore, power efficiency network structures have gained considerable importance in mobile multi-hop systems and networks in recent years. In this paper, the performance of mobile multi-hop wireless system with M-QAM signal and forward error control (FEC) technique are analyzed The FEC technique uses extra processing power related to encoding and decoding, it is need complex functions to be built into the communication node. The probability of receiving a correct bit and codeword for relaying a data frame over h hop relay station to the final station is evaluated as a function of channel parameter and number of hops, and the distance between the different station.