• Title/Summary/Keyword: data coding

Search Result 1,702, Processing Time 0.031 seconds

Data Coding Scheme to Reduce Power Consumption and EMI in LCD Driving Systems (LCD 구동 시스템에서 전력 소비 및 전자기 장애를 줄이기 위한 데이타 코딩 방법)

  • Choi, Chul-Ho;Choi, Myung-Ryul
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.6
    • /
    • pp.628-634
    • /
    • 2000
  • We propose a data coding scheme for reducing' power consumption and ElVII in transmitting a sequence of data from LCD controller to LCD driver. The proposed coding scheme makes use of reducing data transitions in general text image of PC. It can be implemented with a little hardware and applied to the real-time applications of LCD driving system. We have executed computer simulations of the proposed coding scheme and compared the results of the proposed scheme with those produced by the existing coding schemes. The proposed coding scheme, compared to the existing ones, reduces the switching activity significantly in both of text and picture images.

  • PDF

Shuffled Discrete Sine Transform in Inter-Prediction Coding

  • Choi, Jun-woo;Kim, Nam-Uk;Lim, Sung-Chang;Kang, Jungwon;Kim, Hui Yong;Lee, Yung-Lyul
    • ETRI Journal
    • /
    • v.39 no.5
    • /
    • pp.672-682
    • /
    • 2017
  • Video compression exploits statistical, spatial, and temporal redundancy, as well as transform and quantization. In particular, the transform in a frequency domain plays a major role in energy compaction of spatial domain data into frequency domain data. The high efficient video coding standard uses the type-II discrete cosine transform (DCT-II) and type-VII discrete sine transform (DST-VII) to improve the coding efficiency of residual data. However, the DST-VII is applied only to the Intra $4{\times}4$ residual block because it yields relatively small gains in the larger block than in the $4{\times}4$ block. In this study, after rearranging the data of the residual block, we apply the DST-VII to the inter-residual block to achieve coding gain. The rearrangement of the residual block data is similar to the arrangement of the basis vector with a the lowest frequency component of the DST-VII. Experimental results show that the proposed method reduces the luma-chroma (Cb+Cr) BD rates by approximately 0.23% to 0.22%, 0.44% to 0.58%, and 0.46% to 0.65% for the random access, low delay B, and low delay P configurations, respectively.

Forward Error Control Coding in Multicarrier DS/CDMA Systems

  • Lee, Ju-Mi;Iickho Song;Lee, Jooshik;Park, So-Ryoung
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.140-143
    • /
    • 2000
  • In this paper, forward error control coding in multicarrier direct sequence code division multiple access (DS/CDMA) systems is considered. In order to accommodate a number of coding rates easily and make the encoder and do-coder structure simple, we use the rate compatible punctured convolutional (RCPC) code. We obtain data throughputs at several coding rates and choose the coding rate which has the highest data throughput in the SINR sense. To achieve maximum data throughput, a rate adaptive system using channel state information (the SINR estimate) is proposed. The SINR estimate is obtain by the soft decision Viterbi decoding metric. We show that the proposed rate adaptive convolutionally coded multicarrier DS/CDMA system can enhance spectral efficiency and provide frequency diversity.

  • PDF

A Network Coding-Aware Routing Mechanism for Time-Sensitive Data Delivery in Multi-Hop Wireless Networks

  • Jeong, Minho;Ahn, Sanghyun
    • Journal of Information Processing Systems
    • /
    • v.13 no.6
    • /
    • pp.1544-1553
    • /
    • 2017
  • The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.

Topology-Based Flow-Oriented Adaptive Network Coding-Aware Routing Scheme for VANETs

  • Iqbal, Muhammad Azhar;Dai, Bin;Islam, Muhammad Arshad;Aleem, Muhammad;Vo, Nguyen-Son
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2044-2062
    • /
    • 2018
  • Information theory progression along with the advancements being made in the field of Vehicular Ad hoc NETworks (VANETs) supports the use of coding-aware opportunistic routing for efficient data forwarding. In this work, we propose and investigate an adaptive coding-aware routing scheme in a specific VANET scenario known as a vehicular platoon. Availability of coding opportunities may vary with time and therefore, the accurate identification of available coding opportunities at a specific time is a quite challenging task in the highly dynamic scenario of VANETs. In the proposed approach, while estimating the topology of the network at any time instance, a forwarding vehicle contemplates the composition of multiple unicast data flows to encode the correct data packets that can be decoded successfully at destinations. The results obtained by using OMNeT++ simulator reveal that higher throughput can be achieved with minimum possible packet transmissions through the proposed adaptive coding-aware routing approach. In addition, the proposed adaptive scheme outperforms static transmissions of the encoded packets in terms of coding gain, transmission percentage, and encoded packet transmission. To the best of our knowledge, the use of coding-aware opportunistic routing has not been exploited extensively in available literature with reference to its implications in VANETs.

