• Proceedings of the Korean Society of Computer Information Conference
• /
• 2013.07a
• /
• pp.97-99
• /
• 2013

Although UCI Identification metadata is not represented in the UCI syntax, it means a set of elements that enable users to easily and quickly identify. Against this backdrop, we research on how to design identification metadata for UCI. First of all, we check ISO/IEC 11179 and compare this with UCI properties. And then we defines nine components (such as UCI, Identifier, Title, Type, Mode, Format, Contributor, ContributorEntitiy, and ContributorRole) as elements of the identification metadata and establish encoding scheme with several parts (such as List of Encoding Scheme, Encoding Scheme of Identifier, Encoding Scheme of Type, Encoding Scheme of Mode, Encoding Scheme of Format, and Encoding Scheme of ContributorRole).

• 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.

• 한국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.

• ETRI Journal
• /
• v.34 no.5
• /
• pp.719-726
• /
• 2012

Messages are generally selected with the same probability in the encoding scheme of rateless codes for equal error protection. In addition, a belief propagation (BP) decoding scheme is generally used because of the low computational complexity. However, the probability of recovering a new message by BP decoding is reduced if both the recovered and unrecovered messages are selected uniformly. Thus, more codeword symbols than expected are required for the perfect recovery of message symbols. Therefore, a new encoding scheme with a nonuniform selection of messages is proposed in this paper. In addition, a BP-Gaussian elimination hybrid decoding scheme that complements the drawback of the BP decoding scheme is proposed. The performances of the proposed schemes are analyzed and compared with those of the conventional schemes.

• Journal of Information Management
• /
• v.36 no.3
• /
• pp.27-49
• /
• 2005

The encoding schemes of special characters in science & technology information services are always serious matters. Therefore, this paper draw up a general plan for encoding scheme of special characters related in some way. For this work, I have made an investigation into encoding cases of KISTI'S YesKisti service. And I have reviewed the important issues and standardization trends. Finally, this study proposes some requisites and problems for encoding scheme standard of special characters in science & technology information services.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.1
• /
• pp.36-44
• /
• 2007

This paper presented a hybrid ternary encoding scheme using 3-valued logic. It can adapt to the delay-insensitive(DI) model. We designed an asynchronous wrapper for the hybrid ternary encoding scheme to communicate with various asynchronous encoding schemes. It reduced about 50% of transmission lines and power consumption compared with the conventional 1-of-4 and ternary encoding scheme. The proposed wrappers were designed and simulated using the $0.18-{\mu}m$ standard CMOS technology. As a result, the asynchronous wrapper operated over 2 GHz communicating with a system bus. Moreover, the power dissipation of the system bus adapted the hybrid ternary encoding logic decreases 65%, 43%, and 36% of the dual-rail, 1-of-4, and ternary encoding scheme, respectively. The proposed data encoding scheme and the wrapper circuit can be useful for asynchronous high-speed and low-power asynchronous interface.

• 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.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.4
• /
• pp.403-408
• /
• 2014

In this paper, we consider the encoding scheme of low density codes. In particular, we propose the fast encoding algorithm of the low density codes using circulant permutation matrices, The fast encoding algorithm is similar to the fast Hadamard transform, and the results show that the proposed scheme is a simple and fast encoding algorithm of the low density codes.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.317-325
• /
• 2012

In this paper, we consider the encoding scheme of Low Density Parity Check codes. In particular, using the Jacket Pattern and circulant permutation matrices, we propose the simple encoding scheme of Richardson's lower triangular matrix. These encoding scheme can be extended to a flexible code rate. Based on the simple matrix process, also we can design low complex and simple encoders for the flexible code rates.

• 한국정보통신설비학회:학술대회논문집
• /
• 2006.08a
• /
• pp.255-258
• /
• 2006

In the H.264/AVC standard, intra prediction increases the coding efficiency of intra macroblocks and by applying rate-distortion optimization to each macroblock, it is possible to choose Inter or Intra encoding adaptively. This sort of encoding scheme, however, increases encoding complexity dramatically and causes troubles in practical applications of the real-time mobile environment. In order to decrease the complexity, variety of methods is proposed but most of those take only its current block into consideration for selecting candidate modes which naturally causes degradation in PSNR (Peak Signal to Noise Ratio). The proposed fast intra mode decision finds the candidate modes by analyzing transformed coefficients of neighboring blocks stored in the buffer at the encoder stage of input sequences. We verify this proposed scheme in complexity, PSNR and bit-rate.