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

검색결과 488건 처리시간 0.029초

긴 극 부호를 위한 저 면적 부분 병렬 극 부호 부호기 설계 (Area-Efficient Semi-Parallel Encoding Structure for Long Polar Codes)

  • 신예린;최소연;유호영
    • 전기전자학회논문지
    • /
    • 제23권4호
    • /
    • pp.1288-1294
    • /
    • 2019
  • Polar code의 채널용량 달성 특성은 polar code를 각광 받는 오류 정정 부호로 만들었다. 하지만 충분한 오류 정정 성능은 부호의 길이가 길어졌을 때 달성되는 점근적 속성을 보인다. 따라서 입력 데이터가 길어지는 경우에 대한 초대규모 집적회로 구현을 실현하기 위하여 효율적인 구조가 필요하게 되었다. 기존의 polar code 부호기 구조 중 가장 기본적인 완전 병렬 구조는 직관적이고 구현이 쉽지만 긴 polar code에 높은 하드웨어 복잡성을 보이므로 부적합하다. 그리고 이를 보완하여 제안된 부분 병렬 구조는 하드웨어 면적 측면에서 큰 성과를 얻었으나 그 방식이 일반화되어 있지 않아 설계자에 따라 구조에 변동이 발생할 수 있다. 본 논문에서는 이를 개선하고자 비트 차원의 치환을 위해 제안된 회로 설계법을 polar code에 적용하는 하드웨어 설계법을 제안한다. 제안하는 방법을 polar code의 부호기에 적용함으로써 완전 병렬 부호기만큼 직관적인 구조를 가짐과 동시에 일반화된 polar code 부분 병렬 부호기를 설계할 수 있다.

CONSTRUCTION OF TWO- OR THREE-WEIGHT BINARY LINEAR CODES FROM VASIL'EV CODES

  • Hyun, Jong Yoon;Kim, Jaeseon
    • 대한수학회지
    • /
    • 제58권1호
    • /
    • pp.29-44
    • /
    • 2021
  • The set D of column vectors of a generator matrix of a linear code is called a defining set of the linear code. In this paper we consider the problem of constructing few-weight (mainly two- or three-weight) linear codes from defining sets. It can be easily seen that we obtain an one-weight code when we take a defining set to be the nonzero codewords of a linear code. Therefore we have to choose a defining set from a non-linear code to obtain two- or three-weight codes, and we face the problem that the constructed code contains many weights. To overcome this difficulty, we employ the linear codes of the following form: Let D be a subset of ��2n, and W (resp. V ) be a subspace of ��2 (resp. ��2n). We define the linear code ��D(W; V ) with defining set D and restricted to W, V by $${\mathcal{C}}_D(W;V )=\{(s+u{\cdot}x)_{x{\in}D^{\ast}}|s{\in}W,u{\in}V\}$$. We obtain two- or three-weight codes by taking D to be a Vasil'ev code of length n = 2m - 1(m ≥ 3) and a suitable choices of W. We do the same job for D being the complement of a Vasil'ev code. The constructed few-weight codes share some nice properties. Some of them are optimal in the sense that they attain either the Griesmer bound or the Grey-Rankin bound. Most of them are minimal codes which, in turn, have an application in secret sharing schemes. Finally we obtain an infinite family of minimal codes for which the sufficient condition of Ashikhmin and Barg does not hold.

Scale-space filtering을 이용한 홍채인식 보안시스템 구현 (A Implementation of Iris recognition system using scale-space filtering)

  • 주상현;강태길;양우석
    • 한국인터넷방송통신학회논문지
    • /
    • 제9권5호
    • /
    • pp.175-181
    • /
    • 2009
  • 본 논문에서는 Scale-space filtering 방법을 사용하여 홍채인식을 이용한 보안시스템을 구현 하였다. 적외선 카메라를 이용하여 영상을 획득하고 Scale-space filtering과 영상의 Concavity를 이용하여 2차원 코드를 추출하여 서버에 저장된 코드와 비교하여 신분을 인식하는 방법을 사용하였다. 보안 시스템을 구현한 후 실제 홍채영상을 이용하여 실험한 후 FAR과 FRR을 측정하여 시스템의 성능을 입증하였다. 실험결과는 제안한 방법이 매우 적합하다는 것을 보여준다.

  • PDF

최적화 기법을 이용한 대형 증기터빈 유로설계 (Flow Path Design of Large Steam Turbines Using An Automatic Optimization Strategy)

  • 임홍식;김영상;조상현;권기범
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2001년도 춘계학술대회논문집D
    • /
    • pp.771-776
    • /
    • 2001
  • By matching a well established fast throughflow code, with standard loss correlations, and an efficient optimization algorithm, a new design system has been developed, which optimizes inlet and exit flow-field parameters for each blade row of a multistage axial flow turbine. The compressible steady state inviscid throughflow code based on streamline curvature method is suitable for fast and accurate flow calculation and performance prediction of a multistage axial flow turbine. A general purpose hybrid constrained optimization package, iSIGHT has been used, which includes the following modules: genetic algorithm, simulated annealing, modified method of feasible directions. The design system has been demonstrated using an example of a 5-stage low pressure steam turbine for 800MW thermal power plant previously designed by HANJUNG. The comparison of computed performance of initial and optimized design shows significant improvement in the turbine efficiency.

  • PDF

