• Title/Summary/Keyword: 레벨3

Search Result 1,707, Processing Time 0.026 seconds

Modulation Code for Removing Error Patterns on 4-Level NAND Flash Memory (4-레벨 낸드 플래시 메모리에서 오류 발생 패턴 제거 변조 부호)

  • Park, Dong-Hyuk;Lee, Jae-Jin;Yang, Gi-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12C
    • /
    • pp.965-970
    • /
    • 2010
  • In the NAND flash memory storing two bits per cell, data is discriminated among four levels of electrical charges. We refer to these four levels as E, P1, P2, and P3 from the low voltage. In the statistics, many errors occur when E and P3 are stored at the next cells. Therefore, we propose a coding scheme for avoiding E-P3 or P3-E data patterns. We investigate two modulation codes for 9/10 code (9 bit input and 5 symbol codeword) and 11/12 code (11 bit input and 6 symbol codeword).

Neutral-Point Voltage Compensation of Grid-Connected 3-Level T-type Inverter (계통연계형 3-레벨 T-type 인버터의 중성점 전압 불평형 보상)

  • Park, kwannam
    • Proceedings of the KIPE Conference
    • /
    • 2016.07a
    • /
    • pp.483-484
    • /
    • 2016
  • 3-레벨 T-type 인버터는 DC-Link 전압을 중성점을 기준으로 상, 하단 두 개의 커패시터로 나누어 사용한다. 이때 두 커패시터의 특성이 일치하지 않거나 스위칭 동작 패턴에 따라 불평형이 생겨 인버터 출력에 왜곡이 발생한다. 이러한 왜곡으로 인해 인버터 성능이 저하되고, 심해질 경우 스위칭 소자에 손상을 발생시킨다. 본 논문은 불평형 전압 차이를 간략화된 공간 벡터 변조 기법을 이용해 스위칭 시간을 보상하는 방법을 제안한다. 제안된 방법은 시뮬레이션을 사용하여 타당성을 검증하였다.

  • PDF

PWM Control Method for DC link Voltage Balancing and Leakage Current Reduction in 3-level Inverter (3-레벨 인버터의 DC 링크 전압 밸런싱과 누설전류 저감을 위한 PWM 제어방법)

  • Choi, Nam-Sup;Lee, Eun-Chul;Ahn, Kang-Soon
    • Proceedings of the KIPE Conference
    • /
    • 2015.11a
    • /
    • pp.137-138
    • /
    • 2015
  • 본 논문에서는 3-레벨 인버터 시스템의 DC 링크 전압 밸런싱과 동시에 공통모드 전압의 변동주파수를 최소화 하여 누설 전류를 저감하는 새로운 PWM 방법을 제안한다. 제안된 PWM은 공통모드전압과 중간점 제어능력에 따라 공간벡터를 분류하고 중간점 전압을 제어하면서 공통모드 전압의 변동이 최소화되는 벡터를 선택하도록 구성한다. 본 논문에서는 시뮬레이션을 통하여 제안된 PWM의 동작을 입증하였다.

  • PDF

The Effect of Seismic Level Increase on the Reactor Vessel Internals and Fuel Assemblies for the Korean Standard Suclear Power Plant (지진레벨의 증가가 한국표준형 원자력발전소의 원자로 내부구조물 및 핵연 료 집합체에 미치는 영향)

  • Jhung, M. J.
    • Journal of KSNVE
    • /
    • v.7 no.1
    • /
    • pp.33-41
    • /
    • 1997
  • To cover a range of possible site conditions where the Korean standard nuclear power plant may be constructed, a range of generic site conditions is selected for geologic and seismologic evaluation. To envelop other Asian countries as well as the Korean peninsula, there is an attempt to increase the seismic level to 0.3g ground motions for the safe shutdown earthquake. The dynamic analyses of the reactor vessel internals and fuel assemblies are performed for the increased motions and the effect of seismic level on the response is investigated. Also the nonlinear response characteristics are discussed by comparing the loads between operating basis earthquake and safe shutdown earthquake excitations. The design adequacy of the reactor vessel internals and fuel assemblies for the increased seismic level is addressed.

  • PDF

A Study on Efficient Decoding of Huffman Codes (허프만 코드의 효율적인 복호화에 관한 연구)

  • Park, Sangho
    • Journal of IKEEE
    • /
    • v.22 no.3
    • /
    • pp.850-853
    • /
    • 2018
  • In this paper, we propose a decoding method using a balanced binary tree and a canonical Huffman tree for efficient decoding of Huffman codes. The balanced binary tree scheme reduces the number of searches by lowering the height of the tree and binary search. However, constructing a tree based on the value of the code instead of frequency of symbol is a drawback of the balanced binary tree. In order to overcome these drawbacks, a balanced binary tree is reconstructed according to the occurrence probability of symbols at each level of the tree and binary search is performed for each level. We minimize the number of searches using a canonical Huffman tree to find level of code to avoid searching sequentially from the top level to bottom level.

Clustering Technique Using a Node and Level of XML tree (XML 트리의 노드와 레벨을 사용한 군집화 방법)

  • Kim, Woosaeng
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.3
    • /
    • pp.649-655
    • /
    • 2013
  • Recently, researches are studied in developing efficient techniques for accessing, querying, and managing XML documents which are frequently used in the Internet. In this paper, we propose a new method to cluster XML documents efficiently. An element and an inclusion relationship of a XML document corresponds to a node and a level of the corresponding tree, respectively. Therefore, when two XML documents are similar then their nodes' names and levels of the corresponding trees are also similar. In this paper, we cluster XML documents by using nodes' names and levels of the corresponding tree as a feature of a document. The experiment shows that our proposed method has a good performance.

