• Title/Summary/Keyword: coding gain

Search Result 401, Processing Time 0.023 seconds

Design and performance analysis of the linear phase para-unitary M bandfilter bank with application to image coding (영상 부호화를 위한 LPPU M 대역 필터군의 설계와 성능 분석)

  • 이창우;김종원;이상욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.5
    • /
    • pp.1141-1154
    • /
    • 1996
  • The para-unitary (PU) M band filter bank, which can beused for M band decomposition, has many useful properties. In this ppaer, attempts have been made to design and and analyze the linear phase para-unitary (LPPU) M band filter bank, which is appropriate to the image coding application. First, we derive a unified coding gain in terms of the correlation in the band, as well as the energy compaction. And M band filter bank has been designed, maximizing the new coding gain. Then, we analyze the image coding performance of the LPPU M band filter bank, such as the energy compaction, the correlation in the band and the entropy. From the analysis, it is shown that the coding gain for LPPU M band filter bank improves, and the coding gain for the LPPU 4 band filter bank approaches very closely to that for LPPU 8 band filter bank, as the length of the filter increases. This fact is also verified by the coding results on the real images.

  • PDF

On the Diversity-Multiplexing Tradeoff of Cooperative Multicast System with Wireless Network Coding

  • Li, Jun;Chen, Wen
    • Journal of Communications and Networks
    • /
    • v.12 no.1
    • /
    • pp.11-18
    • /
    • 2010
  • Diversity-multiplexing tradeoff (DMT) is an efficient tool to measure the performance of multiple-input and multiple-output (MIMO) systems and cooperative systems. Recently, cooperative multicast system with wireless network coding stretched tremendous interesting due to that it can drastically enhance the throughput of the wireless networks. It is desirable to apply DMT to the performance analysis on the multicast system with wireless network coding. In this paper, DMT is performed at the three proposed wireless network coding protocols, i.e., non-regenerative network coding (NRNC), regenerative complex field network coding (RCNC) and regenerative Galois field network coding (RGNC). The DMT analysis shows that under the same system performance, i.e., the same diversity gain, all the three network coding protocols outperform the traditional transmission scheme without network coding in terms of multiplexing gain. Our DMT analysis also exhibits the trends of the three network coding protocols' performance when multiplexing gain is changing from the lower region to the higher region. Monte-Carlo simulations verify the prediction of DMT.

Context-based coding of inter-frame DCT coefficients for video compression (비디오 압축을 위한 영상간 차분 DCT 계수의 문맥값 기반 부호화 방법)

  • Lee, Jin-Hak;Kim, Jae-Kyoon
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.281-285
    • /
    • 2000
  • This paper proposes context-based coding methods for variable length coding of inter-frame DCT coefficients. The proposed methods classify run-level symbols depending on the preceding coefficients. No extra overhead needs to be transmitted, since the information of the previously transmitted coefficients is used for classification. Two entropy coding methods, arithmetic coding and Huffman coding, are used for the proposed context-based coding. For Huffman coding, there is no complexity increase from the current standards by using the existing inter/intra VLC tables. Experimental results show that the proposed methods give ~ 19% bits gain and ~ 0.8 dB PSNR improvement for adaptive inter/intra VLC table selection, and ~ 37% bits gain and ~ 2.7dB PSNR improvement for arithmetic coding over the current standards, MPEG-4 and H.263. Also, the proposed methods obtain larger gain for small quantizaton parameters and the sequences with fast and complex motion. Therefore, for high quality video coding, the proposed methods have more advantage.

  • PDF

On the Design of the Linear Phase Lapped Orthogonal Transform Bases Using the Prefilter Approach (전처리 필터를 이용한 선형 위성 LOT 기저의 설계에 관한 연구)

  • 이창우;이상욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.7
    • /
    • pp.91-100
    • /
    • 1994
  • The lapped orthogonal transform(LOT) has been recently proposed to alleviate the blocking effects in transform coding. The LOT is known to provide an improved coding gain than the conventional transform. In this paper, we propose a prefilter approach to design the LOT bases with the view of maximizing the transform coding gain. Since the nonlinear phase basis is inappropriate to the image coding only the linear phase basis is considered in this paper. Our approach is mainly based on decomposing the transform matrix into the orthogonal matrix and the prefilter matrix. And by assuming that the input is the 1st order Markov source we design the prefilter matrix and the orthogonal matirx maximizing the transform coding gain. The computer simulation results show that the proposed LOT provides about 0.6~0.8 dB PSNR gain over the DCT and about 0.2~0.3 dB PSNR gain over the conventional LOT [7]. Also, the subjective test reveals that the proposed LOT shows less blocking effect than the DCT.

  • PDF

