• Title/Summary/Keyword: Coding gain

Search Result 400, Processing Time 0.023 seconds

A Study on the New BC-ABBM Motion Estimation Algorithm for Low Bit Rate Video Coding (저 전송률 비디오 압축을 위한 새로운 BC-ABBM 움직임 추정 알고리즘에 관한 연구)

  • 이완범;김환용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7C
    • /
    • pp.946-953
    • /
    • 2004
  • Fast search and conventional boolean matching motion estimation algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is difficult of implementation of hardware because of high control overhead and that is less performance than Full search Algorithm(FA). This paper present new all binary block matching algorithm, called Bit Converted All Binary Block Matching(BC-ABBM). Proposed algorithm have performance closed to the FA by boolean only block matching that may be very efficiently implemented in hardware for low bit rate video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.04dB loss than FA but is about 0.6 ∼ 1.4dB gain than fast search algorithm and conventional boolean matching algorithm.

On Realizing the Voice Response and Recoding System for a Home Visitor - A Predictor for the waveform Coding of Speech Signals by using the Dual First-Order Difference Values- (음성응답과 기록을 통한 가정 방문객 관리 시스템의 구현 -쌍 1차 차분을 통한 음성 파형부호화용 예측기-)

  • Bae, Myung-Jin;Lee, Mi-Suk;Lim, Un-Chun
    • The Journal of the Acoustical Society of Korea
    • /
    • v.11 no.1
    • /
    • pp.60-66
    • /
    • 1992
  • We can see the fact in the autocorrelation of the speech samples that the autocorrelation of adjacent past and next sample is larger than the autocorrelation of several order time delayed samples. It is more effective to use the adjacent past and next sample for prediction of present sample than only use the several order time delayed past. Thus, in this paper, we proposed a new predictor for the wave form coding that predict the present sample by using the one past and next samples. The proposed predictor has higher prediction gain up to 9dB than that of the CCITT-ADPCM.

  • PDF

Iterative Decoding far a Satellite Broadcasting Channel (위성 통신에서의 반복 복호 기법)

  • Lee, Jae-Sun;Park, Jae-Sun;Lee, Byoung-Moo;Kim, Jin-Young
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2009.08a
    • /
    • pp.309-313
    • /
    • 2009
  • In this paper, the network performance of a turbo coded optical code division multiple access (CDMA) system with cross-layer, which is between physical and network layers, concept is analyzed and simulated. We consider physical and MAC layers in a cross-layer concept. An intensity-modulated/direct-detection (IM/DD) optical system employing pulse position modulation (PPM) for satellite broadcasting communications is considered. In order to increase the system performance, turbo codes composed of parallel concatenated convolutional codes (PCCCs) is utilized. The network performance is evaluated in terms of bit error probability (BEP). From the simulation results, it is demonstrated that turbo coding offers considerable coding gain with reasonable encoding and decoding complexity. Also, it is confirmed that the performance of such an optical CDMA network can be substantially improved by increasing the interleaver length and the number of iterations in the decoding process. The results of this paper can be applied to implement the satellite broadcasting communications.

  • PDF

Delay-Throughput Analysis Based on Cross-Layer Concept for Optical CDMA Systems (Cross-layer 개념을 바탕으로 한 광 CDMA 시스템을 위한 Delay-Throughput 분석)

  • Kim, Yoon-Hyun;Kim, Seung-Jong;O, Yeong-Cheol;Lee, Seong-Chun;Kim, Jin-Young
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2009.08a
    • /
    • pp.314-319
    • /
    • 2009
  • In this paper, the network performance of a turbo coded optical code division multiple access (COMA) system with cross-layer, which is between physical and network layers, concept is analyzed and simulated We consider physical and MAC layers in a cross-layer concept. An intensity-modulated/direct-detection (IM/DD) optical system employing pulse position modulation (PPM) is considered In order to increase the system performance, turbo codes composed of parallel concatenated convolutional codes (PCCCs) is utilized. The network performance is evaluated in terms of bit error probability (BEP). From the simulation results, it is demonstrated that turbo coding offers considerable coding gain with reasonable encoding and decoding complexity. Also, it is confirmed that the performance of such an optical COMA network can be substantially improved by increasing the interleaver length and the number of iterations in the decoding process. The results of this paper can be applied to implement the indoor optical wireless LANs.

  • PDF

A Comparison of TDMA, Dirty Paper Coding, and Beamforming for Multiuser MIMO Relay Networks

  • Li, Jianing;Zhang, Jianhua;Zhang, Yu;Zhang, Ping
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.186-193
    • /
    • 2008
  • A two-hop multiple-input multiple-output (MIMO) relay network which comprises a multiple antenna source, an amplify-and-forward MIMO relay and many potential users are studied in this paper. Consider the achievable sum rate as the performance metric, a joint design method for the processing units of the BS and relay node is proposed. The optimal structures are given, which decompose the multiuser MIMO relay channel into several parallel single-input single-output relay channels. With these structures, the signal-to-noise ratio at the destination users is derived; and the power allocation is proved to be a convex problem. We also show that high sum rate can be achieved by pairing each link according to its magnitude. The sum rate of three broadcast strategies, time division multiple access (TDMA) to the strongest user, dirty paper coding (DPC), and beamforming (BF) are investigated. The sum rate bounds of these strategies and the sum capacity (achieved by DPC) gain over TDMA and BF are given. With these results, it can be easily obtained that how far away TDMA and BF are from being optimal in terms of the achievable sum rate.

