• 제목/요약/키워드: optimal code

검색결과 648건 처리시간 0.032초

설계활동의 역사적 흐름과 새로운 개념에 의한 구조최적설계 소프트웨어 소개 (A Historical Review of Design Activities and a New-Concept Software System for Structural Optimization)

  • 곽병만
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2001년도 춘계학술대회논문집C
    • /
    • pp.17-21
    • /
    • 2001
  • Theories for optimal design and optimization algorithms have long been well developed. In industries, however, they are not well practiced. To make them work for industry, a new philosophy is necessary and an integration of various software systems required. A review of the history in the aspect of optimal design software is made and a newly developed code DS-Structure is introduced.

  • PDF

An Optimal Register resource Allocation Algorithm using Graph Coloring

  • Park, Ji-young;Lim, Chi-ho;Kim, Hi-seok
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -1
    • /
    • pp.302-305
    • /
    • 2000
  • This paper proposed an optimal register resource allocation algorithm using graph coloring for minimal register at high level synthesis. The proposed algorithm constructed interference graph consist of the intermediated representation CFG to description VHDL. and at interference graph fur the minimal select color selected a position node at stack, the next inserted spill code and the graph coloring process executes for optimal register allocation. The proposed algorithm proves to effect that result compare another allocation techniques through experiments of bench mark.

  • PDF

DFA 패턴 매칭을 위한 코드 최적화기의 자동적 생성 (Automatic Generation of Code Optimizer for DFA Pattern Matching)

  • 윤성림;오세만
    • 정보처리학회논문지A
    • /
    • 제14A권1호
    • /
    • pp.31-38
    • /
    • 2007
  • 주어진 입력 프로그램과 의미적으로 동등하면서 좀 더 효율적인 코드로 바꾸는 것을 코드 최적화라 하며, 이런 과정은 코드 최적화기예 의해 수행된다. 본 논문에서는 코드 최적화기를 자동적으로 생성하는 도구인 코트 최적화긴 생성기를 설계하고 구현하였다. 즉 패턴 형식에 대한 표현을 입력으로 받아 기술된 형태의 최적화 코드를 찾아내는 DFA 패턴 매칭을 위한 코드 최적화기를 자동적으로 생성하는 것이다. DFA 패턴 매칭은 패턴들의 정규화 과정을 통해 패턴 검색 시 발생하는 중복 비교를 제거하여, 패턴 형태의 단순화 및 구조를 개선함으로 비용이 적게든다. DFA 패턴 매칭을 위한 코드 최적화기의 자동적 생성은 다양한 형태의 중간코드로 바뀌더라도 해당하는 코트 최적화기를 만들어야 하는 수고를 덜어줌으로써 코드 최적화에 대한 정형화(formalism)를 할 수 있다. 또한, DFA로 구성되어 최적화를 하기 때문에 최적화 속도가 빠르고, 코드 최적화기를 만드는데 필요한 시간과 비용을 절약할 수 있는 장점을 가진다.

