• Title/Summary/Keyword: data encoding

Search Result 727, Processing Time 0.023 seconds

Mixed Dual-rail Data Encoding Method Proposal and Verification for Low Power Asynchronous System Design (저전력 비동기식 시스템 설계를 위한 혼합형 dual-rail data encoding 방식 제안 및 검증)

  • Chi, Huajun;Kim, Sangman;Park, Jusung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.7
    • /
    • pp.96-102
    • /
    • 2014
  • In this paper, we proposed new dual-rail data encoding that mixed 4-phase handshaking protocol and 2-phase handshaking protocol for asynchronous system design to reduce signal activities and power consumption. The dual-rail data encoding 4-phase handshaking protocol should leat to much signal activities and power consumption by return to space state. Ideally, the dual-rail data encoding 2-phase handshaking protocol should lead to faster circuits and lower power consumption than the dual-rail 4-phase handshaking protocol, but can not designed using standard library. We use a benchmark circuit that contains a multiplier block, an adder block, and latches to evaluate the proposed dual-rail data encoding. The benchmark circuit using the proposed dual-rail data encoding shows an over 35% reduction in power consumption with 4-phase dual-rail data encoding.

Accumulation Encoding Technique Based on Double Random Phase Encryption for Transmission of Multiple Images

  • Lee, In-Ho
    • Journal of the Optical Society of Korea
    • /
    • v.18 no.4
    • /
    • pp.401-405
    • /
    • 2014
  • In this paper, we propose an accumulation encoding scheme based on double random phase encryption (DRPE) for multiple-image transmission. The proposed scheme can be used for a low-complexity DRPE system due to the simple structure of the accumulation encoder and decoder. For accumulation encoding of multiple images, all of the previously encrypted data are added, and hence the accumulation encoding can improve the security of the DRPE-encrypted data. We present a scheme for encryption and decryption for DRPE-based accumulation encoding, and a method for accumulation encoding and decoding. Finally, simulation results verify that the DRPE-based accumulation encoding scheme for multiple images is powerful in terms of data security.

Wavelet Encoded MR Imaging (웨이블릿 부호화 자기공명영상)

  • Kim, Eung-Kyeu;Lee, Soo-Jong
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.343-346
    • /
    • 2005
  • In this study, a basic concept of wavelet encoding and its advantages over Fourier based phase encoding application. Wavelet encoding has been proposed as an alternative way to Fourier based phase encoding in magnetic resonance imaging. In wavelet encoding, the RF pulse is designed to generate wavelet-shaped excitation profile of spins. From the resulting echo signals, the wavelet transform coefficients of spin distribution are acquired and an original spin density is reconstructed from wavelet expansion. Wavelet encoding has several advantages over phase encoding. By minimizing redundancy of the data acquisition in a dynamic series of images, we can avoid some encoding steps without serious loss of quality in reconstructed image. This strategy may be regarded as data compression during imaging. Although there are some limitations in wavelet encoding, it is a promising scheme in a dynamic imaging.

  • PDF

Compression of time-varying volume data using Daubechies D4 filter (Daubechies D4 필터를 사용한 시간가변(time-varying) 볼륨 데이터의 압축)

  • Hur, Young-Ju;Lee, Joong-Youn;Koo, Gee-Bum
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02a
    • /
    • pp.982-987
    • /
    • 2007
  • The necessity of data compression scheme for volume data has been increased because of the increase of data capacity and the amount of network uses. Now we have various kinds of compression schemes, and we can choose one of them depending on the data types, application fields, the preferences, etc. However, the capacity of data which is produced by application scientists has been excessively increased, and the format of most scientific data is 3D volume. For 2D image or 3D moving pictures, many kinds of standards are established and widely used, but for 3D volume data, specially time-varying volume data, it is very difficult to find any applicable compression schemes. In this paper, we present a compression scheme for encoding time-varying volume data. This scheme is aimed to encoding time-varying volume data for visualization. This scheme uses MPEG's I- and P-frame concept for raising compression ratio. Also, it transforms volume data using Daubechies D4 filter before encoding, so that the image quality is better than other wavelet-based compression schemes. This encoding scheme encodes time-varying volume data composed of single precision floating-point data. In addition, this scheme provides the random reconstruction accessibility for an unit, and can be used for compressing large time-varying volume data using correlation between frames while preserving image qualities.

  • PDF

Encoding of XML Elements for Mining Association Rules

  • Hu Gongzhu;Liu Yan;Huang Qiong
    • The Journal of Information Systems
    • /
    • v.14 no.3
    • /
    • pp.37-47
    • /
    • 2005
  • Mining of association rules is to find associations among data items that appear together in some transactions or business activities. As of today, algorithms for association rule mining, as well as for other data mining tasks, are mostly applied to relational databases. As XML being adopted as the universal format for data storage and exchange, mining associations from XML data becomes an area of attention for researchers and developers. The challenge is that the semi-structured data format in XML is not directly suitable for traditional data mining algorithms and tools. In this paper we present an encoding method to encode XML tree-nodes. This method is used to store the XML data in Value Table and Transaction Table that can be easily accessed via indexing. The hierarchical relationship in the original XML tree structure is embedded in the encoding. We applied this method to association rules mining of XML data that may have missing data.

  • PDF

