• Title/Summary/Keyword: code search

Search Result 340, Processing Time 0.025 seconds

AN ALGORITHM TO REDUCE THE PITCH SEARCHING TIME USING MODIFIED DELTA SEARCH IN CELP VOCODER (개선된 델타검색기법을 이용한 피치검색시간의 단축)

  • 이주헌
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1994.06c
    • /
    • pp.214-217
    • /
    • 1994
  • The major drawback in the Code Excited Linear Prediction type vocoders is their large computational requirements. In this paper, a simple method is proposed to reduce the pitch searching time in the pitch filter almost without degradation of quality. On the basis of the observational regularity of the correlation function of speech, only the limited numbers of pitch lags are considered to be an optimum pitch. This is done by skipping the negative envelope side of the correlation function and limiting the maximum number of lags to be considered preliminarily. By doing so, we can reduce the computational time of pitch searching more than 51% with negligible quality degradation. In addition to that, by combining that method with the conventional delta search technique, we can reduce the computational time requirements more than 60% without serious lowering the speech quality in segmental SNR measure compared to the conventional full search method.

  • PDF

Complexity-Reduction Algorithm of Speech Coder (QCELP) for CDMA Digital Cellular System (CDMA 디지틀 셀룰라용 음성 부호화기 (QCELP) 의 복잡도 감소 알고리즘)

  • 이인성
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.3
    • /
    • pp.126-132
    • /
    • 1996
  • In this paper, the complexity reduction method for QCELP speech coder (IS-96) without any perfomrance degradation is proposed for the vecoder of CDMA digital cellular system. The energy terms in pitch parameter search and codebook search routines that require large computations are calculated recursively by utilizing the overlapped structure of code vectors in adaptive codebook and excitation codebook. The additional complexity reduction in the codebook search routine can be achieved by using a simple form in calculation of the energy term when the initial codebook value is zero. In the case of lower transmission rates such as 4,2,1 kbps, the complexity reduction by recursive calulations of energy term is increased.

  • PDF

Search Methods for Covering Patterns of CRC Codes for Error Recovery (오류 복구를 위한 CRC 코드 커버링 패턴의 탐색 방법)

  • Sung, Won-Jin
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.4
    • /
    • pp.299-302
    • /
    • 2002
  • Error detection and correction using CRC and the general class of cyclic codes is an important part of designing reliable data transmission schemes. The decoding method for cyclic codes using covering patterns is easily-implementable, and its complexity de-pends on the number of covering patterns employed. Determination of the minimal set of covering patterns for a given code is an open problem. In this paper, an efficient search method for constructing minimal sets of covering patterns is proposed and compared with several existing search methods. The result is applicable to various codes of practical interest.

Design of Lightweight Parallel BCH Decoder for Sensor Network (센서네트워크 활용을 위한 경량 병렬 BCH 디코더 설계)

  • Choi, Won-Jung;Lee, Je-Hoon
    • Journal of Sensor Science and Technology
    • /
    • v.24 no.3
    • /
    • pp.188-193
    • /
    • 2015
  • This paper presents a new byte-wise BCH (4122, 4096, 2) decoder, which treats byte-wise parallel operations so as to enhance its throughput. In particular, we evaluate the parallel processing technique for the most time-consuming components such as syndrome generator and Chien search owing to the iterative operations. Even though a syndrome generator is based on the conventional LFSR architecture, it allows eight consecutive bit inputs in parallel and it treats them in a cycle. Thus, it can reduce the number of cycles that are needed. In addition, a Chien search eliminates the redundant operations to reduce the hardware complexity. The proposed BCH decoder is implemented with VHDL and it is verified using a Xilinx FPGA. From the simulation results, the proposed BCH decoder can enhance the throughput as 43% and it can reduce the hardware complexity as 67% compared to its counterpart employing parallel processing architecture.

Evaluation of the Input Status of Exposure-related Information of Working Environment Monitoring Database and Special Health Examination Database for the Construction of a National Exposure Surveillance System (국가노출감시체계 구축을 위한 작업환경측정과 특수건강진단 자료의 노출 정보 입력 실태 평가)

  • Choi, Sangjun;Koh, Dong-Hee;Park, Ju-Hyun;Park, Donguk;Kim, Hwan-Cheol;Lim, Dae Sung;Sung, Yeji;Ko, Kyoung Yoon;Lim, Ji Seon;Seo, Hoekyeong
    • Journal of Korean Society of Occupational and Environmental Hygiene
    • /
    • v.32 no.3
    • /
    • pp.231-241
    • /
    • 2022
  • Objectives: The purpose of this study is to evaluate the input status of exposure-related information in the working environment monitoring database (WEMD) and special health examination database (SHED) for the construction of a national exposure surveillance system. Methods: The industrial and process code input status of WEMD and SHED for 21 carcinogens from 2014 to 2016 was compared. Data from workers who performed both work environment monitoring and special health examinations in 2019 and 2020 were extracted and the actual status of input of industrial and process codes was analyzed. We also investigated the cause of input errors through a focus group interview with 12 data input specialists. Results: As a result of analyzing WMED and SHED for 21 carcinogens, the five-digit industrial code matching rate was low at 53.5% and the process code matching rate was 19% or less. Among the data that simultaneously conducted work environment monitoring and special health examination in 2019 and 2020, the process code matching rate was very low at 18.1% and 5.2%, respectively. The main causes of exposure-related data input errors were the difference between the WEMD and SHED process code input systems from 2020, the number of standard process and job codes being too large, and the inefficiency of the standard code search system. Conclusions: In order to use WEMD and SHED as a national surveillance system, it is necessary to simplify the number of standard code input codes and improve the search system efficiency.

