• Title/Summary/Keyword: packet coding algorithm

Search Result 47, Processing Time 0.02 seconds

Packet Loss Concealment Algorithm Based on Speech Characteristics (음성신호의 특성을 고려한 패킷 손실 은닉 알고리즘)

  • Yoon Sung-Wan;Kang Hong-Goo;Youn Dae-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.7C
    • /
    • pp.691-699
    • /
    • 2006
  • Despite of the in-depth effort to cantrol the variability in IP networks, quality of service (QoS) is still not guaranteed in the IP networks. Thus, it is necessary to deal with the audible artifacts caused by packet lasses. To overcame the packet loss problem, most speech coding standard have their own embedded packet loss concealment (PLC) algorithms which adapt extrapolation methods utilizing the dependency on adjacent frames. Since many low bit rate CELP coders use predictive schemes for increasing coding efficiency, however, error propagation occurs even if single packet is lost. In this paper, we propose an efficient PLC algorithm with consideration about the speech characteristics of lost frames. To design an efficient PLC algorithm, we perform several experiments on investigating the error propagation effect of lost frames of a predictive coder. And then, we summarize the impact of packet loss to the speech characteristics and analyze the importance of the encoded parameters depending on each speech classes. From the result of the experiments, we propose a new PLC algorithm that mainly focuses on reducing the error propagation time. Experimental results show that the performance is much higher than conventional extrapolation methods over various frame erasure rate (FER) conditions. Especially the difference is remarkable in high FER condition.

A Packet Scheduling Algorithm and Efficient Framing Method for Next Generation Wireless Communication System and its Performance (차세대 이동통신시스템을 위한 패킷 스케쥴링 알고리즘과 효율적인 프레임 구성 방법 및 성능 분석)

  • Baek Jang Hyun;Kim Dong Hoi
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.2
    • /
    • pp.29-40
    • /
    • 2005
  • In this research, we propose packet scheduling algorithm considering different QoS characteristics of real-time traffic and non-real-time traffic in the next generation wireless communication system serving the multimedia traffic and a new efficient framing method cooperated with this packet scheduler. When the selected traffic classes of the selected users are transmitted, our proposed framing method can increase the number of serviced traffic classes by mixing the many different traffic classes within one frame considering data rate decided by the allocated AMC (Adaptive Modulation and Coding) option. Using this proposed method, the fairness among the traffic classes can be achieved and the system performance for total throughput and delay can be enhanced. Simulations are performed to analyze the performance of the proposed framing method. Our proposed packet scheduler and framing method will be applied to the next generation multimedia wireless communication system serving many traffic classes.

Packet Scheduling Algorithm Considering a Minimum Bit Rate for Non-realtime Traffic in an OFDMA/FDD-Based Mobile Internet Access System

  • Kim, Dong-Hoi;Ryu, Byung-Han;Kang, Chung-Gu
    • ETRI Journal
    • /
    • v.26 no.1
    • /
    • pp.48-52
    • /
    • 2004
  • In this letter, we consider a new packet scheduling algorithm for an orthogonal frequency division multiplexing access/frequency division duplex (OFDMA/FDD)-based system, e.g., mobile broadband wireless access or high-speed portable internet systems, in which the radio resources of both time and frequency slots are dynamically shared by all users under a proper scheduling policy. Our design objective is to increase the number of non-realtime service (e.g., WWW) users that can be supported in the system, especially when the minimum bit rate requirement is imposed on them. The simulation results show that our proposed algorithm can provide a significant improvement in the average outage probability performance for the NRT service, i.e., significantly increasing the number of NRT users without much compromising of the cell throughput.

  • PDF

