• Title/Summary/Keyword: coding parameters

Search Result 279, Processing Time 0.026 seconds

A Study on Reduction of Computation Time through Adjustment the Frequency Interval Information in the G.723.1 Vocoder (G.723.1 보코더에서 주파수 간격 정보조절을 통한 계산량 감소에 관한 연구)

  • 민소연;김영규;배명진
    • Proceedings of the IEEK Conference
    • /
    • 2002.06d
    • /
    • pp.405-408
    • /
    • 2002
  • LSP(Line Spectrum Pairs) Parameter is used for speech analysis in vocoders or recognizers since it has advantages of constant spectrum sensitivity. low spectrum distortion and easy linear interpolation. However the method of transforming LPC(Linear Predictive Coding) into LSP is so complex that it takes much time to compute. Among conventional methods, the real root method is considerably simpler than others, but nevertheless, it still suffers from its jndeterministic computation time because the root searching is processed sequentially in frequency region. We suggest a method of reducing the LSP transformation time using voice characteristics The proposed method is to apply search order and interval differently according to the distribution of LSP parameters. in comparison with the conventional real root method, the proposed method results in about 46.5% reduction. And, the total computation time is reduce to about 5% in the G.723.1 vocoder.

  • PDF

A Block Adaptive Bit Allocation for Progressive Transmission of Mean Difference Pyramid Image (Mean difference pyramid 영상의 점진적 전송을 위한 블록 적응 비트 배정)

  • 김종훈;신재범;심영석
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.4
    • /
    • pp.130-137
    • /
    • 1993
  • In this paper, A progressive coding of mean difference pyramid by Hadamard transform of the difference between two successive pyramid levels has been studied. A block adaptive bit allocation method based on ac energy of each sub-block has been proposed, which efficiently reduces the final distortion in the progressive transmission of image parameters. In our scheme, the dc energy equals the sum of the quantization errors of the Hadamard transform coefficients at previous level. Therefore proposed allocation method includes the estimation of dc energy at each pyramid level. Computer simulation results show some improvements in terms of MSE and picture quality over the conventional fixed allocation scheme.

  • PDF

Graphic Simulator for processing test of Humanoid Robot (인간형 로봇의 동작 더스트를 위한 그래픽 시뮬레이터)

  • Hwang, Byung-Hun;Kim, Jee-Hong
    • Proceedings of the KIEE Conference
    • /
    • 2003.07d
    • /
    • pp.2480-2482
    • /
    • 2003
  • As make a simulator including user interface functions like start & stop, load parameters, record and save, view 3D display has a real-like length and numerical value of sizes, represent real-shape of inner and outer part of robot, make the possible fast and slow selective observation as a adjust a step, receiving the images through the image device which attached in robot, so make a motion tester simulator of humanoid robot which coded by windows based GUI(Graphic User Interface) program with a MMI(Man Machine Interface) function that user can watch the environment which included robot and use a images. For implement this, we use a design data that converted data which made by use a CAD for Laser RP(Rapid Prototyping) progress into C coding for simulator programming. Using OpenGL, an API of graphic, it has a efficiency and detail of graphic operation. To make and test animation data, it has the option of save and resume in animation.

  • PDF

Implementation of Face Animation For MPEG-4 SNHC

  • Lee, Ju-Sang;Yoo, Ji-Sang;Ahn, Chie-Teuk
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1999.06a
    • /
    • pp.141-144
    • /
    • 1999
  • MPEG-4 SNHC FBA(face and body animation) group is going to standardize the MPEG-4 system for low-bit rate communication with the implementation and animation of human body and face on virtual environment. In the first version of MPEG-4 standard, only the face object will be implemented and animated by using FDP (face definition parameter) and FAP(facial animation parameter), which are the abstract parameters of human face for low-bit rate coding. In this paper, MPEG-4 SNHC face object and it's animation were implemented based on the computer graphics tools such as VRML and OpenGL.

Neuro-Fuzzy Modeling for Nonlinear System Using VmGA (VmGA를 이용한 비선형 시스템의 뉴로-퍼지 모델링)

  • Choi, Jong-Il;Lee, Yeun-Woo;Joo, Young-Hoon;Park, Jin-Bae
    • Proceedings of the KIEE Conference
    • /
    • 2001.07d
    • /
    • pp.1952-1954
    • /
    • 2001
  • In this paper, we propose the neuro-fuzzy modeling method using VmGA (Virus messy Genetic Algorithm) for the complex nonlinear system. VmGA has more effective and adaptive structure than sGA. in this paper, we suggest a new coding method for applying the model's input and output data to the optimal number of rules in fuzzy models and the structure and parameter identification of membership functions simultaneously. The proposed method realizes the optimal fuzzy inference system using the learning ability of neural network. For fine-tune of parameters identified by VmGA, back- propagation algorithm is used for optimizing the parameter of fuzzy set. The proposed fuzzy modeling method is applied to a nonlinear system to prove the superiority of the proposed approach through comparing with ANFIS.

  • PDF

