• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2013년도 제48차 하계학술발표논문집 21권2호
• /
• 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
• /
• 제18권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학회:학술대회논문집
• /
• 한국HCI학회 2007년도 학술대회 1부
• /
• 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
• /
• 제34권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.

• 정보관리연구
• /
• 제36권3호
• /
• pp.27-49
• /
• 2005

과학기술정보 서비스를 위한 메타데이터 작업에서 특수문자의 표기법은 항상 중요한 문제였다. 그러므로 본 연구에서는 특수문자의 표기법의 표준화를 위한 방안을 모색하는 작업을 하였다. 이를 위하여, KISTI의 YesKisti에 나타난 특수문자의 다양한 표기사례를 조사하고, 특수문자 표기문제를 표준화의 관점에서 관련된 주요한 현안과 표준동향을 검토하였다. 그런 다음 국내 환경에서, 과학기술정보 특수문자 표기의 표준화를 위한 요건과 과제를 도출하였다.

• 대한전자공학회논문지SD
• /
• 제44권1호
• /
• pp.36-44
• /
• 2007

본 논문은 Delay-Insensitive(DI) 지연 모델을 갖는 비동기식 회로에 3치 전압 레벨을 사용한 하이브리드 터너리 데이터 전송 방식을 제안하고, 이를 이용하여 다양한 비동기 프로토콜과의 데이터 송신 및 수신을 위한 래퍼를 설계하였다. 제안된 하이브리드 터너리 데이터 전송 방식은 기존의 2 선식 전송 방식이나 1-of-4 전송 방식에 비해 데이터 전송선을 50% 줄일 수 있으며, 터너리 전송 방식과 비교하였을 때도 50%의 신호 천이 감소 결과를 보였다. 본 논문에서는 $0.18-{\mu}m$ CMOS 공정을 적용하여 래퍼를 설계하고 검증하였다. 하이브리드 터너리 전송 방식이 적용된 래퍼는 2 GHz 이상의 속도로 동작 하였으며 2 선식, 1-of-4, 그리고 터너리 전송 방식에 비해 각각 65%, 43%, 36%의 소비 전력이 줄어든 결과를 보였다. 제안된 전송 방식과 설계된 래퍼 회로는 비동기식 고속 및 저전력 인터페이스로 사용 가능하다.

• ETRI Journal
• /
• 제37권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.

• 한국전자통신학회논문지
• /
• 제9권4호
• /
• pp.403-408
• /
• 2014

본 논문에서 우리는 저밀도 부호의 부호화 문제를 고찰한다. 특히 순환 치환 행렬을 이용한 저밀도 부호의 고속 부호화 알고리즘을 제시하였다. 고속 부호화 알고리즘은 고속 Hadamard 변환과 유사하며 결과적으로 제안 기법은 저밀도 부호의 간단하며 고속화된 부호화 알고리즘임을 보여주고 있다.

• 한국전자통신학회논문지
• /
• 제7권2호
• /
• pp.317-325
• /
• 2012

본 논문에서 우리는 LDPC 부호의 부호화 문제를 고려한다. 특히 재킷 패턴과 순환 치환 행렬을 사용함으로써 리차드슨의 하삼각 행렬과 유사한 간단한 LDPC 부호를 제안한다. 이 부호화 기법은 다양한 부호율을 갖도록 확장할 수 있다. 또한 단순한 행렬 처리에 근거하여 다양한 부호율을 갖는 복잡도가 낮고 간단한 부호기를 설계할 수 있다.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2006년도 하계학술대회
• /
• 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.