Data Dissemination in Wireless Sensor Networks with Instantly Decodable Network Coding

  • Gou, Liang;Zhang, Gengxin;Bian, Dongming;Zhang, Wei;Xie, Zhidong
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.846-856
    • /
    • 2016
  • Wireless sensor networks (WSNs) are widely applied in monitoring and control of environment parameters. It is sometimes necessary to disseminate data through wireless links after they are deployed in order to adjust configuration parameters of sensors or distribute management commands and queries to sensors. Several approaches have been proposed recently for data dissemination in WSNs. However, none of these approaches achieves both high efficiency and low complexity simultaneously. To address this problem, cluster-tree based network architecture, which divides a WSN into hierarchies and clusters is proposed. Upon this architecture, data is delivered from base station to all sensors in clusters hierarchy by hierarchy. In each cluster, father broadcasts data to all his children with instantly decodable network coding (IDNC), and a novel scheme targeting to maximize total transmission gain (MTTG) is proposed. This scheme employs a new packet scheduling algorithm to select IDNC packets, which uses weight status feedback matrix (WSFM) directly. Analysis and simulation results indicate that the transmission efficiency approximate to the best existing approach maximum weight clique, but with much lower computational overhead. Hence, the energy efficiency achieves both in data transmission and processing.

Directional Vector Quantization on the Wavelet Packet Domain (웨이브릿 패킷 영역에서의 방향성 벡터양자화)

  • Kang, Dong-Wook
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.6
    • /
    • pp.72-80
    • /
    • 1998
  • A method is proposed for directional vector quantization using the wavelet packets. After partitioning the wavelet packet coefficients into 9 edges according to the corresponding directions, it encodes and transmits locally dominant edges. The directions of the edges are encoded with a variable length coding and conditional switching of codebooks, while the contents of them with the vector quantization followed by the variable length index coding. The proposed algorithm is superior to various conventional image coding algorithms in the sense of PSNR, which is relatively more significant at very low bit rate such as 0.1~0.3 bpp. As the proposed algorithm preserves the edges which is the most important for the human visual system, it also provides the reconstructed images of good subjective quality even at very low bit rate.

  • PDF

The Softest handoff Design using iterative decoding (Turbo Coding)

  • Yi, Byung-K.;Kim, Sang-G.;Picknoltz, Raymond-L.
    • Journal of Communications and Networks
    • /
    • v.2 no.1
    • /
    • pp.76-84
    • /
    • 2000
  • Communication systems, including cell-based mobile communication systems, multiple satellite communication systems of multi-beam satellite systems, require reliable handoff methods between cell-to-cell, satellite-to-satellite of beam-to-team, respectively. Recent measurement of a CDMA cellular system indicates that the system is in handoff at about 35% to 70% of an average call period. Therefore, system reliability during handoff is one of the major system performance parameters and eventually becomes a factor in the overall system capacity. This paper presents novel and improved techniques for handoff in cellular communications, multi-beam and multi-satellite systems that require handoff during a session. this new handoff system combines the soft handoff mechanism currently implemented in the IS-95 CDMA with code and packet diversity combining techniques and an iterative decoding algorithm (Turbo Coding). the Turbo code introduced by Berrou et all. has been demonstrated its remarkable performance achieving the near Shannon channel capacity [1]. Recently. Turbo codes have been adapted as the coding scheme for the data transmission of the third generation international cellular communication standards : UTRA and CDMA 2000. Our proposed encoder and decoder schemes modified from the original Turbo code is suitable for the code and packet diversity combining techniques. this proposed system provides not only an unprecedented coding gain from the Turbo code and it iterative decoding, but also gain induced by the code and packet diversity combining technique which is similar to the hybrid Type II ARQ. We demonstrate performance improvements in AWGN channel and Rayleigh fading channel with perfect channel state information (CSI) through simulations for at low signal to noise ratio and analysis using exact upper bounding techniques for medium to high signal to noise ratio.

  • PDF