McEliece Type PKC Based on Algebraic Geometry Code over Hyperelliptic Curve (초타원 곡선위에서 생성된 대수기하 부호를 이용한McEliece유형의 공개키 암호시스템)

  • 강보경;한상근
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.1
    • /
    • pp.43-54
    • /
    • 2002
  • McEliece introduced a public-key cryptosystem based on Algebraic codes, specially binary classical Goppa which have a good decoding algorithm and vast number of inequivalent codes with given parameters. And the advantage of this system low cost of their encryption and decryption procedures compared with other public-key systems specially RSA, ECC based on DLP(discrete logarithm problem). But in [1], they resent new attack based on probabilistic algorithm to find minimum weight codeword, so for a sufficient security level, much larger parameter size [2048, 1608,81]is required. Then the big size of public key make McEliece PKC more inefficient. So in this paper, we will propose New Type PKC using q-ary Hyperelliptic code so that with smaller parameter(1 over 3) but still work factor as hi인 as McEliece PKC and faster encryption, decryption can be maintained.

An explicit approximation of the central angle for the curved interface in double-circle model for horizontal two-phase stratified flow

  • Taehwan Ahn;Dongwon Jeong;Jin-Yeong Bak;Jae Jun Jeong;Byongjo Yun
    • Nuclear Engineering and Technology
    • /
    • v.56 no.8
    • /
    • pp.3139-3143
    • /
    • 2024
  • Stratified flow in horizontal tubes is frequently observed in gas-liquid two-phase flow system. In the two-fluid modeling, it is important to define the interface shape in solving the balance equations to determine the key parameters such as the interfacial transfer terms, void fraction, and pressure drop. A double-circle model is usually introduced to depict the concave-down interface in a horizontal circular tube under the stratified-wavy flow condition. However, calculation of the central angle in the double-circle model, which represents the interfacial curvature, requires an appropriate iterative numerical root-finding scheme to solve the implicit transcendental equation. In this study, an explicit approximate equation has been proposed without requirement of the iterative scheme and numerical instability, which is expected to improve the coding process and computation efficiency in the analysis code with the two-fluid model.

Lossless Image Compression Using Block-Adaptive Context Tree Weighting (블록 적응적인 Context Tree Weighting을 이용한 무손실 영상 압축)

  • Oh, Eun-ju;Cho, Hyun-ji;Yoo, Hoon
    • Journal of Internet Computing and Services
    • /
    • v.21 no.4
    • /
    • pp.43-49
    • /
    • 2020
  • This paper proposes a lossless image compression method based on arithmetic coding using block-adaptive Context Tree Weighting. The CTW method predicts and compresses the input data bit by bit. Also, it can achieve a desirable coding distribution for tree sources with an unknown model and unknown parameters. This paper suggests the method to enhance the compression rate about image data, especially aerial and satellite images that require lossless compression. The value of aerial and satellite images is significant. Also, the size of their images is huger than common images. But, existed methods have difficulties to compress these data. For these reasons, this paper shows the experiment to prove a higher compression rate when using the CTW method with divided images than when using the same method with non-divided images. The experimental results indicate that the proposed method is more effective when compressing the divided images.

Study on Improved Polarized 2˟2 MIMO Spatial Multiplexing Method for DVB-NGH System (DVB-NGH 시스템을 위한 향상된 편파 2˟2 MIMO SM 기법 연구)

  • Seo, Jae Hyun;Kim, Heung Mook;Han, Dong Seog
    • Journal of Broadcast Engineering
    • /
    • v.20 no.1
    • /
    • pp.3-15
    • /
    • 2015
  • Recently terrestrial digital broadcasting systems have experienced a growth with the demand of high data rate. In order to meet such demand, the MIMO technology has received a wide attention. This paper proposes a pre-coding method, which provides high space channel correlation for the improved performance over terrestrial broadcasting channels when the polarized $2{\times}2$ MIMO SM is adopted for DVB-NGH systems. When signals with two different modulation orders are transmitted through two antennas, a method that is based on non-uniform power is also proposed for improved reception performance. To optimize the proposed method, phase shifting values for the pre-coding method and appropriate unequal power ratio are obtained. These obtained parameters are applied to a terrestrial broadcasting system, and then the performance improvement over the conventional SM is shown through computer simulations.

A Study on Vocal Removal Scheme of SAOC Using Harmonic Information (하모닉 정보를 이용한 SAOC의 보컬 신호 제거 방법에 관한 연구)

  • Park, Ji-Hoon;Jang, Dae-Geun;Hahn, Min-Soo
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.10
    • /
    • pp.1171-1179
    • /
    • 2013
  • Interactive audio service provide with audio generating and editing functionality according to user's preference. A spatial audio object coding (SAOC) scheme is audio coding technology that can support the interactive audio service with relatively low bit-rate. However, when the SAOC scheme remove the specific one object such as vocal object signal for Karaoke mode, the scheme support poor quality because the removed vocal object remain in the SAOC-decoded background music. Thus, we propose a new SAOC vocal harmonic extranction and elimination technique to improve the background music quality in the Karaoke service. Namely, utilizing the harmonic information of the vocal object, we removed the harmonics of the vocal object remaining in the background music. As harmonic parameters, we utilize the pitch, MVF(maximum voiced frequency), and harmonic amplitude. To evaluate the performance of the proposed scheme, we perform the objective and subjective evaluation. As our experimental results, we can confirm that the background music quality is improved by the proposed scheme comparing with the SAOC scheme.