• 제목/요약/키워드: Legendre sequences

검색결과 8건 처리시간 0.043초

GMW 수열과 No 수열에 의해서 생성된 수열의 확장수열 (Extended sequences of sequences generated by GMW sequences and No sequences)

  • 조성진;임지미;김진경;김석태
    • 한국전자통신학회논문지
    • /
    • 제7권2호
    • /
    • pp.271-277
    • /
    • 2012
  • 본 논문에서는 GMW 수열과 No 수열에 의해 생성된 이진수열을 확장하여 새로운 형태의 수열을 소개한다. 그리고 확장된 수열의 상관계수를 분석하고 르장드르 수열로부터 생성되는 확장수열을 제시한다. 이는 암호 시스템 및 통신 시스템에 도움이 되며 특히 CDMA 시스템 신호 디자인에 유용한 연구이다.

Hall's Sextic Residue 시퀀스 및 기타 시퀀스의 Trace 함수에 의한 표현

  • 이환근;노종선;정하봉;양경철;송홍엽
    • 한국통신학회논문지
    • /
    • 제22권6호
    • /
    • pp.1273-1278
    • /
    • 1997
  • Pseudonoise sequences of period 2$^{m}$ -1 with idel autocorrelation have been researched such as m-sequences, GMW sequences, Legendre sequences, and extended sequences. The m-sequences, the GMW sequences, the Legendre sequences, and the extended sequences are best described in terms of the trace function by previous works. Besides, there are Hall's sextic residue sequences and miscellaneous sequences with ideal autocorrelation, whose general constructions are not known so far. However, are are no explicit descripton of the Hall's sextic residue sequences and the miscellaneous sequences in terms of the trace function. In this paper, the Hall's sextic residue sequences and the miscellaneous sequences of period 2$^{m}$ -1 are expressed as a sum of trace functions. The miscellaneous sequences with ideal autocorrelation, which are newly found by computer search, are also expressed as a sum of trace functions.

  • PDF

최적의 상호상관관계를 갖는 이진 수열의 설계 (Design of Binary Sequences with Optimal Cross-correlation Values)

  • 최언숙;조성진
    • 한국전자통신학회논문지
    • /
    • 제6권4호
    • /
    • pp.539-544
    • /
    • 2011
  • 적당한 정수 $n({\geq}1)$에 대하여 2-valued 자기상관관계를 갖는 주기가 $2^n-1$인 균형 이진 수열(balanced binary sequences)은 대역확산 통신 시스템(spread-spectrum communication system)에서 많이 응용되고 있다. 본 논문에서는 르장드르 수열에 의해 구성되는 새로운 3-valued 비선형 이진 수열을 제안한다. 이 수열은 유한체 위에서 트레이스를 이용해 생성하는 가장 우수한 수열인 m-수열, GMW 수열, Kasami 수열, No 수열을 모두 포함한다. 제안된 수열은 Klapper에 의해 제안된 이차형식 수열보다 더 낮은 상호상관관계를 갖는다.

On Lengthening the Period of Known Binary Sequences Preserving the Ideal Autocorrelation

  • No, Jong-Seon;Yang, Kyeong-Cheol;Chung, Ha-Bong;Song, Hong-Yeop
    • Journal of Electrical Engineering and information Science
    • /
    • 제2권6호
    • /
    • pp.217-222
    • /
    • 1997
  • Recently, No et al. presented a new construction of binary sequences with ideal autocorrelation property. In this paper, we applied this method into some of the well-known binary sequences with ideal autocorrelation, and the results are described in detail. First, the GMW sequences are shown to be a natural extension of m-sequences with respect to this method. Second, new binary sequences with ideal autocorrelation property are explicitly constructed from Legendre sequences, Hall's sextic residue sequences, and other known sequences of miscellaneous type.

  • PDF

A FAST ALGORITHM FOR REGION-ORIENTED TEXTURE CODING

  • Bae, Cheol-Soo;Kim, Hyun-yul
    • 한국정보전자통신기술학회논문지
    • /
    • 제7권4호
    • /
    • pp.205-211
    • /
    • 2014
  • This paper addresses the framework of object-oriented image coding, describing a new algorithm, based on monodimensional Legendre polynomials, for texture approximation. Through the use of 1D orthogonal basis functions, the computational complexity which usually makes prohibitive most of 2D region-oriented approaches is significantly reduced, while only a slight increment of distortion is introduced. In the aim of preserving the bidimensional intersample correlation of the texture information as much as possible, suitable pseudo-bidimensional basis functions have been used, yielding significant improvements with respect to the straightforward 1D approach. The algorithm has been experimented for coding still images as well as motion compensated sequences, showing interesting possibilities of application for very low bitrate video coding.