Optimized Channel Coding of Control Channels for Mobile Packet Communication

  • Song, Young-Joon
    • Journal of electromagnetic engineering and science
    • /
    • 제3권1호
    • /
    • pp.50-56
    • /
    • 2003
  • This paper proposes a coding scheme of control channel for mobile packet communication to maximize the minimum Hamming distance, which is based on shifting of basis vectors of Reed Muller code with optimized dynamic puncturing and/or(partial) sequence repetition. Since the maximum likelihood decoding can be performed using the extremely simple FHT(Fast Hadamard Transformation), it is suitable for real time optimum decoding of control channel information with very little complexity. We show applications of the proposed coding method to TFCI(Transport Format Combination Indicator) code in split and normal modes of 3GPP W-CDMA system. We also discuss how this method can reduce rate indication error over AWGN(Additive White Gaussian Noise) as well as fading channels when the proposed coding scheme is applied to 1xEV-DV system of $3^{rd}$TEX> generation partnership project 2(3GPP2) to indicate the data rate transmitted on the reverse traffic channel by a Mobile Station(MS).

오픈소스를 활용한 지능형 수요반응 플랫폼 개발 (Development of Automated Demand Response Platform Using Open Source Code)

  • 윤재원;이인규;최중인
    • 전기학회논문지
    • /
    • 제63권8호
    • /
    • pp.1116-1120
    • /
    • 2014
  • With the shift of the energy paradigm from supply side management to demand side management, demand resource management and demand response plays an important role in the energy industry. As a consequency, a lot of researches have been done to provide a suitable demand response system. However, most of the demand response systems are based on the propriety products that cannot be modified. In this paper, we are proposing an automated demand response system using an EnerNOC provided open source code. We implemented the demand response server (VTN) and demand response client (VEN), and validated the OpenADR2.0 compliances using the open source code. We also used an Arduino microcontoller to demonstrate the communication schemes to control various devices.

홍채인식을 이용한 정보보안을 위한 휴대용 신분인식기 개발 (Implementation of a Portable Identification System using Iris Recognition Techniques)

  • 주상현;양우석
    • 한국인터넷방송통신학회논문지
    • /
    • 제11권5호
    • /
    • pp.107-112
    • /
    • 2011
  • 본 논문에서는 본 논문에서는 특정 부위 조명 방법을 제시하고 스케일 스페이스 필터링을 이용한 홍채 영상의 특징 추출방법을 활용한 시스템 구현을 소개하였다. 홍채 영상이 구해지면 중심과 반경을 구한 후 불필요한 부분을 제거한다. 이 영상은 극좌표 영상으로 변환되어 스케일 스페이스 필터링을 한다. 스페이스 필터링 영상에서 특징이 추출되면 홍채 코드가 만들어진다. 동일인 및 서로 다른 사람에 대해 실험한 결과, 제시한 특징추출 방법이 매우 효과적임을 보여주었다.

초소성 판재 성형을 위한 유한요소 해석 및 실험에 관한 연구 (A Study on the Superplastic Sheet Forming by the FEM and Experiment)

  • 이승준;이정환;이영선
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2000년도 춘계학술대회논문집A
    • /
    • pp.866-872
    • /
    • 2000
  • Superplastic forming processes by characteristic of low flow stress and high elongation have advantages to reducing on production cost and weight because of the product of complex form could be made in one part. However superplastically termed part has a characteristic of non-uniform thickness distribution along forming direction. Especially. since the thickness distribution affects on mechanical properties of product. the uniform thickness is very important. There are two solution procedure of implicit and explicit procedure to analyze the superplastic forming. In this study to analyze the thickness distribution two kinds of commercial programs of DEFORM and PAM-STAMP which implicit and explicit code are used respectly. The results from the two Programs were compared with eath other As a result implicit code were more suitable than explicit code for superplastic forming analysis.

  • PDF

복잡한 형상에 관한 삼차원 변형 Multi-Block 정렬격자 프로그램 개발 (DEVELOPMENT OF A THREE-DIMENSIONAL MULTI-BLOCK STRUCTURED GRID DEFORMATION CODE FOR COMPLEX CONFIGURATIONS)

  • ;이영민;정성기;;명노신
    • 한국전산유체공학회지
    • /
    • 제12권4호
    • /
    • pp.28-37
    • /
    • 2007
  • In this study, a multi-block structured grid deformation code based on a hybrid of a transfinite interpolation algorithm and spring analogy was developed. The configuration was modeled by a Bezier surface. A combination of the spring analogy for block vertices and the transfinite interpolation for interior grid points helps to increase the robustness and makes it suitable for distributed computing. An elliptic smoothing operator was applied to the block faces with sub-faces in order to maintain the grid smoothness and skewness. The capability of this code was demonstrated on a range of simple and complex configurations including an airfoil and a wing-body configuration.

A Synchronization Scheme Based on Moving Average for Robust Audio Watermarking

  • Zhang, Jinquan;Han, Bin
    • Journal of Information Processing Systems
    • /
    • 제15권2호
    • /
    • pp.271-287
    • /
    • 2019
  • The synchronization scheme based on moving average is robust and suitable for the same rule to be adopted in embedding watermark and synchronization code, but the imperceptibility and search efficiency is seldom reported. The study aims to improve the original scheme for robust audio watermarking. Firstly, the survival of the algorithm from desynchronization attacks is improved. Secondly, the scheme is improved in inaudibility. Objective difference grade (ODG) of the marked audio is significantly changed. Thirdly, the imperceptibility of the scheme is analyzed and the derived result is close to experimental result. Fourthly, the selection of parameters is optimized based on experimental data. Fifthly, the search efficiency of the scheme is compared with those of other synchronization code schemes. The experimental results show that the proposed watermarking scheme allows the high audio quality and is robust to common attacks such as additive white Gaussian noise, requantization, resampling, low-pass filtering, random cropping, MP3 compression, jitter attack, and time scale modification. Moreover, the algorithm has the high search efficiency and low false alarm rate.