• Title/Summary/Keyword: bi-level

Search Result 502, Processing Time 0.029 seconds

Detection of Stuck-Open Faults in BiCMOS Circuits using Gate Level Transition Faults (게이트 레벨 천이고장을 이용한 BiCMOS 회로의 Stuck-Open 고장 검출)

  • 신재흥;임인칠
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.12
    • /
    • pp.198-208
    • /
    • 1995
  • BiCMOS circuit consist of CMOS part which constructs logic function, and bipolar part which drives output load. Test to detect stuck-open faults in BiCMOS circuit is important, since these faults do sequential behavior and are represented as transition faults. In this paper, proposes a method for efficiently detecting transistor stuck-open faults in BiCMOS circuit by transforming them into slow-to=rise transition and slow-to-fall transition. In proposed method, BiCMOS circuit is transformed into equivalent gate-level circuit by dividing it into pull-up part which make output 1, and pull-down part which make output 0. Stuck-open faults in transistor are modelled as transition fault in input line of gate level circuit which is transformed from given circuit. Faults are detceted by using pull-up part gate level circuit when expected value is '01', or using pull-down part gate level circuit when expected value is '10'. By this method, transistor stuck-open faults in BiCMOS circuit are easily detected using conventional gate level test generation algorithm for transition fault.

  • PDF

An Efficient Voice Activity Detection Method using Bi-Level HMM (Bi-Level HMM을 이용한 효율적인 음성구간 검출 방법)

  • Jang, Guang-Woo;Jeong, Mun-Ho
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.8
    • /
    • pp.901-906
    • /
    • 2015
  • We presented a method for Vad(Voice Activity Detection) using Bi-level HMM. Conventional methods need to do an additional post processing or set rule-based delayed frames. To cope with the problem, we applied to VAD a Bi-level HMM that has an inserted state layer into a typical HMM. And we used posterior ratio of voice states to detect voice period. Considering MFCCs(: Mel-Frequency Cepstral Coefficients) as observation vectors, we performed some experiments with voice data of different SNRs and achieved satisfactory results compared with well-known methods.

Wafer-Level MEMS Capping Process using Electrodeposition of Ni Cap and Debonding with SnBi Solder Layer (Ni 캡의 전기도금 및 SnBi 솔더 Debonding을 이용한 웨이퍼 레벨 MEMS Capping 공정)

  • Choi, J.Y.;Lee, J.H.;Moon, J.T.;Oh, T.S.
    • Journal of the Microelectronics and Packaging Society
    • /
    • v.16 no.4
    • /
    • pp.23-28
    • /
    • 2009
  • We investigated the wafer-level MEMS capping process for which cavity formation in Si wafer was not required. Ni caps were formed by electrodeposition on 4" Si wafer and Ni rims of the Ni caps were bonded to the Cu rims of bottom Si wafer by using epoxy. Then, top Si wafer was debonded from the Ni cap structures by using SnBi layer of low melting temperature. As-evaporated SnBi layer was composed of double layers of Bi and Sn due to the large difference in vapor pressures of Bi and Sn. With keeping the as-evaporated SnBi layer at $150^{\circ}C$ for more than 15 sec, SnBi alloy composed of eutectic phase and Bi-rich $\beta$ phase was formed by interdiffusion of Sn and Bi. Debonding between top Si wafer and Ni cap structures was accomplished by melting of the SnBi layer at $150^{\circ}C$.

  • PDF

Application of Adaptive Particle Swarm Optimization to Bi-level Job-Shop Scheduling Problem

  • Kasemset, Chompoonoot
    • Industrial Engineering and Management Systems
    • /
    • v.13 no.1
    • /
    • pp.43-51
    • /
    • 2014
  • This study presents an application of adaptive particle swarm optimization (APSO) to solving the bi-level job-shop scheduling problem (JSP). The test problem presented here is $10{\times}10$ JSP (ten jobs and ten machines) with tribottleneck machines formulated as a bi-level formulation. APSO is used to solve the test problem and the result is compared with the result solved by basic PSO. The results of the test problem show that the results from APSO are significantly different when compared with the result from basic PSO in terms of the upper level objective value and the iteration number in which the best solution is first identified, but there is no significant difference in the lower objective value. These results confirmed that the quality of solutions from APSO is better than the basic PSO. Moreover, APSO can be used directly on a new problem instance without the exercise to select parameters.

