• 제목/요약/키워드: binary field

검색결과 284건 처리시간 0.027초

CMOS binary image sensor with high-sensitivity metal-oxide semiconductor field-effect transistor-type photodetector for high-speed imaging

  • Jang, Juneyoung;Heo, Wonbin;Kong, Jaesung;Kim, Young-Mo;Shin, Jang-Kyoo
    • 센서학회지
    • /
    • 제30권5호
    • /
    • pp.295-299
    • /
    • 2021
  • In this study, we present a complementary metal-oxide-semiconductor (CMOS) binary image sensor. It can shoot an object rotating at a high-speed by using a gate/body-tied (GBT) p-channel metal-oxide-semiconductor field-effect transistor (PMOSFET)-type photodetector. The GBT PMOSFET-type photodetector amplifies the photocurrent generated by light. Therefore, it is more sensitive than a standard N+/P-substrate photodetector. A binary operation is installed in a GBT PMOSFET-type photodetector with high-sensitivity characteristics, and the high-speed operation is verified by the output image. The binary operations circuit comprise a comparator and memory of 1- bit. Thus, the binary CMOS image sensor does not require an additional analog-to-digital converter. The binary CMOS image sensor is manufactured using a standard CMOS process, and its high- speed operation is verified experimentally.

IC 카드를 위한 polynomial 기반의 타원곡선 암호시스템 연산기 설계 (Design of Elliptic Curve Cryptographic Coprocessor over binary fields for the IC card)

  • 최용제;김호원;김무섭;박영수
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2001년도 하계종합학술대회 논문집(2)
    • /
    • pp.305-308
    • /
    • 2001
  • This paper describes the design of elliptic curve cryptographic (ECC) coprocessor over binary fields for the If card. This coprocessor is implemented by the shift-and-add algorithm for the field multiplication algorithm. And the modified almost inverse algorithm(MAIA) is selected for the inverse multiplication algorithm. These two algorithms is merged to minimize the hardware size. Scalar multiplication is performed by the binary Non Adjacent Format(NAF) method. The ECC we have implemented is defined over the field GF(2$^{163}$), which is a SEC-2 recommendation[7]..

  • PDF

증발하는 이성분혼합물 액적의 유동장 해석 (Investigation of Internal Flow Fields of Evaporating of Binary Mixture Droplets)

  • 김형수
    • 한국가시화정보학회지
    • /
    • 제15권2호
    • /
    • pp.21-25
    • /
    • 2017
  • If a liquid droplet evaporates on a solid substrate, when it completely dries, it leaves a peculiar pattern, which depends on the composition of the liquid. Not only a single component liquid but also complex liquids are studied for a different purpose. In particular, a binary mixture droplet has been widely studied and used for an ink-jet printing technology. In this study, we focus on investigating to visualize the internal flow field of an ethanol-water mixture by varying a concentration ratio between two liquids. We measure the in-plane velocity vector fields and vorticities. We believe that this fundamental study about the internal flow field provides a basic idea to understand the dried pattern of the binary mixture droplet.

마코프 랜덤 필드를 이용한 움직이는 객체의 분할에 관한 연구 (Moving object segmentation using Markov Random Field)

  • 정철곤;김중규
    • 한국통신학회논문지
    • /
    • 제27권3A호
    • /
    • pp.221-230
    • /
    • 2002
  • 본 논문에서는 마코프 랜덤 필드를 이용해 움직이는 객체를 분할하는 새로운 방법을 제안하였다. 제안된 방법은 신호 탐지 이론에 기반을 두고 있다. 즉, 영상에서의 모션의 존재 유무는 binary decision rule에 의해 결정되고 잘못된 결정은 마코프 랜덤 필드 모델에 의해 수정된다. 전체적인 분할 과정은 2단계로 나뉘어진다. 첫 단계는 '모션탐지' 단계이며, 두번째 단계는 '객체분할' 단계이다. '모션탐지' 단계에서는 optical flow에 의해 발생하는 속도 벡터들에 대하여 binary decision rule을 적용하여 모tus의 존재 유무를 결정하는 과정이다. '객체분할' 단계에서는 첫 단계에서 원치 않게 발생하는 잡음을 제거한다. 이때 마코프 랜덤 필드로 가정하고 베이스 규칙에 의해 잡음을 제거한다. 실험결과, 연속영상에서 움직이는 객체의 영역을 효율적으로 분할함을 확인할 수 있었다.

부호 기반 양자 내성 암호의 이진 필드 상에서 곱셈 연산 양자 게이트 구현 (Implementation of Quantum Gates for Binary Field Multiplication of Code based Post Quantum Cryptography)

  • 최승주;장경배;권혁동;서화정
    • 한국정보통신학회논문지
    • /
    • 제24권8호
    • /
    • pp.1044-1051
    • /
    • 2020
  • 양자 컴퓨터의 시대가 점점 현실로 다가오고 있다. 이에 대비해 미국 국립 표준 기술 연구소에서는 양자 알고리즘으로부터 내성이 있는 양자 내성 암호의 표준을 정하기 위해 후보군을 모집했다. 제출된 암호들은 양자 알고리즘으로부터 안전할 것으로 예상이 되지만 알고리즘이 실제 양자 컴퓨터상에서 작동이 되었을 때에도 양자 알고리즘의 공격으로부터 안전한지 검증을 할 필요가 있다. 이에 본 논문에서는 부호 기반 양자 내성 암호의 이진 필드 상에서의 곱셈 연산을 양자 컴퓨터에서 작동될 수 있게 양자 회로로 구현하였고 해당 회로를 최적화 하는 방안에 대하여 설명한다. 구현은 대표적인 부호 기반 암호인 Classic McEliece에서 제시하는 2개의 필드 다항식과 ROLLO에서 제시하는 3개의 필드 다항식에 대하여 일반 곱셈 알고리즘과 카라추바 곱셈 알고리즘으로 구현하였다.

