• Title/Summary/Keyword: decoding scheme

Search Result 397, Processing Time 0.023 seconds

Kalman filter based Motion Vector Recovery for H.264 (H.264 비디오 표준에서의 칼만 필터 기반의 움직임벡터 복원)

  • Ko, Ki-Hong;Kim, Seong-Whan
    • The KIPS Transactions:PartD
    • /
    • v.14D no.7
    • /
    • pp.801-808
    • /
    • 2007
  • Video coding standards such as MPEG-2, MPEG-4, H.263, and H.264 transmit a compressed video data using wired/wireless communication line with limited bandwidth. Because highly compressed bit-streams is likely to fragile to error from channel noise, video is damaged by error. There have been many research works on error concealment techniques, which recover transmission errors at decoder side [1, 2]. We designed an error concealment technique for lost motion vectors of H.264 video coding. In this paper, we propose a Kalman filter based motion vector recovery scheme, and experimented with standard video sequences. The experimental results show that our scheme restores original motion vector with more precision of 0.91 - 1.12 on average over conventional H.264 decoding with no error recovery.

Sub-optimal fractal Coding Scheme Using Iterative Transformation (반복 변환을 이용한 준최적 프랙탈 부호화 기법)

  • 강현수;홍성훈
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.3A
    • /
    • pp.231-239
    • /
    • 2002
  • This paper presents a new fractal coding scheme to find sub-optimal transformation by performing an iterative encoding process. An optimal transformation can be defined as the transformation generating the attractor which is closest to an original image. Unfortunately, it has been well-known that it is actually impossible to find the optimal transformation due to heavy computation. In this paper, however, by means of some new theorems related with the fractal transformation due the attractor, it is shown that for a special case the optimal transformation can be obtained as well as for a general case the sub-optimal transformation. The proposed method based on the theorems obtains the sub-optimal transformation performing an iterative process as if done in decoding. Thus, it requires more computation than the conventional method but improves the image quality. We verify the superiority of the proposed method through the experimental results fur real images, which shows that the proposed method approaches to the optimal method in the performance and is superior to the conventional method.

Turbo Perallel Space-Time Processing System with LDPC Code in MIMO Channel for High-Speed Wireless Communications (MIMO 채널에서 고속 무선 통신을 위한 LDPC 부호를 갖는 터보 병렬 시공간 처리 시스템)

  • 조동균;박주남;황금찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.10C
    • /
    • pp.923-929
    • /
    • 2003
  • Turbo processing have been known as methods close to Shannon limit in the aspect of wireless multi-input multi-output (MIMO) communications similarly to wireless single antenna communication. The iterative processing can maximize the mutual effect of coding and interference cancellation, but LDPC coding has not been used for turbo processing because of the inherent decoding process delay. This paper suggests a LDPC coded MIMO system with turbo parallel space-time (Turbo-PAST) processing for high-speed wireless communications and proposes a average soft-output syndrome (ASS) check scheme at low signal to noise ratio (SNR) for the Turbo-PAST system to decide the reliability of decoded frame. Simulation results show that the suggested system outperforms conventional system and the proposed ASS scheme effectively reduces the amount of turbo processing iterations without performance degradation from the point of average number of iterations.

A Study on the Data Compression Algorithm for Just-in-Time Rendering of Concentric Mosaic (동심원 모자이크의 실시간 표현을 위한 데이터 압축 알고리즘에 관한 연구)

  • Jee, Inn-Ho;Ahn, Hong-Yeoung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.1
    • /
    • pp.91-96
    • /
    • 2010
  • Concentric mosaics are made with arranging and summing of video frames by using common spacial standards. Compared with previous works on 3-D wavelet transform coding, we have made important design considerations to enable flexible partial decoding and bit-stream random access. A just-in-time(JIT) rendering engine of the compressed concentric mosaic is developed. However, computationally, it is still demanding to accomplish the real-time rendering. Only the contents for specific scene representation are need to be decoded by maintaining compressed data. Thus our proposed algorithm is able to render real concentric mosaic by using lifting scheme instead of wavelet transform.

Performance Analysis of Coded FSK System for Multi-hop Wireless Sensor Networks (멀티 홉 무선 센서 네트워크를 위한 부호화된 FSK 시스템의 성능 해석)

  • Oh, Kyu-Tae;Roh, Jae-Sung
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.4
    • /
    • pp.408-414
    • /
    • 2007
  • Research advances in the areas of micro-sensor device and wireless network technology, has made it possible to develop energy efficient and low cost wireless sensor nodes. In this paper, the forward error control (FEC) scheme for lower power consumption and excellent BER(Bit Error Rate) performance during transmission propose in multi-hop wireless sensor network based on FSK modem. The FEC technique uses extra processing power related to encoding and decoding, it is need complex functions to be built into the sensor node. The probability of receiving a correct bit and codeword for relaying a frame over h nodes to the sink node is calculated as a function of channel parameter, number of hops, number of bits transmitted and the distance between the different nodes.

  • PDF