4-Level 4/6 Modulation Code with Trellis Encoding on Holographic Data Storage (홀로그래픽 데이터 저장장치에서 트렐리스 인코딩을 이용한 4-레벨 4/6 변조부호)

  • Jeong, Seongkwon;Lee, Jaejin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.6
    • /
    • pp.11-16
    • /
    • 2017
  • Multi-level holographic data storage requires modulation codes for avoiding two dimensional inter-symbol interference (2D-ISI). Modulation codes can remove the fatal ISI pattern of neighboring the largest and the smallest symbols. In this paper, we propose a 4-level 4/6 modulation code and its trellis encoding for error correction. The proposed 4/6 modulation code prevents that the symbol 0 and 3 are not adjacent in any direction. Also, we compare the proposed modulation code with the same code rate modulation codes for four-level holographic data storage.

Instance-Level Subsequence Matching Method based on a Virtual Window (가상 윈도우 기반 인스턴스 레벨 서브시퀀스 매칭 방안)

  • Ihm, Sun-Young;Park, Young-Ho
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.2
    • /
    • pp.43-46
    • /
    • 2014
  • A time-series data is the collection of real numbers over the time intervals. One of the main tasks in time-series data is efficiently to find subsequences similar to a given query sequence. In this paper, we propose an efficient subsequence matching method, which is called Instance-Match (I-Match). I-Match constructs a virtual window in order to reduce false alarms. Through the experiment with real data set and query sets, we show that I-Match improves query processing time by up to 2.95 times and significantly reduces the number of candidates comparing to Dual Match.

A Study on the Analysis of Autonomous Nerve System Response for the Computational Task (연산 작업에 대한 자율 신경계의 반응에 대한 연구)

  • Ha, Eun-Ho;Park, Gwang-Hoon;Kim, Dong-Youn;Rim, Young-Hoon;Ko, Han-Woo;Kim, Dong-Sun
    • Science of Emotion and Sensibility
    • /
    • v.3 no.1
    • /
    • pp.63-71
    • /
    • 2000
  • 본 연구에서는 20대의 건강한 남자대학생 45명을 대상으로 작업조건(안정상태, 연산작업상태, 휴식상태, 반복연산작업상태, 연산작업후 아정상태)과 연산레벨(연산작업의 난이도)에 따른 생리신호의 측정을 위한 실험 프로토콜을 제안하고 측정된 생리신호에 대한 분석을 하였다. 연산작업에 대하여 측정된 파라메터에 대하여 1) 정규분포화를 위한 파라메터의 변환 2) 파라메터간의 산관관계의 조사 3) 연산작업에 대한 파라메터의 표준화 4) 작업조건과 연산레벨에 대한 파라메터의 차이에 대한 유의성검정을 하여 연산스트레스를 평가할 수 있는 파라메터를 추출하였다. 연산작업시의 파라메터는 안정산태의 파라메터와 유의적인 차이를 나타내어 연구에 사용된 연산작업이 생리신호의 변화를 발생시키는 것으로 밝혀졌고 연산작업후의 휴식상태에서 측정된 대부분의 파라메터의 갓이 연산작업전의 안정상태의 파라메터의 통계적으로 유의적인 차이가 없어서 본 연구에 사용된 연산작업은 단기적 스트레스를 유발하는 것으로 밝혀졌다. 그리고, 동일한 연산레벨에 대한 연산작업을 반복하더라도 파라메터의 값은 처음으로 연산작업을 할 때의 파라메터의 값과 유의적인 차이가 없었다. 그러나, 연산레벨에 따라서는 Heart Rate, HRV의 LF/HF, HRV의 MF/(LF+HF), Return Map의 분산, 코끝의 Mean Temperature, GSR-Mean과 호흡수는 차이가 있는 것으로 밝혀졌다. 따라서 이들 파라메터를 사용하면 연산스트레스의 강도를 지수화할 수 있을 것이다.

  • PDF

Investigation of Minimum Number of Drop Levels and Test Points for FWD Network-Level Testing Protocol in Iowa Department of Transportation (아이오와 주 교통국의 FWD 네트워크 레벨 조사 프로토콜을 위한 최소 하중 재하 수와 조사지점 수의 결정)

  • Kim, Yong-Joo;Lee, Ho-Sin(David);Omundson, Jason S.
    • International Journal of Highway Engineering
    • /
    • v.12 no.4
    • /
    • pp.39-46
    • /
    • 2010
  • In 2007, Iowa department of transportation (DOT) initiated to run the falling weight deflectometer (FWD) network-level testing along Iowa highway and road systems and to build a comprehensive database of deflection data and subsequent structural analysis, which are used for detecting pavement structure failure, estimating expected life, and calculating overlay requirements over a desired design life. Iowa's current FWD networklevel testing protocol requires that pavements are tested at three-drop level with 8-deflection basin collected at each drop level. The test point is determined by the length of the tested pavement section. However, the current FWD network-level program could cover about 20% of Iowa's highway and road systems annually. Therefore, the current FWD network-level test protocol should be simplified to test more than 20% of Iowa's highway and road systems for the network-level test annually. The main objective of this research is to investigate if the minimum number of drop levels and test points could be reduced to increase the testing production rate and reduce the cost of testing and traffic control without sacrificing the quality of the FWD data. Based upon the limited FWD network-level test data of eighty-three composite pavement sections, there was no significant difference between the mean values of three different response parameters when the number of drop levels and test points were reduced from the current FWD network-level testing protocol. As a result, the production rate of FWD tests would increase and the cost of testing and traffic control would be decreased without sacrificing the quality of the FWD data.