Spatial Coding using Data Information and Antenna Selection Technique in MIMO System (MIMO 시스템에서 데이터 정보와 안테나 선택 기법을 이용한 공간 부호화)

  • Song, Jae-Woong;Kim, Back-Hyun;Jeong, Rag-Gyo;Kwak, Kyung-Sup
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.6
    • /
    • pp.81-88
    • /
    • 2012
  • Space diversity and space multiplexing gain can be achieved with MIMO system. This paper proposes spatial coding method to MIMO system using data information and antenna selection technique. This technique provides coding gain as well as space diversity gain. For MIMO system with BPSK modulation, BER performance is analyzed and space diversity gains are compared through simulation in terms of data maldistribution degree.

Asymptotic Gain of Network-Coded Retransmission in Wireless Networks (무선 네트워크에서 네트워크 코딩 재전송 기법의 점근적 이득)

  • Ko, Seung-Woo;Kim, Seong-Lyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6B
    • /
    • pp.464-473
    • /
    • 2012
  • In this paper, we derive the gain of network coding when it is utilized for retransmission in wireless networks. To the end, we derive the outage probability of the network-coded transmission and express the diversity order as a function of the number of nodes and the node's listening probability. From the outage probability, we formulate the ${\epsilon}$-outage capacity. The network-coding gain is the ratio of the ${\epsilon}$-outage capacities between network-coded and non-coded transmissions. Under our system model, we find that the network-coding gain is a function of the diversity order. Moreover, when there are infinitely many nodes, we show that the network coding gain approaches $0.25{\epsilon}^{-1}$.

A Study on the Optical Communication Channel using Forward Error Correcting Technique (순방향 에러 교정 기법을 이용한 광통신 채널에 관한 연구)

  • Kang, Young-Jin;Kim, Sun-Yeob
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.2
    • /
    • pp.835-839
    • /
    • 2013
  • In this paper, We operate at a relatively low BER or using forward error control coding techniques on ways to increase the capacity of optical communication systems research. Coding gain is defined as the ratio of the probability of the coded signal and coding of error signal. Coding gain is increased, partly because of the period, to reduce the value of the optimal coding of the signal error probability decreases because of the effective bit binary symbol duration is longer than can be ignored. Transmission capacity on the coding gain for various code rates, which show the extent of up to 75Gb/s transmission capacity to get through it was confirmed that these coding techniques.

Fast Algorithm for Constructing Wavelet Packet Bases Yielding the Maximum Coding Gain (최대 부호화 이득을 내는 웨이블릿 기저를 구축하기 위한 고속 알고리즘)

  • Kim, Won-Ha
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.38 no.2
    • /
    • pp.16-26
    • /
    • 2001
  • This paper develops the fast dynamic programming technique to construct the subband structure yielding the maximum coding gain for given filter bases and a given limit of implementation complexity. We first derive the unified coding gain which can be applied to non-orthogonal filter basis as well as orthogonal filter basis and to arbitrary subband decompositions. Then, we verify that the unified coding gains in real systems are monotonically increasing function for the implementation complexities which are proportional to the number of subbands. By using this phenomenon, the implementation complexity and the coding gain are treated in the same way as the rate and distortion function. This makes it possible to use the Lagrangian multiplier method for finding the optimal subband decomposition producing the maximum coding gain [or a given limit of implementation complexity.

  • PDF

Simple Relay Selection for Wireless Network Coding System

  • Kim, Jang-Seob;Lee, Jung-Woo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.07a
    • /
    • pp.310-313
    • /
    • 2011
  • Broadcasting nature of wireless communications makes it possible to apply opportunistic network coding (OPNC) by overhearing transmitted packets from a source to sink nodes. However, it is difficult to apply network coding to the topology of multiple relay and sink nodes. We propose to use relay node selection, which finds a proper node for network coding since the OPNC alone in the topology of multiple relays and sink nodes cannot guarantee network coding gain. The proposed system is a novel combination of wireless network coding and relay selection, which is a key contribution of this paper. In this paper, with the consideration of channel state and potential network coding gain, we propose relay node selection techniques, and show performance gain over the conventional OPNC and a channel-based selection algorithm in terms of average system throughput.

  • PDF

Performance Analysis for Weaker Channel User in Non-Uniform Source SSC NOMA with Novel BTS

  • Chung, Kyuhyuk
    • International journal of advanced smart convergence
    • /
    • v.11 no.1
    • /
    • pp.36-41
    • /
    • 2022
  • Recently, to improve the performance of the strongest channel gain user in non-orthogonal multiple access (NOMA) with a non-uniform source and symmetric superposition coding (SSC), a novel bit-to-symbol (BTS) mapping have been proposed. However, only the performance of the user with the stronger channel gain was analyzed. Thus, we compare the bit-error rate (BER) of the new BTS scheme with that of uniform sources, especially for the user with weakest channel gain. First, we show that the performance of the novel BTS scheme for the user with weakest channel gain also improves, compared to that of the uniform sources. Furthermore, the signal-to-noise (SNR) gain of the new BTS scheme over the uniform sourcesis calculated. As a consequence, the novel BTS scheme would improve the performance of the user with weakest channel gain as well as that with the stronger channel gain for SSC NOMA with a non-uniform source.