• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.033 seconds

Divided Generation Algorithm of Universal Test Set for Digital CMOS VLSI (디지털 CMOS VLSI의 범용 Test Set 분할 생성 알고리듬)

  • Dong Wook Kim
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.11
    • /
    • pp.140-148
    • /
    • 1993
  • High Integration ratio of CMOS circuits incredily increases the test cost during the design and fabrication processes because of the FET fault(Stuck-on faults and Stuck-off faults) which are due to the operational characteristics of CMOS circuits. This paper proposes a test generation algorithm for an arbitrarily large CMOS circuit, which can unify the test steps during the design and fabrication procedure and be applied to both static and dynaic circuits. This algorithm uses the logic equations set for the subroutines resulted from arbitrarily dividing the full circuit hierarchically or horizontally. Also it involves a driving procedure from output stage to input stage, in which to drive a test set corresponding to a subcircuit, only the subcircuits connected to that to be driven are used as the driving resource. With this algorithm the test cost for the large circuit such as VLSI can be reduced very much.

  • PDF

Performance Improvement of the Fractionally-Spaced Equalizer with Modified-Multiplication Free Adaptive Filter Algorithm (변형 비분적응필터 알고리즘을 적용한 분할등화기 성능개선)

  • 윤달환;김건호;김명수;임채탁
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.6
    • /
    • pp.28-34
    • /
    • 1993
  • An algorithm for MMADF(modified multiplication-free adaptive filter) which need not to multiplication arithmatic operation is proposed to improve the performance of FSE (fractionally spaced equalizer) which reduce the ISI(intersymbol interference) in signal transfer channel. The input signals are quantized using DPCM and the reference signals is processed using a first-order linear prediction filter. The convergence properties of Sign. MADF and M-MADF algorithm for updating of the coefficients of a FIR digital filter of the fractionally spaced equalizer (FSE) are investigated and compared with one another. The convergence properties are characterized by the steady state error and the convergence speed. It is shown that the convergence speed of M-MADF is almost same as Sign algorithm and is faster than MADF in the condition of same steady state error. Especially it is very useful for high correlated signals.

  • PDF