A Study on LIFS Image Coding via Gram-Schmidt Orthogonalization - Fast Coding Algorithm - (Gram-Schmidt 직교화를 이용한 LIFS 영상 부호화법에 관한 연구 -부호화 고속 알고리즘-)

  • 유현배
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.4 no.2
    • /
    • pp.96-101
    • /
    • 2003
  • Recently, Fractal Image Coding has been studied as a way of efficient data compressing scheme. In the beginning, Fractal Image Coding has been studied for the data compressing in black & white images and linear images. A. E. Jacquin suggested LIFS which expends to Fractal Image Coding for a gray scale image. Currently, YTKT's LIFS scheme which is using Gram-Schmidt is so efficient that enough to compete with the JPEG which is the national standards. This paper investigates the way of greatly reduced calculation for the orthogonalization algorithm.

  • PDF

Modified parity coding for digital holographic data storage system with spatial beam intensity variations (공간적 빔 세기 불 균일성을 가지는 디지털 홀로그래픽 데이터 저장 시스템을 위한 수정된 패리티 코딩)

  • Choi, An-Sik;Jun, Young-Sik;Baek, Woon-Sik
    • Korean Journal of Optics and Photonics
    • /
    • v.14 no.2
    • /
    • pp.150-154
    • /
    • 2003
  • In this paper, we introduce modified parity coding methods to reduce the errors caused by spatial beam intensity variations in a holographic data storage system. We explained the encoding and decoding process of the conventional parity coding and the modified parity coding techniques. We compared the bit-error-rate (BER) performances of the conventional parity coding and the modified parity coding techniques from experimental evaluation.

PPNC: Privacy Preserving Scheme for Random Linear Network Coding in Smart Grid

  • He, Shiming;Zeng, Weini;Xie, Kun;Yang, Hongming;Lai, Mingyong;Su, Xin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1510-1532
    • /
    • 2017
  • In smart grid, privacy implications to individuals and their families are an important issue because of the fine-grained usage data collection. Wireless communications are utilized by many utility companies to obtain information. Network coding is exploited in smart grids, to enhance network performance in terms of throughput, delay, robustness, and energy consumption. However, random linear network coding introduces a new challenge for privacy preserving due to the encoding of data and updating of coefficients in forwarder nodes. We propose a distributed privacy preserving scheme for random linear network coding in smart grid that considers the converged flows character of the smart grid and exploits a homomorphic encryption function to decrease the complexities in the forwarder node. It offers a data confidentiality privacy preserving feature, which can efficiently thwart traffic analysis. The data of the packet is encrypted and the tag of the packet is encrypted by a homomorphic encryption function. The forwarder node random linearly codes the encrypted data and directly processes the cryptotext tags based on the homomorphism feature. Extensive security analysis and performance evaluations demonstrate the validity and efficiency of the proposed scheme.

Performance Evaluation of DC-Suppression GS Coding for the Holographic Data Storage Using Integer Programming Models (정수계획법 모형을 이용한 홀로그래픽 저장장치의 DC-억압 GS코딩의 성능평가)

  • Park, Taehyung;Lee, Jaejin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.8
    • /
    • pp.650-655
    • /
    • 2013
  • For the DC-free encoding of source data, the Guided Scrambling (GS) technique is widely used as multi-mode coding in the optical data storage system. For DC-suppression GS coding in the holographic data storage system, the conservative array and balanced coding criteria are proposed. In this paper, equivalent integer programming models are developed to determine the optimal control bits for the minimum digital sum value (MDSV), conservative array, and balanced coding criteria. Using the proposed integer programming models, we compare the performance of GS encoding for the various combination of control bit/array sizes and scrambling polynomials.

(0, k) Run-Length Limited(RLL) Data Compression Codes for Digital Storage Systems (디지털 저장시스템을 위한 (0, k) RLL 데이터 압축토드)

  • 이재진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.9
    • /
    • pp.2074-2079
    • /
    • 1997
  • Much recent work has been done in the two related areas of source coding for data compression, and channel coding for data storage, respectively. We propose two (0, k) run-lengh limited(RLL) data compression codes for the storage that combine source and channel coding. It was shown that the propsoed codes approach the maximum code rate of (0, k) code as k increase. Thus, the overall code rate of storage system can be increased by using the combined source/channel coding as compared to the conventional 8/9 code which is popular in hard drive systems Functhermore, one can also reduce the complexity of modulation coding procedure by using already RLL constrained data.

  • PDF