Restoration of a Bi-level Waveform by Estimation of Edge Locations (에지 위치 추정을 통한 이진 파형의 복원)

  • Kim, Jeong-Tae
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.55 no.7
    • /
    • pp.327-331
    • /
    • 2006
  • We have proposed an image restoration method for a bi-level waveforms whose number of edges is known to us. Based on the information, we parametrize a bi-level waveform using the locations of edges and restore the waveform by estimating the parameter. We estimated the locations by maximizing the correlation coefficients between the hi-level waveform and the measured waveform. In experiments using two dimensional barcode images of the PDF417 specification, the proposed method showed better performance than conventional methods in the sense that the proposed method was able to decode barcode images that were not decoded by the conventional methods.

Comparison between Cournot-Nash and Stackelberg Game in Bi-level Program (Bi-level program에서 Cournot-Nash게임과 Stackelberg게임의 비교연구)

  • Lim, Yong-Taek;Lim, Kang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.7 s.78
    • /
    • pp.99-106
    • /
    • 2004
  • This paper presents some comparisons between Cournot-Nash and Stackelberg game in bi-level program, composed of both upper level program and lower level one. The upper level can be formulated to optimize a specific objective function, while the lower formulated to express travelers' behavior patterns corresponding to the design parameter of upper level problem. This kind of hi-level program is to determine a design parameter, which leads the road network to an optimal state. Bi-level program includes traffic signal control, traffic information provision, congestion charge and new transportation mode introduction as well as road expansion. From the view point of game theory, many existing algorithms for bi-level program such as IOA (Iterative Optimization Assignment) or IEA (Iterative Estimation Assignment) belong to Cournot-Nash game. But sensitivity-based algorithms belongs to Stackelberg one because they consider the reaction of the lower level program. These two game models would be compared by using an example network and show some results that there is no superiority between the models in deterministic case, but in stochastic case Stackelberg approach is better than that of Cournot-Nash one as we expect.

Restoration of Bi-level Images via Iterative Semi-blind Wiener Filtering (반복 semi-blind 위너 필터링을 이용한 이진영상의 복원)

  • Kim, Jeong-Tae
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.7
    • /
    • pp.1290-1294
    • /
    • 2008
  • We present a novel deblurring algorithm for bi-level images blurred by some parameterizable point spread function. The proposed method iteratively searches unknown parameters in the point spread function and noise-to-signal ratio by minimizing an objective function that is based on the binariness and the difference between two intensity values of restoring image. In simulations and experiments, the proposed method showed improved performance compared with the Wiener filtering based method in terms of bit error rate after segmentation.

A Railway Network Design Problem Considering Passengers Route Choice (철도승객의 노선선택을 고려한 철도망 설계모형 연구)

  • Lim, Yong-Tae k;Jang, Jun-Seok;Park, Jin-Kyung;Lee, Jun
    • Journal of the Korean Society for Railway
    • /
    • v.11 no.6
    • /
    • pp.581-587
    • /
    • 2008
  • This paper presents a railway network design problem (RNDP), which can be formulated as a bi-level program. In bi-level program upper level program is to minimize total travel cost including the construction cost of the railway facilities, whilst lower one describes the railway route choice behavior of passengers. We also propose a heuristic method for solving the program because it is a kind of NP-hard problem. From two numerical railway examples, we confirm that the RNDP and its algorithm produce a reasonable solution and that it is applicable to real world.

Direct Formation of Bi-level Microstructures for Wide-viewing Liquid Crystal Displays with Plastic Substrates

  • Hong, Jong-Ho;Cho, Seong-Min;Kim, Yeun-Tae;Lee, Sin-Doo
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2008.10a
    • /
    • pp.1286-1289
    • /
    • 2008
  • We report on a wide-viewing liquid crystal (LC) display with bi-level microstructures spontaneously formed by selective wetting on a chemically heterogeneous surface. The bi-level microstructures serve as spacers for maintaining uniform cell gap, as well as protrusions for wide-viewing properties. Our LC cell having the bi-level microstructures shows good electro-optic properties.

  • PDF

Fast Correction of Nonuniform Illumination on Bi-level Images using Block Based Intensity Normalization (블록 기반 밝기 표준화를 통한 이진영상의 고속 불균일 조명 보정)

  • Joung, Ji-Hye;Kim, Jeong-Tae
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.12
    • /
    • pp.1926-1931
    • /
    • 2012
  • We investigated a novel fast non-uniform illumination correction method for bi-level images. The proposed method divides a bi-level image into sub-images and roughly estimates block-wise illumination by low pass filtered maximum values of sub-images. After that, we apply bilinear interpolation using the block-wise illumination to estimate non-uniform illumination, and compensate for the effect of non-uniform illumination using the estimated illumination. Since the proposed method is not based on computation intensive iterative optimization, the proposed method can be used effectively for applications that require fast correction of non-uniform illumination. In simulations, the proposed method showed more than 20 times faster speed than existing entropy minimization method. Moreover, in simulations and experiments, the restored images by the proposed method were more close to true images than images restored by conventional method.