Adaptive Bilinear Lattice Filter(II)-Least Squares Lattice Algorithm (적응 쌍선형 격자필터 (II) - 최소자승 격자 알고리즘)

  • Heung Ki Baik
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.1
    • /
    • pp.34-42
    • /
    • 1992
  • This paper presents two fast least-squares lattice algorithms for adaptive nonlinear filters equipped with bilinear system models. The lattice filters perform a Gram-Schmidt orthogonalization of the input data and have very good numerical properties. Furthermore, the computational complexity of the algorithms is an order of magnitude snaller than previously algorithm is an order of magnitude smaller than previously available methods. The first of the two approaches is an equation error algorithm that uses the measured desired response signal directly to comprte the adaptive filter outputs. This method is conceptually very simple`however, it will result in biased system models in the presence of measurement noise. The second approach is an approximate least-squares output error solution. In this case, the past samples of the output of the adaptive system itself are used to produce the filter output at the current time. Results of several experiments that demonstrate and compare the properties of the adaptive bilinear filters are also presented in this paper. These results indicate that the output error algorithm is less sensitive to output measurement noise than the squation error method.

  • PDF

A TV Ghost Cancelling Method Using Multiplicationless Adaptive Identification of Multipath Channel (다중경로채널의 무곱셈 적응인식을 이용한 TV고스트 제거방식)

  • 안상호;홍규익;김덕규;이건일
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.7
    • /
    • pp.83-91
    • /
    • 1993
  • A ghost cancelling method using the multiplicationless adaptive multipath channel identification is proposed. The IIR filter and the LMS algorithm are used for ghost cancelling. The coefficients of IIR filter are obtained by multipath channel identification. The LMS algorithm which is simple relatively is used as the adaptive algorithm. An MPS is selected as the reference signal and it is used as the input of the adaptive algorithm for the multipath channel identification. If an MPS is not exist, the horizontal syne, and color burst signal can be used as the reference signal. Improving of accuracy of the ghost cancelling in the presence of the phase variation in the multipath channel, a complex processing are also performed.

  • PDF

A Study on the Automatic Classification between Contour Elements and Non-Contour Elements in a Contour Map Image (등고선 지도영상에서의 등고 성분과 비등고 성분의 자동 분리에 관한 연구)

  • 김경훈;김준식
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.4
    • /
    • pp.7-16
    • /
    • 2002
  • En this paper, we propose the algorithm that has analyzed the map Information automatically to extract the contour lines and numbers, symbols from the map image. After converting the input image to binary one, thinned image is obtained by thinning algorithm. The contour elements in the thinned image are classified and the classified elements are analyzed to automatically classify the numbers from symbols. Finally, the broken parts are restored by reconstruction algorithm. The performance of proposed algorithm is verified through the simulation. The proposed one has good performance.

  • PDF

A Light Exposure Correction Algorithm Using Binary Image Segmentation and Adaptive Fusion Weights (이진화 영상분할기법과 적응적 융합 가중치를 이용한 광노출 보정기법)

  • Han, Kyu-Phil
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.11
    • /
    • pp.1461-1471
    • /
    • 2021
  • This paper presents a light exposure correction algorithm for less pleasant images, acquired with a light metering failure. Since conventional tone mapping and gamma correction methods adopt a function mapping with the same range of input and output, the results are pleasurable for almost symmetric distributions to their intensity average. However, their corrections gave insufficient outputs for asymmetric cases at either bright or dark regions. Also, histogram modification approaches show good results on varied pattern images, but these generate unintentional noises at flat regions because of the compulsive shift of the intensity distribution. Therefore, in order to sufficient corrections for both bright and dark areas, the proposed algorithm calculates the gamma coefficients using primary parameters extracted from the global distribution. And the fusion weights are adaptively determined with complementary parameters, considering the classification information of a binary segmentation. As the result, the proposed algorithm can obtain a good output about both the symmetric and the asymmetric distribution images even with severe exposure values.

An Improvement of Speech Hearing Ability for sensorineural impaired listners (감음성(感音性) 난청인의 언어청력 향상에 관한 연구)

  • Lee, S.M.;Woo, H.C.;Kim, D.W.;Song, C.G.;Lee, Y.M.;Kim, W.K.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1996 no.05
    • /
    • pp.240-242
    • /
    • 1996
  • In this paper, we proposed a method of a hearing aid suitable for the sensorineural hearing impaired. Generally as the sensorineural hearing impaired have narrow audible ranges between threshold and discomfortable level, the speech spectrum may easily go beyond their audible range. Therefore speech spectrum must be optimally amplified and compressed into the impaired's audible range. The level and frequency of input speech signal are varied continuously. So we have to make compensation input signal for frequency-gain loss of the impaired, specially in the frequency band which includes much information. The input sigaal is divided into short time block and spectrum within the block is calculated. The frequency-gain characteristic is determined using the calculated spectrum. The number of frequency band and the target gain which will be added input signal are estimated. The input signal within the block is processed by a single digital filter with the calculated frequency-gain characteristics. From the results of monosyllabic speech tests to evaluate the performance of the proposed algorithm, the scores of test were improved.

  • PDF

Mixed Mobile Education System using SIFT Algorithm (SIFT 알고리즘을 이용한 혼합형 모바일 교육 시스템)

  • Hong, Kwang-Jin;Jung, Kee-Chul;Han, Eun-Jung;Yang, Jong-Yeol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.13 no.2
    • /
    • pp.69-79
    • /
    • 2008
  • Due to popularization of the wireless Internet and mobile devices the infrastructure of the ubiquitous environment, where users can get information whatever they want anytime and anywhere, is created. Therefore, a variety of fields including the education studies methods for efficiency of information transmission using on-line and off-line contents. In this paper, we propose the Mixed Mobile Education system(MME) that improves educational efficiency using on-line and off-line contents on mobile devices. Because it is hard to input new data and cannot use similar off-line contents in systems used additional tags, the proposed system does not use additional tags but recognizes of-line contents as we extract feature points in the input image using the mobile camera. We use the Scale Invariant Feature Transform(SIFT) algorithm to extract feature points which are not affected by noise, color distortion, size and rotation in the input image captured by the low resolution camera. And we use the client-server architecture for solving the limited storage size of the mobile devices and for easily registration and modification of data. Experimental results show that compared with previous work, the proposed system has some advantages and disadvantages and that the proposed system has good efficiency on various environments.

  • PDF

Time-Discretization of Non-Affine Nonlinear System with Delayed Input Using Taylor-Series

  • Park, Ji-Hyang;Chong, Kil-To;Kazantzis, Nikolaos;Parlos, Alexander G.
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.8
    • /
    • pp.1297-1305
    • /
    • 2004
  • In this paper, we propose a new scheme for the discretization of nonlinear systems using Taylor series expansion and the zero-order hold assumption. This scheme is applied to the sampled-data representation of a non-affine nonlinear system with constant input time-delay. The mathematical expressions of the discretization scheme are presented and the ability of the algorithm is tested for some of the examples. The proposed scheme provides a finite-dimensional representation for nonlinear systems with time-delay enabling existing controller design techniques to be applied to them. For all the case studies, various sampling rates and time-delay values are considered.

Enhanced Belief Propagation Polar Decoder for Finite Lengths (유한한 길이에서 성능이 향상된 BP 극 복호기)

  • Iqbal, Shajeel;Choi, Goangseog
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.11 no.3
    • /
    • pp.45-51
    • /
    • 2015
  • In this paper, we discuss the belief propagation decoding algorithm for polar codes. The performance of Polar codes for shorter lengths is not satisfactory. Motivated by this, we propose a novel technique to improve its performance at short lengths. We showed that the probability of messages passed along the factor graph of polar codes, can be increased by multiplying the current message of nodes with their previous message. This is like a feedback path in which the present signal is updated by multiplying with its previous signal. Thus the experimental results show that performance of belief propagation polar decoder can be improved using this proposed technique. Simulation results in binary-input additive white Gaussian noise channel (BI-AWGNC) show that the proposed belief propagation polar decoder can provide significant gain of 2 dB over the original belief propagation polar decoder with code rate 0.5 and code length 128 at the bit error rate (BER) of $10^{-4}$.