Modeling and Simulation of New Encoding Schemes for High-Speed UHF RFID Communication

  • Mo, Sang-Hyun;Bae, Ji-Hoon;Park, Chan-Won;Bang, Hyo-Chan;Park, Hyung Chul
    • ETRI Journal
    • /
    • v.37 no.2
    • /
    • pp.241-250
    • /
    • 2015
  • In this paper, we present novel high-speed transmission schemes for high-speed ultra-high frequency (UHF) radio-frequency identification communication. For high-speed communication, tags communicate with a reader using a high-speed Miller (HS-Miller) encoding and multiple antennas, and a reader communicates with tags using extended pulse-interval encoding (E-PIE). E-PIE can provide up to a two-fold faster data rate than conventional pulse-interval encoding. Using HS-Miller encoding and orthogonal multiplexing techniques, tags can achieve a two- to three-fold faster data rate than Miller encoding without degrading the demodulation performance at a reader. To verify the proposed transmission scheme, the MATLAB/Simulink model for high-speed backscatter based on an HS-Miller modulated subcarrier has been designed and simulated. The simulation results show that the proposed transmission scheme can achieve more than a 3 dB higher BER performance in comparison to a Miller modulated subcarrier.

Steganographic Model based on Low bit Encoding for VoIP (VoIP 환경을 위한 Low bit Encoding 스테가노그라픽 모델)

  • Kim, Young-Mi
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.141-150
    • /
    • 2007
  • This paper proposes new Steganographic model for VoIP that has very effective method using low bit encoding. Most of Steganographic models using Low bit Encoding have two disadvantages; one is that the existence of hidden secret message can be easily detected by auditory, the other is that the capacity of stego data is low. To solve these problems, this method embed more than one bit in inaudible range, so this method can improve the capacity of the hidden message in cover data. The embedding bit position is determined by using a pseudo random number generator which has seed with remaining message length, so it is hard to detect the stego data produced by the proposed method. This proposed model is able to use not only to communicate wave file with hidden message in VoIP environment but also to hide vary information which is user basic information, authentication system, etc.

  • PDF

Design of Data Encoding Algorithm for a Two Dimensional Bar Code (2차원 바코드를 위한 데이터 부호화 알고리즘 설계)

  • Jeon, Seong-Goo;Kim, Il-Hwan
    • Journal of Industrial Technology
    • /
    • v.25 no.B
    • /
    • pp.171-174
    • /
    • 2005
  • In this paper, we propose a new data encoding algorithm for a two-dimensional bar code system. In general, the one-dimensional bar code is just a key which can access detailed information to the host computer database. But the two-dimensional bar code is a new technology which can obtain high density information without access to the host computer database. We implemented the encoding algorithm for Data Matrix bar code which is the most widely used among the many kinds of two-dimensional bar codes in the field of marking using Digital Signal Processor (TMS320C31). The performance of the proposed algorithm is verified by comparing the imprinted symbols on the steel surfaces with the codes which are decoded by a bar code reader.

  • PDF

Design of Data Encoding Algorithm for the Two Dimensional Barcode (2차원 바코드를 위한 데이터 부호화 알고리즘 설계)

  • Jeon, Seong-Goo;Her, Nam-Euk;Kim, Il-Hwan
    • Proceedings of the KIEE Conference
    • /
    • 2005.05a
    • /
    • pp.173-175
    • /
    • 2005
  • In this paper, we propose a data encoding algorithm for two-dimensional barcode system. In general, one-dimensional barcode is just a key which can access detailed information to the host computer database. But the two-dimensional barcode is a new technology which can obtain high density information without access to the host computer database. We implemented encoding algorithm for Data Matrix Barcode which is the most widely used among the many kind of two-dimensional barcodes. And we marked to a real object using Digital Signal Processor(DSP) Marking System. The performance of proposed algorithm is verified through the result of marking work.

  • PDF

Power analysis attack resilient block cipher implementation based on 1-of-4 data encoding

  • Shanmugham, Shanthi Rekha;Paramasivam, Saravanan
    • ETRI Journal
    • /
    • v.43 no.4
    • /
    • pp.746-757
    • /
    • 2021
  • Side-channel attacks pose an inevitable challenge to the implementation of cryptographic algorithms, and it is important to mitigate them. This work identifies a novel data encoding technique based on 1-of-4 codes to resist differential power analysis attacks, which is the most investigated category of side-channel attacks. The four code words of the 1-of-4 codes, namely (0001, 0010, 1000, and 0100), are split into two sets: set-0 and set-1. Using a select signal, the data processed in hardware is switched between the two encoding sets alternately such that the Hamming weight and Hamming distance are equalized. As a case study, the proposed technique is validated for the NIST standard AES-128 cipher. The proposed technique resists differential power analysis performed using statistical methods, namely correlation, mutual information, difference of means, and Welch's t-test based on the Hamming weight and distance models. The experimental results show that the proposed countermeasure has an area overhead of 2.3× with no performance degradation comparatively.