고속 이진 웨이블렛 변환 (Fast Binary Wavelet Transform)

  • 강의성;이경훈;고성제
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2001년도 제14회 신호처리 합동 학술대회 논문집
    • /
    • pp.25-28
    • /
    • 2001
  • A theory of binary wavelets has been recently proposed by using two-band perfect reconstruction filter banks over binary field . Binary wavelet transform (BWT) of binary images can be used as an alternative to the real-valued wavelet transform of binary images in image processing applications such as compression, edge detection, and recognition. The BWT, however, requires large amount of computations since its operation is accomplished by matrix multiplication. In this paper, a fast BWT algorithm which utilizes filtering operation instead or matrix multiplication is presented . It is shown that the proposed algorithm can significantly reduce the computational complexity of the BWT. For the decomposition and reconstruction or an N ${\times}$ N image, the proposed algorithm requires only 2LN$^2$ multiplications and 2(L-1)N$^2$addtions when the filter length is L, while the BWT needs 2N$^3$multiplications and 2N(N-1)$^2$additions.

  • PDF

CMOS Binary Image Sensor with Gate/Body-Tied PMOSFET-Type Photodetector for Low-Power and Low-Noise Operation

  • Lee, Junwoo;Choi, Byoung-Soo;Seong, Donghyun;Lee, Jewon;Kim, Sang-Hwan;Lee, Jimin;Shin, Jang-Kyoo;Choi, Pyung
    • 센서학회지
    • /
    • 제27권6호
    • /
    • pp.362-367
    • /
    • 2018
  • A complementary metal oxide semiconductor (CMOS) binary image sensor is proposed for low-power and low-noise operation. The proposed binary image sensor has the advantages of reduced power consumption and fixed pattern noise (FPN). A gate/body-tied (GBT) p-channel metal-oxide-semiconductor field-effect transistor (PMOSFET)-type photodetector is used as the proposed CMOS binary image sensor. The GBT PMOSFET-type photodetector has a floating gate that amplifies the photocurrent generated by incident light. Therefore, the sensitivity of the GBT PMOSFET-type photodetector is higher than that of other photodetectors. The proposed CMOS binary image sensor consists of a pixel array with $394(H){\times}250(V)$ pixels, scanners, bias circuits, and column parallel readout circuits for binary image processing. The proposed CMOS binary image sensor was analyzed by simulation. Using the dynamic comparator, a power consumption reduction of approximately 99.7% was achieved, and this performance was verified by the simulation by comparing the results with those of a two-stage comparator. Also, it was confirmed using simulation that the FPN of the proposed CMOS binary image sensor was successfully reduced by use of the double sampling process.

FAST AND AUTOMATIC INPAINTING OF BINARY IMAGES USING A PHASE-FIELD MODEL

  • Jeong, Da-Rae;Li, Yibao;Lee, Hyun-Geun;Kim, Jun-Seok
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제13권3호
    • /
    • pp.225-236
    • /
    • 2009
  • Image inpainting is the process of reconstructing lost or deteriorated parts of images using information from surrounding areas. We propose a computationally efficient and fast phase-field method which uses automatic switching parameter, adaptive time step, and automatic stopping of calculation. The algorithm is based on an energy functional. We demonstrate the performance of our new method and compare it with a previous method.

  • PDF

THE PERIOD AND THE LINEAR COMPLEXITY OF CERTAIN LINEAR RECURRING SEQUENCES IN THE FINITE FIELD GF(q)

  • Park, Seung-Ahn
    • 대한수학회보
    • /
    • 제29권1호
    • /
    • pp.89-99
    • /
    • 1992
  • In this paper we will prove some theorems on the period and the linear complexity of certain sequences in GF(q) which are generated by combining two sequences in a reasonable way. In fact these theorems are generalizations of the main result in [1]. A sequence of elements of GF(2) is called a binary sequence. In recent years considerable interest has been shown in the generation of binary sequences which have good properties. Such binary sequences play an important role in a stream cipher system.

  • PDF

이진 에드워즈 곡선 공개키 암호를 위한 257-비트 점 스칼라 곱셈의 효율적인 하드웨어 구현 (An Efficient Hardware Implementation of 257-bit Point Scalar Multiplication for Binary Edwards Curves Cryptography)

  • 김민주;정영수;신경욱
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2022년도 춘계학술대회
    • /
    • pp.246-248
    • /
    • 2022
  • Bernstein이 제안한 새로운 타원곡선 형태인 이진 에드워즈 곡선 (binary Edwards curves; BEdC)는 예외점이 없어 완전한 덧셈 법칙이 만족한다. 본 논문에서는 투영 좌표계를 적용한 BEdC 상의 점 스칼라 곱셈의 효율적인 하드웨어 구현에 대해 기술한다. 점 스칼라 곱셈을 위해 modified Montgomery ladder 알고리듬을 적용하였으며, 257-비트 이진 덧셈기와 이진 제곱기, 32-비트 이진 곱셈기를 사용하여 하위 이진체 연산을 구현했다. Zynq UltraScale+ MPSoC 디바이스에 구현하여 설계된 BEdC 크립토 코어를 검증하였으며, 점 스칼라 곱셈 연산에 521,535 클록 사이클이 소요된다.

  • PDF