DVB-RCS Next Generation을 위한 Third-dimension Turbo Code 분석 (Analysis Third-dimension Turbo Code for DVB-RCS Next Generation)

  • 박태두;김민혁;정지원
    • 한국정보통신학회논문지
    • /
    • 제15권2호
    • /
    • pp.279-285
    • /
    • 2011
  • 차세대 무선통신에서는 현재 서비스 되고 있는 성능보다 높은 BER(Bit Error Rate)의 성능을 요구한다. 기존의 DVB-RCS(Digital Video Broadcasting - Return Channel via Satellite)에서 사용중인 이진 터보 코드(Double binary Turbo code)는 높은 SNR(에서 오류마루 현상이 발생하여 차세대 무선통신에서 사용하기가 어려움이 있다. 따라서 본 논문에서는 DVB-RCS NG에 적합한 부호화 방식으로 3D-터보 코드(Tthird-dimension Turbo code)의 부복호화기의 구조를 분석하고 성능분석 하였다. 3D-터보 코드는 기존의 DVB-RCS 방식에 rate-1인 post-encoder를 첨가시켜 오류마루 현상을 보완한 부호화기이다. 3D-터보 코드는 post-encoder의 형태, 인터리빙 기법, ${\lambda}$값의 변화에 따라 성능이 달라지므로 본 논문에서는 각 파라메타에 대한 최적의 값을 제시하였다. 전체적으로 3D-터보 코드가 기존의 DVB-RCS 터보 코드에 비해 성능이 우수하고 기존의 문제점인 오류마루 현상을 해결할 수 있음을 알 수 있다.

A CONSTRUCTION OF TWO-WEIGHT CODES AND ITS APPLICATIONS

  • Cheon, Eun Ju;Kageyama, Yuuki;Kim, Seon Jeong;Lee, Namyong;Maruta, Tatsuya
    • 대한수학회보
    • /
    • 제54권3호
    • /
    • pp.731-736
    • /
    • 2017
  • It is well-known that there exists a constant-weight $[s{\theta}_{k-1},k,sq^{k-1}]_q$ code for any positive integer s, which is an s-fold simplex code, where ${\theta}_j=(q^{j+1}-1)/(q-1)$. This gives an upper bound $n_q(k,sq^{k-1}+d){\leq}s{\theta}_{k-1}+n_q(k,d)$ for any positive integer d, where $n_q(k,d)$ is the minimum length n for which an $[n,k,d]_q$ code exists. We construct a two-weight $[s{\theta}_{k-1}+1,k,sq^{k-1}]_q$ code for $1{\leq}s{\leq}k-3$, which gives a better upper bound $n_q(k,sq^{k-1}+d){\leq}s{\theta}_{k-1}+1+n_q(k-1,d)$ for $1{\leq}d{\leq}q^s$. As another application, we prove that $n_q(5,d)={\sum_{i=0}^{4}}{\lceil}d/q^i{\rceil}$ for $q^4+1{\leq}d{\leq}q^4+q$ for any prime power q.

A Novel Hitting Frequency Point Collision Avoidance Method for Wireless Dual-Channel Networks

  • Quan, Hou-De;Du, Chuan-Bao;Cui, Pei-Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권3호
    • /
    • pp.941-955
    • /
    • 2015
  • In dual-channel networks (DCNs), all frequency hopping (FH) sequences used for data channels are chosen from the original FH sequence used for the control channel by shifting different initial phases. As the number of data channels increases, the hitting frequency point problem becomes considerably serious because DCNs is non-orthogonal synchronization network and FH sequences are non-orthogonal. The increasing severity of the hitting frequency point problem consequently reduces the resource utilization efficiency. To solve this problem, we propose a novel hitting frequency point collision avoidance method, which consists of a sequence-selection strategy called sliding correlation (SC) and a collision avoidance strategy called keeping silent on hitting frequency point (KSHF). SC is used to find the optimal phase-shifted FH sequence with the minimum number of hitting frequency points for a new data channel. The hitting frequency points and their locations in this optimal sequence are also derived for KSHF according to SC strategy. In KSHF, the transceivers transmit or receive symbol information not on the hitting frequency point, but on the next frequency point during the next FH period. Analytical and simulation results demonstrate that unlike the traditional method, the proposed method can effectively reduce the number of hitting frequency points and improve the efficiency of the code resource utilization.

수리 형태학과 인간의 시각적 개념을 이용한 최적의 코너 점 추출을 위한 연구 (A Study on Detecting Optimal Corner Points using Morphology and Human Visual Concept)

  • 정기룡
    • 한국항해항만학회지
    • /
    • 제28권3호
    • /
    • pp.233-238
    • /
    • 2004
  • 코너 점(Corner point)은 영상 신호 처리의 패턴 인식에 있어 아주 중요한 정보이다 그래서 지금도 여러 가지 코너 점을 추출하는 연구가 진행되고 있다. 코너 점은 에지 영상에서 8 방향 체인 코드(Chain code)를 적용하여 찾는다. 그런데 에지 선분 기울기가 45도의 정수 배가 되지 않을 때, 8 방향 알고리듬을 그대로 적용하면 문제가 발생된다. 따라서 본 논문에서는 이러한 단점을 보완하면서 최적의 코너 점을 찾기 위해서 수리 형태학과 시각적 개념을 접목하여 코너 점을 처리하는 새로운 알고리듬을 제안한다. 제안한 방법으로 컴퓨터 시뮬레이션 하여 좋은 결과를 보이고 있다. 그래서 제안된 논문의 알고리듬은 공장 자동화 및 선박 레이더 영상의 해안의 영역 파악에도 적용되리라 생각된다.

NURBS를 이용한 S형 천음속 흡입관 최적 설계 (OPTIMAL SHAPE DESIGN OF A S-SHAPED SUBSONIC INTAKE USING NURBS)

  • 이병준;김종암
    • 한국전산유체공학회지
    • /
    • 제11권1호
    • /
    • pp.57-66
    • /
    • 2006
  • An optimal shape design approach is presented for a subsonic S-shaped intake using aerodynamic sensitivity analysis. Two-equation turbulence model is employed to capture strong counter vortices in the S-shaped duct more precisely. Sensitivity analysis is performed for the three-dimensional Navier-Stokes equations coupled with two-equation turbulence models using a discrete adjoint method For code validation, the result of the flow solver is compared with experiment data and other computational results of bench marking test. To study the influence oj turbulence models and grid refinement on the duct flow analysis, the results from several turbulence models are compared with one another and the minimum number of grid points, which can yield an accurate solution is investigated The adjoint variable code is validated by comparing the complex step derivative results. To realize a sufficient and flexible design space, NURBS equations are introduced as a geometric representation and a new grid modification technique, Least Square NURBS Grid Approximation is applied With the verified flow solver, the sensitivity analysis code and the geometric modification technique, the optimization of S-shaped intake is carried out and the enhancement of overall intake performance is achieved The designed S-shaped duct is tested in several off-design conditions to confirm the robustness of the current design approach. As a result, the capability and the efficiency of the present design tools are successfully demonstrated in three-dimensional highly turbulent internal flow design and off-design conditions.

적응 변환코드를 이용한 영상신호 압축 (An Adaptive Transform Code for Images)

  • 김동윤;이경중;윤형로
    • 대한의용생체공학회:학술대회논문집
    • /
    • 대한의용생체공학회 1991년도 추계학술대회
    • /
    • pp.44-47
    • /
    • 1991
  • There exists a transform trellis code that is optimal for stationary Gaussian sources and the squared-error distortion measure at all rates. In this paper, we train an asymptotically optimal version of such a code to obtain one which is matched better to the statistics of real world data. The training algorithm uses the M-algorithm to search the trellis codebook and the LBG-algorithm to update the trellis codebook. To adapt the codebook for the varying input data. we use two gain-adaptive methods. The gain-adaptive scheme 1, which normalizes input block data by its gain factor, is applied to images at rate 0.5 bits/pixel. When each block is encoded at the same rate, the nonstationarity among the block variances leads to a variation in the resulting distortion from one block to another. To alleviate the non-uniformity among the encoded image, we design four clusters from the block power, in which each cluster has its own trellis codebook and different rates. The rate of each cluster is assigned through requiring a constant distortion per-letter. This gain-adaptive scheme 2 produces good visual and measurable quality at low rates.

  • PDF

Efficient Interference Cancellation Scheme for Wireless Body Area Network

  • Bae, Jung-Nam;Choi, Young-Hoon;Kim, Jin-Young;Kwon, Jang-Woo;Kim, Dong-In
    • Journal of Communications and Networks
    • /
    • 제13권2호
    • /
    • pp.167-174
    • /
    • 2011
  • In this paper, we propose and simulate an efficient interference cancellation scheme with an optimal ordering successive interference cancellation (SIC) algorithm for ultra wideband (UWB)/multiple-input-multiple-output (MIMO) systems in a wireless body area network (WBAN). When there are several wireless communication devices on a human body, multiple access interference (MAI) usually occurs. To mitigate the effect of MAI and achieve additional diversity gain, we utilize SIC with an optimal ordering algorithm. A zero correlation duration (ZCD) code with robust MAI capability is employed as a spread code for UWB systems in a multi-device WBAN environment. The performance of the proposed scheme is evaluated in terms of the bit error rate (BER). Simulation results confirm that the BER performance can be improved significantly if the proposed interference cancellation scheme and the ZCD code are jointly employed.