Dynamic Stall Control Using Aerodynamic Sensitivity Analysis (민감도 해석을 이용한 동적실속 제어)

  • Ahn Tai-Sul;Kim Hyoung-Jin;Kim Chongam;Rho Oh-Hyun
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.176-182
    • /
    • 2000
  • This paper presents methods for dynamic stall control utilizing an optimization approach. Unsteady aerodynamic sensitivity code is developed using a direct diffentiation method from a discrete two-dimensional unsteady compressible Navier-Stokes code including a two-equation turbulence model. Dynamic stall control is conducted by minimizing an objective function defined at an instant instead of integrating a response for a period of time. Unsteady sensitivity derivative of the objective function is calculated by the sensitivity code, and optimization is conducted using a linear line search method at every physical time level. Examples of dynamic stall control utilizing airfoils nose radius or maximum thickness variation show very satisfactory results.

  • PDF

Real-time Precision GPS Positioning Algorithm Based on Reconfiguration Kalman Filter (재구성기법을 이용한 칼만필터 기반의 실시간 정밀 GPS 측위기법)

  • Won, Jong-Hoon;Ko, Sun-Jun;Lee, Ja-Sung
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.2439-2442
    • /
    • 2000
  • This paper presents a practical On-The-Fly(OTF) integer ambiguity resolution algorithm for real-time precise positioning with low cost, $L_1$ single frequency, conventional C/A code GPS receiver. A state reconfiguration scheme is adopted in the Kalman filter to deal with the variation of ambiguity states caused by varying sets of visible GPS satellites. The proposed algorithm reduces the ambiguity search space from the coarse m-level C/A code pseudorange measurements of the conventional C/A code reciever, thereby reducing the computational time. Simulation results are presented to show that the algorithm achieves a cm-level accuracy.

  • PDF

Content-based Image Retrieval Using Color and Chain Code (색상과 Chain Code를 이용한 내용기반 영상검색)

  • 황병곤;정성호;이상열
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.5 no.2
    • /
    • pp.9-15
    • /
    • 2000
  • In this paper, we proposed a content-based image retrieval method using color and object's complexity for indexing of image database. Generally, the retrieval methods using color feature can not sufficiently include the spatial information in the image. So they are reduced retrieval efficiency. Then we combined object's complexity which extracted from chain code and the conventional color feature. As a result, experiments shooed that the proposed method which considers the shape feature improved performance in conducting content-based search.

  • PDF

Multilevel Modulation Codes for Holographic Data Storage (홀로그래픽 데이터 저장장치에서의 멀티레벨 변조부호)

  • Jeong, Seongkwon;Lee, Jaejin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.9
    • /
    • pp.13-18
    • /
    • 2015
  • The mutilevel holographic data storage offers considerable advantage for capacity, since it can store more than one bit per pixel. In this paper, we search the number of codewords for each code depending on three conditions: (1) the number of levels, (2) the number of pixels in a codeword, and (3) the minimum Euclidean distance of a code. Increasing the number of levels per pixel creates more capacity, while causing more errors, by reducing the noise margin. Increasing the number of pixels in a codeword can increase the code rate, which means more capacity, but increases the complexity of the encoder/decoder of the code. Increasing the minimum distance of a code reduces the detection error, while reducing the code rate of the code. In such a fashion, a system design will always have pros and cons, but our task is to find out an effective one under the given conditions for the system requirements. Therefore, the numbers we searched can provide some guidelines for effective code design.

Korean Standard Classification of Functioning, Disability and Health (KCF) Code Linking on Natural Language with Extract Algorithm (자연어 알고리즘을 활용한 한국표준건강분류(KCF) 코드 검색)

  • Nyeon-Sik Choi;Ju-Min Song
    • Journal of the Korean Society of Physical Medicine
    • /
    • v.18 no.1
    • /
    • pp.77-86
    • /
    • 2023
  • PURPOSE: This study developed an experimental algorithm, which is similar or identical to semantic linking for KCF codes, even if it converted existing semantic code linking methods to morphological code extraction methods. The purpose of this study was to verify the applicability of the system. METHODS: An experimental algorithm was developed as a morphological extraction method using code-specific words in the KCF code descriptions. The algorithm was designed in five stages that extracted KCF code using natural language paragraphs. For verification, 80 clinical natural language experimental cases were defined. Data acquisition for the study was conducted with the deliberation and approval of the bioethics committee of the relevant institution. Each case was linked by experts and was extracted through the System. The linking accuracy index model was used to compare the KCF code linking by experts with those extracted from the system. RESULTS: The accuracy was checked using the linking accuracy index model for each case. The analysis was divided into five sections using the accuracy range. The section with less than 25% was compared; the first experimental accuracy was 61.24%. In the second, the accuracy was 42.50%. The accuracy was improved to 30.59% in the section by only a weight adjustment. The accuracy can be improved by adjusting several independent variables applied to the system. CONCLUSION: This paper suggested and verified a way to easily extract and utilize KCF codes even if they are not experts. KCF requires the system for utilization, and additional study will be needed.