• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.031 seconds

Surface Deformation by using 3D Target Curve for Virtual Spatial Design (가상 공간 디자인을 위한 3차원 목표곡선을 이용한 곡면 변형)

  • Kwon, Jung-Hoon;Lee, Jeong-In;Chai, Young-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.10
    • /
    • pp.868-876
    • /
    • 2006
  • 2D input data have to be converted into 3D data by means of some functions and menu system in 2D input modeling system. But data in 3D input system for virtual spatial design can be directly connected to the 3D modeling data. Nevertheless, efficient surface modeling and deformation algorithm for the 3D input modeling system are not proposed yet. In this paper, problems of conventional NURBS surface deformation methods which can occur when applied in the 3D input modeling system are introduced. And NURBS surface deformation by 3D target curves, in which the designer can easily approach, are suggested. Designer can efficiently implement the virtual spatial sketching and design by using the proposed deformation algorithm.

Design of a 6-bit 500MS/s CMOS A/D Converter with Comparator-based Input Voltage Range Detection Circuit

  • Dae, Si;Yoon, Kwang Sub
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.14 no.6
    • /
    • pp.706-711
    • /
    • 2014
  • A low power 6-bit flash ADC that uses an input voltage range detection algorithm is described. An input voltage level detector circuit has been designed to overcome the disadvantages of the flash ADC which consume most of the dynamic power dissipation due to comparators array. In this work, four digital input voltage range detectors are employed and each input voltage range detector generates the specific clock signal only if the input voltage falls between two adjacent reference voltages applied to the detector. The specific clock signal generated by the detector is applied to turn the corresponding latched comparators on and the rest of the comparators off. This ADC consumes 68.82 mW with a single power supply of 1.2V and achieves 4.3 effective number of bits for input frequency up to 1 MHz at 500 MS/s. Therefore it results in 4.6 pJ/step of Figure of Merit (FoM). The chip is fabricated in 0.13-um CMOS process.

Fast-convergence trilinear decomposition algorithm for angle and range estimation in FDA-MIMO radar

  • Wang, Cheng;Zheng, Wang;Li, Jianfeng;Gong, Pan;Li, Zheng
    • ETRI Journal
    • /
    • v.43 no.1
    • /
    • pp.120-132
    • /
    • 2021
  • A frequency diverse array (FDA) multiple-input multiple-output (MIMO) radar employs a small frequency increment across transmit elements to produce an angle-range-dependent beampattern for target angle and range detection. The joint angle and range estimation problem is a trilinear model. The traditional trilinear alternating least square (TALS) algorithm involves high computational load due to excessive iterations. We propose a fast-convergence trilinear decomposition (FC-TD) algorithm to jointly estimate FDA-MIMO radar target angle and range. We first use a propagator method to obtain coarse angle and range estimates in the data domain. Next, the coarse estimates are used as initialized parameters instead of the traditional TALS algorithm random initialization to reduce iterations and accelerate convergence. Finally, fine angle and range estimates are derived and automatically paired. Compared to the traditional TALS algorithm, the proposed FC-TD algorithm has lower computational complexity with no estimation performance degradation. Moreover, Cramer-Rao bounds are presented and simulation results are provided to validate the proposed FC-TD algorithm effectiveness.

Improved Partial UIO sequence generation method (개선된 Partial UIO sequence 생성 방법의 제안)

  • 최진영;홍범기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.11
    • /
    • pp.2255-2263
    • /
    • 1994
  • Protocol conformance testing consists of procedures to observe an output and to check a transition state of the Implementation Under Test considered as a black box by applying an input. There are several methods to check the transition state such as Unique Input/Output(UIO) sequence. Distinguishing Sequence(DS) and Characterization Set(CS). Particularly, as a test method for a state having no UIO sequence, Partial UIO sequence method can be considered. In this paper, three properties which can be found among Partial UIO sequence and a modified algorithm using these properties are suggested.

  • PDF

A Neural-like Algorithm to Compute One-Sided Inverse of III-Conditioned Matrices (III-Conditioned 정방행렬의 단측 역행렬 산출용 유사 인공신경망 알고리듬)

  • 문병수;양성운;김영택
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10c
    • /
    • pp.321-323
    • /
    • 1998
  • 이 논문에서는 크기가 큰 III-Conditioned Matrices 정방행렬의 좌측 또는 우측 역행렬 계산시 계산상의 정확도를 향상시키는 알고리듬에 대하여 기술한다. 이 알고리듬은 대상 행렬의 행벡터들을 Input으로 하고 해당 Input 벡터가 몇번째 행 벡터인지를 나타내는 단위 벡터를 Target 벡터로 하며 초기 Weight 값으로 Pivoting을 겸한 Gauss소거법을 적용하여 얻은 역행렬을 사용하는 Single Layer 인공신경망에 적용하는 역전파 알고리듬과 흡사한 것이다. 각각의 Input 행 벡터에 대하여 역행렬의 열 벡터들이 점진적으로 직교가 되거나 평행이 되도록 근접시키므로써 모든 Input 행 벡터들이 열벡터들에 비교적 균일하게 직교 또는 평행이 되도록 학습시키는 알고리듬이다.

  • PDF