Three-Dimensional Subband Coding of Video using Wavelet Packet Algorithm (웨이브릿 패킷 알고리즘을 이용한 3차원 비디오 서브밴드 코딩)

  • Chu, Hyung Suk;An, Chong Koo
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.11
    • /
    • pp.673-679
    • /
    • 2005
  • This Paper presents the 3D wavelet transformation based video compression system, which possesses the capability of progressive transmission by increasing resolution and increasing rate for multimedia applications. The 3D wavelet packet based video compression system removes the temporal correlation of the input sequences using the motion compensation filter and decomposes the spatio-temporal subband using the spatial wavelet packet transformation. The proposed system allocates the higher bit rate to the low frequency image of the 3D wavelet sequences and improves the 0.49dB PSNR performance of the reconstructed image in comparison with that of H.263. In addition to the limitation on the propagation of the motion compensation error by the 3D wavelet transformation, the proposed system progressively transmits the input sequence according to the resolution and rate scalability.

Joint Source/Channel Coding Based on Two-Dimensional Optimization for Scalable H.264/AVC Video

  • Li, Xiao-Feng;Zhou, Ning;Liu, Hong-Sheng
    • ETRI Journal
    • /
    • v.33 no.2
    • /
    • pp.155-162
    • /
    • 2011
  • The scalable extension of the H.264/AVC video coding standard (SVC) demonstrates superb adaptability in video communications. Joint source and channel coding (JSCC) has been shown to be very effective for such scalable video consisting of parts of different significance. In this paper, a new JSCC scheme for SVC transmission over packet loss channels is proposed which performs two-dimensional optimization on the quality layers of each frame in a rate-distortion (R-D) sense as well as on the temporal hierarchical structure of frames under dependency constraints. To compute the end-to-end R-D points of a frame, a novel reduced trellis algorithm is developed with a significant reduction of complexity from the existing Viterbi-based algorithm. The R-D points of frames are sorted under the hierarchical dependency constraints and optimal JSCC solution is obtained in terms of the best R-D performance. Experimental results show that our scheme outperforms the existing scheme of [13] with average quality gains of 0.26 dB and 0.22 dB for progressive and non-progressive modes respectively.

A Study on the Wavelet Based Algorithm for Lossless and Lossy Image Compression (무손실.손실 영상 압축을 위한 웨이브릿 기반 알고리즘에 관한 연구)

  • An, Chong-Koo;Chu, Hyung-Suk
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.55 no.3
    • /
    • pp.124-130
    • /
    • 2006
  • A wavelet-based image compression system allowing both lossless and lossy image compression is proposed in this paper. The proposed algorithm consists of the two stages. The first stage uses the wavelet packet transform and the quad-tree coding scheme for the lossy compression. In the second stage, the residue image taken between the original image and the lossy reconstruction image is coded for the lossless image compression by using the integer wavelet transform and the context based predictive technique with feedback error. The proposed wavelet-based algorithm, allowing an optional lossless reconstruction of a given image, transmits progressively image materials and chooses an appropriate wavelet filter in each stage. The lossy compression result of the proposed algorithm improves up to the maximum 1 dB PSNR performance of the high frequency image, compared to that of JPEG-2000 algorithm and that of S+P algorithm. In addition, the lossless compression result of the proposed algorithm improves up to the maximum 0.39 compression rates of the high frequency image, compared to that of the existing algorithm.

An Enhanced Wavelet Packet Image Coder Using Coefficients Partitioning (계수분할을 이용한 개선된 워이블릿 패킷 영상 부호화 알고리듬)

  • 한수영;김홍렬;이기희
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.1
    • /
    • pp.112-119
    • /
    • 2002
  • We propose an enhanced wavelet packet image coder algorithm which is based on the coefficients partition. The proposed wavelet packet image coder uses the first-order entropy to reduce the total compression time, and achieves low bit rates and rate-distortion performance by the zero-tree based coding using correlations between coefficients partition. This new algorithm represents new parent-children relationships for reducing image reconstruction error using the correlations between each frequency subbands and then the wavelet packet coefficients are Partitioned by a new order. The computer simulations demonstrate higher PSNR under the same bit rate and improved image compression time and enhanced rate control compare with conventional algorithms. From the simulation results, it is shown that the encoding and decoding process of proposed coder are much simple and accurate than present method against texture images , which include many mid-frequency elements.

  • PDF