A Selective Motion Estimation Algorithm with Variable Block Sizes (다양한 블록 크기 기반 선택적 움직임 추정 알고리즘)

  • 최웅일;전병우
    • Journal of Broadcast Engineering
    • /
    • v.7 no.4
    • /
    • pp.317-326
    • /
    • 2002
  • The adaptive coding schemes in H.264 standardization provide a significant ceding efficiency and some additional features like error resilience and network friendliness. The variable block size motion compensation using multiple reference frames is one of the key H.264 coding elements to provide main performance gain, but also the main culprit that increases the overall computational complexity. For this reason, this paper proposes a selective motion estimation algorithm based on variable block size for fast motion estimation in H.264. After we find the SAD(Sum of Absolute Difference) at initial points using diamond search, we decide whether to perform additional motion search in each block. Simulation results show that the proposed method is five times faster than the conventional full search in case of search range $\pm$32.

An efficient punctured-coded TCM for the mobile satellite channel (이동 위성 채널에서 효율적인 Punctured TCM 방식)

  • 박성경;김종일;홍성권;주판유;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.8
    • /
    • pp.2063-2076
    • /
    • 1996
  • In this thesis, in order to apply a punctured convolutional codes to the trellis coded modulation(TCM), an efficient punctured trellis coded modulation(PTCM) based on the decomposition of the metric into orthogonal components is presented. Also, a simulation is performed in an additive white Gaussian noise(AWGN) and a rician fading channel modeling the mobile satellite channel. The PTCM combines punctured convolutional coding with MPSK modulation to provide a large coding gain in a power-limited or bandwidth-limited channel. However, in general the use of the punctured convolutional code structure in the decoder results in a performance loss in comparison to trellis codes, due to difficulties in assigning metrics. But, the study shows no loss in performance for punctured trellis coded MPSK in comparison to TCM, and what is more, the punctured convolutional codes results in some savings in the complexity of Viterbi decoders, compared to TCM of the same rate. Also, the results shows that the punctured trellis coded .pi./8 shift 8PSK is an attractive scheme for power-limited and band-limited systems and especially, the Viterbi decoder with first and Lth phase difference metrics improves BER performance by the mobile satellite channel.

  • PDF

Weighted Prediction considering Global Brightness Variation and Local Brightness Variation in HEVC (전체적 밝기 변화와 지역적 밝기 변화를 고려한 HEVC에서의 가중치 예측)

  • Lim, Sung-won;Moon, Joo-hee
    • Journal of Broadcast Engineering
    • /
    • v.20 no.4
    • /
    • pp.489-496
    • /
    • 2015
  • In this paper, a new weighted prediction scheme is proposed to improve the coding efficiency for video scenes containing brightness variations. Conventional weighted prediction is applied by the reference picture and use only one weighted parameter set. Thus, it is only useful for GBV(Glabal Brightness Variation). In order to solve this problem, the proposed algorithm use three kind of schemes depending on situation. Experimental results show that maximum coding efficiency gain of the proposed method is up to 10.2% in luminance. Average computional time complexity is increased about 163% in encoder and about 101% in decoder.

Performance Analysis of Adaptive System Model using MPSK and MQAM for Frequency Nonselective Channel (주파수 비선택성 채널에서 MPSK와 MQAM을 이용한 적응적 시스템 모델의 성능 해석)

  • Jae-Kyoung Moon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.8 no.4
    • /
    • pp.332-341
    • /
    • 1997
  • In this paper, we propose an adaptive trellis-coded Multipe Quadrature Amplitude Modulation (ATCMQAM) for slowly varying Rayleigh fading channels. The proposed system adaptively controls the coding rate combined with modulation level of pargmatic approach to trellis-coded modulation according to the instantaneous fading channel conditions, and employs MQAM as modulation scheme. Results by computer simulation show that the proposed adaptive model using MQAM can realize higher quality transmission with the improvement more than 0.5~1 bit in average bit rate, and there is a coding gain of 2~5 dB, depending on the high SNR value, compared with the conventional adaptive model employing MPSK.

  • PDF

Performance Analysis of Coded Cooperation Protocol with Reactive and Proactive Relay Selection

  • Asaduzzaman, Asaduzzaman;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.11 no.2
    • /
    • pp.133-142
    • /
    • 2011
  • Coded cooperation that integrates channel coding in cooperative transmission has gained a great deal of interest in wireless relay networks. The performance analysis of coded cooperation protocol with multiple relays is investigated in this paper. We show that the diversity order achieved by the coded cooperation in a multi-relay wireless network is not only dependent on the number of cooperating relays but is also dependent on the code-rate of the system. We derive the code-rate bound, which is required to achieve the full diversity gain of the order of cooperating nodes. The code-rate required to achieve full diversity is a linearly decreasing function of the number of available relays in the network. We show that the instantaneous channel state information (CSI)-based relay selection can effectively alleviate this code-rate bound. Analysis shows that the coded cooperation with instantaneous CSI-based relay selection can achieve the full diversity, for an arbitrary number of relays, with a fixed code-rate. Finally, we develop tight upper bounds for the bit error rate (BER) and frame error rate (FER) of the relay selection based on coded cooperation under a Rayleigh fading environment. The analytical upper bounds are verified with simulation results.