A Fast Algorithm for Region-Oriented Texture Coding

  • Choi, Young-Gyu;Choi, Chong-Hwan;Cheong, Ha-Young
    • 한국정보전자통신기술학회논문지
    • /
    • 제9권6호
    • /
    • pp.519-525
    • /
    • 2016
  • This paper addresses the framework of object-oriented image coding, describing a new algorithm, based on monodimensional Legendre polynomials, for texture approximation. Through the use of 1D orthogonal basis functions, the computational complexity which usually makes prohibitive most of 2D region-oriented approaches is significantly reduced, while only a slight increment of distortion is introduced. In the aim of preserving the bidimensional intersample correlation of the texture information as much as possible, suitable pseudo-bidimensional basis functions have been used, yielding significant improvements with respect to the straightforward 1D approach. The algorithm has been experimented for coding still images as well as motion compensated sequences, showing interesting possibilities of application for very low bitrate video coding.

수정 SPR 기법에 의한 휨을 받는 평판문제의 적응적 p-체눈 세분화 (p-Adaptive Mesh Refinement of Plate Bending Problem by Modified SPR Technique)

  • 조준형;이희정;우광성
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2007년도 정기 학술대회 논문집
    • /
    • pp.481-486
    • /
    • 2007
  • The Zienkiewicz-Zhu(Z/Z) error estimate is slightly modified for the hierarchical p-refinement, and is then applied to L-shaped plates subjected to bending to demonstrate its effectiveness. An adaptive procedure in finite element analysis is presented by p-refinement of meshes in conjunction with a posteriori error estimator that is based on the superconvergent patch recovery(SPR) technique. The modified Z/Z error estimate p-refinement is different from the conventional approach because the high order shape functions based on integrals of Legendre polynomials are used to interpolate displacements within an element, on the other hand, the same order of basis function based on Pascal's triangle tree is also used to interpolate recovered stresses. The least-square method is used to fit a polynomial to the stresses computed at the sampling points. The strategy of finding a nearly optimal distribution of polynomial degrees on a fixed finite element mesh is discussed such that a particular element has to be refined automatically to obtain an acceptable level of accuracy by increasing p-levels non-uniformly or selectively. It is noted that the error decreases rapidly with an increase in the number of degrees of freedom and the sequences of p-distributions obtained by the proposed error indicator closely follow the optimal trajectory.

  • PDF

휨을 받는 L-형 평판의 적응적 세분화를 위한 선택적 p-분배 (The Selective p-Distribution for Adaptive Refinement of L-Shaped Plates Subiected to Bending)

  • 우광성;조준형;이승준
    • 한국전산구조공학회논문집
    • /
    • 제20권5호
    • /
    • pp.533-541
    • /
    • 2007
  • 계층적 p-세분화를 위해 Zienkiewicz-Zhu 오차평가법이 약간 수정되었으며, 이 방법의 유효성을 보이기 위해 휨을 받는 개구부를 갖는 Reinssner-Mindlin $C^{\circ}$-평판에 적용하였다. 유한요소해석상의 적응적 체눈을 결정하는 단계는 초수렴 팻취 복구기법에 기초를 둔 사후오차평가자와 연계된 p-세분화에 의해 제안되었다. 요소내의 변위장을 정의하기 위해 적분형 르장드르 고차 형상함수가 사용되는 반면 복구응력을 보간하기 위해 파스칼의 삼각수에 기초를 둔 같은 차수의 고차다항식이 사용되는 이유로 수정 Z/Z 오차평가는 종래의 방법과 다소 차이를 보여준다. 가우스 적분점에서의 응력을 최적화하기 위해 필요한 다항식으로 표현되는 응력함수를 얻기 위해 최소제곱법이 사용되었다. 고정된 요소망에 거의 최적의 형상함수 차수의 분배를 찾기 위한 전략이 논의되었는데, 허용되는 정확도를 얻을 수 있을 때까지 각 요소마다 형상함수의 차수를 불균등하게 증가시키는 방법으로, 소위 최적의 선택적 p-분배를 자동으로 결정하도록 되어있다. 위의 사항들을 L-형 평판 해석에 적용한 결과, 적응적 p-체눈설계 단계가 진행됨에 따라 자유도의 증가에 따라 오차량은 급격히 감소되는 것을 알 수 있었고, 제안된 오차 지시자에 의한 적응적 p-체눈 세분화는 최적 p-분배 진행방향에 근접하는 것을 볼 수 있었다.