Variable selection in censored kernel regression

  • Choi, Kook-Lyeol;Shim, Jooyong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.24 no.1
    • /
    • pp.201-209
    • /
    • 2013
  • For censored regression, it is often the case that some input variables are not important, while some input variables are more important than others. We propose a novel algorithm for selecting such important input variables for censored kernel regression, which is based on the penalized regression with the weighted quadratic loss function for the censored data, where the weight is computed from the empirical survival function of the censoring variable. We employ the weighted version of ANOVA decomposition kernels to choose optimal subset of important input variables. Experimental results are then presented which indicate the performance of the proposed variable selection method.

A Maximum Likelihood Decoding Scheme Based on Breadth-First Searching for Multi-Input Multi-Output Systems (여러 입력 여러 출력 시스템에 알맞도록 너비를 먼저 탐색하는 가장 비슷함 복호 방식)

  • Kang, Hyun-Gu;Song, Iick-Ho;An, Tae-Hun;Kim, Yun-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1C
    • /
    • pp.34-42
    • /
    • 2007
  • The sphere decoder (SD) has recently been proposed to perform maximum likelihood (ML) decoding for multi-input multi-output systems. Employing a 'breadth-first' searching algorithm for closet points in a lattice, we propose a novel ML decoding scheme for multi-input multi-output systems. Simulation results show that the proposed scheme has the same bit error rate performance as the conventional ML decoders while allowing significantly lower computational burden than the SD.

Time-Discretization of Nonlinear Systems with Delayed Multi-Input Using Taylor Series

  • Park, Ji-Hyang;Chong, Kil-To;Nikolaos Kazantzis;Alexander G. Parlos
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.7
    • /
    • pp.1107-1120
    • /
    • 2004
  • This study proposes a new scheme for the sampled-data representation of nonlinear systems with time-delayed multi-input. The proposed scheme is based on the Taylor-series expansion and zero-order hold assumption. The mathematical structure of a new discretization scheme is explored. On the basis of this structure, the sampled-data representation of nonlinear systems including time-delay is derived. The new scheme is applied to nonlinear systems with two inputs and then the delayed multi-input general equation is derived. The resulting time-discretization provides a finite-dimensional representation of nonlinear control systems with time-delay enabling existing controller design techniques to be applied to them. In order to evaluate the tracking performance of the proposed scheme, an algorithm is tested for some of the examples including maneuvering of an automobile and a 2-DOF mechanical system.

Facial Regions Detection Using the Color and Shape Information in Color Still Images (컬러 정지 영상에서 색상과 모양 정보를 이용한 얼굴 영역 검출)

  • 김영길;한재혁;안재형
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.1
    • /
    • pp.67-74
    • /
    • 2001
  • In this paper, we propose a face detection algorithm using the color and shape information in color still images. The proposed algorithm is only applied to chrominance components(Cb and Cr) in order to reduce the variations of lighting condition in YCbCr color space. Input image is segmented by pixels with skin-tone color and then the segmented mage follows the morphological filtering an geometric correction to eliminate noise and simplify the segmented regions in facial candidate regions. Multiple facial regions in input images can be isolated by connected component labeling. Moreover tilting facial regions can be detected by extraction of second moment-based ellipse features.

  • PDF

An Integer DCT Algorithm for Lossless Audio Coding (무손실 음향부호화를 위한 정수 DCT실현기법)

  • Shin, Jae-Ho;Park, Se-Hyoung
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.5 no.1
    • /
    • pp.1-11
    • /
    • 2006
  • Lifting scheme based integer transforms provides very useful properties on the multimedia coding. An integer transform outputs the integer form when the input has integer value. This doesn't produce quantization errors on coding, so integer transforms are adequate to lossless coding, In this paper, we present an integer DCT algorithm which is able to transform audio signal with longer length. Also the proposed method can be easily implemented recursively even though input is long time. We present the method to overcome the poor approximation which is produced by recursive lifting step. And we have applied the proposed integer DCT to lossless audio coding.

  • PDF