A Combining Scheme to Reduce Power Consumption in Cooperation and Cyclic Code for Wireless Sensor Networks (협력-순환 부호를 이용한 무선 센서 네트워크에서의 전력 소모 감소를 위한 결합기법에 관한 연구)

  • Kong, Hyung Yun;Hwang, Yun Kyeong;Hong, Seong Wook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.6
    • /
    • pp.63-69
    • /
    • 2008
  • In this paper, our goal is to find a power-effective protocol that improves the accuracy of transmission in sensor networks. Therefore we propose a cooperative communication protocol based on MRC(Maximal Ratio Combining) and cyclic code. In our proposal, one sensor node assists two others to communicate with a clusterhead that can get diversity effect and MRC can improve diversity effect also. The proposed protocol with cyclic code can correct error up to 3-bit and reduce decoding complexity compared with convolutional code. Simulation results reveal proposed protocol can save the network energy up to 6dB over single-hop protocol at BER(Bit Error Rate) of $10^{-2}$.

  • PDF

Demapping Algorithm for Applying the Multilevel Modulation Scheme to LDPC Decoding Based on DVB-S2 (DVB-S2 기반 LDPC 복호기의 멀티레벨 변조 방식 적용을 위한 디맵핑 알고리즘)

  • Jung Ji-Won;Jeong Jin-Hee;Kim Min-Hyuk
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.17 no.7 s.110
    • /
    • pp.615-622
    • /
    • 2006
  • DVB-S2 offers various coding rate and modulation schemes. Therefore this paper proposes bit split methods to applying to multilevel modulation. Log-likelihood ratio method splits multilevel symbols to soft decision symbols using the received in-phase and quadrature component based on Gaussian approximation. However it is too complicate to calculate and to implement hardware due to exponential and logarithm calculation. Therefore this paper presents Euclidean, MAX and Sector method to reduce the high complexity of LLR method.

Early Coding Unit-Splitting Termination Algorithm for High Efficiency Video Coding (HEVC)

  • Goswami, Kalyan;Kim, Byung-Gyu;Jun, Dongsan;Jung, Soon-Heung;Choi, Jin Soo
    • ETRI Journal
    • /
    • v.36 no.3
    • /
    • pp.407-417
    • /
    • 2014
  • A new-generation video coding standard, named High Efficiency Video Coding (HEVC), has recently been developed by JCT-VC. This new standard provides a significant improvement in picture quality, especially for high-resolution videos. However, one the most important challenges in HEVC is time complexity. A quadtree-based structure is created for the encoding and decoding processes and the rate-distortion (RD) cost is calculated for all possible dimensions of coding units in the quadtree. This provides a high encoding quality, but also causes computational complexity. We focus on a reduction scheme of the computational complexity and propose a new approach that can terminate the quadtree-based structure early, based on the RD costs of the parent and current levels. Our proposed algorithm is compared with HEVC Test Model version 10.0 software and a previously proposed algorithm. Experimental results show that our algorithm provides a significant time reduction for encoding, with only a small loss in video quality.

Decoding Brain States during Auditory Perception by Supervising Unsupervised Learning

  • Porbadnigk, Anne K.;Gornitz, Nico;Kloft, Marius;Muller, Klaus-Robert
    • Journal of Computing Science and Engineering
    • /
    • v.7 no.2
    • /
    • pp.112-121
    • /
    • 2013
  • The last years have seen a rise of interest in using electroencephalography-based brain computer interfacing methodology for investigating non-medical questions, beyond the purpose of communication and control. One of these novel applications is to examine how signal quality is being processed neurally, which is of particular interest for industry, besides providing neuroscientific insights. As for most behavioral experiments in the neurosciences, the assessment of a given stimulus by a subject is required. Based on an EEG study on speech quality of phonemes, we will first discuss the information contained in the neural correlate of this judgement. Typically, this is done by analyzing the data along behavioral responses/labels. However, participants in such complex experiments often guess at the threshold of perception. This leads to labels that are only partly correct, and oftentimes random, which is a problematic scenario for using supervised learning. Therefore, we propose a novel supervised-unsupervised learning scheme, which aims to differentiate true labels from random ones in a data-driven way. We show that this approach provides a more crisp view of the brain states that experimenters are looking for, besides discovering additional brain states to which the classical analysis is blind.

A Novel Relay Selection Technique with Decoded Information in Buffer-Aided Successive Relaying Systems (버퍼기반 연쇄적 중계시스템에서 복호 정보를 활용한 중계기 선택 알고리즘)

  • Lee, Byeong Su;Ban, Tae Won;Jung, Bang Chul
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.51-53
    • /
    • 2015
  • In this paper, we propose a new relay selection technique which utilizes interference cancellation with decoding information at multiple relays for buffer-aided successive relaying systems. The transmitting relay is selected if its own transmission to the destination is successful and the number of relays which can successfully decode the data from the source is the maximum at the same time. Simulation results show that the proposed relay selection technique significantly outperforms the conventional relay selection scheme in terms of outage probability.

  • PDF