• 한국항해학회지
• /
• 제19권3호
• /
• pp.21-28
• /
• 1995

Mathematical morphology skeleton image processing makes many partial skeleton image planes from an original binary image. And the original binary image can be reconstructed without any distortion by summing the first partial skeleton image plane and each dilated partial skeleton image planes using the same structuring element. Especially compression effects of Elias coding to the morphological globally minimal skeleton(GMS) image, is better than that of PCX and Huffman coding. And then this paper proposes mathematical morphological GMS image processing which can be applied to a binary image transmitting for facimile and big size(bigger than $64{\times}64$ size) bitmap fonts storing in a memory.

• 한국정보처리학회논문지
• /
• 제7권5호
• /
• pp.1474-1481
• /
• 2000

The number of keystream cycle sequences has been proposed as a characteristic of binary sequence generator for cryptographic application, but in general the most of binary sequence generators have a single cycle. On the other hand, S-box has been used to block cipher for a highly nonlinear element and then we apply it to the stream cipher with a high crypto-degree. In this paper, we propose a multiple-cycle binary sequence generator based on S-box which has a high nonlinearity containing SAC property and analyze its period, linear complexity, randomness and the number of keystream cycle sequences.

• 디지털산업정보학회논문지
• /
• 제11권3호
• /
• pp.11-19
• /
• 2015

Due to recent development in mobile devices, the mobile device utilization and many related applications have been increasing. Most of initial applications on mobile devices just showed simple information, but now they processes huge data. However, smart devices have certain limitations in processing massive data. Especially, if the size of data increases, the speed of data processing adversely decreases, so the performance of programs also decreases. If hardware specification of the mobile devices is not enough to handle it, response time will be drastically delayed. To overcome these drawbacks, most of application running on mobile devices communicate with their servers to manage data. XML is a proper language for data communication to send and receive data between servers and mobile devices, because it defines rules of document's format and it is a textual data format and small-sized language. However, mobile devices have limitation such as memory, CPU and wireless network to process huge data and XML also takes a lot of time to communicate with servers and devices and handle data, so it could be overhead in service time. Binary XML is an alternative of performance improvement in data processing, which has XML's benefits and minimizes the XML size by binary coding. However, most of binaryXML which are used on applications don't fit on mobile applications. In this paper, we surveyed many kinds of binaryXML, compared merits and demerits to find a binaryXML for mobile applications. We propose how to use binary XML and implemented an electronic attendance system using binary XML to overcome the limitation of XML and to reduce the load of data communications between servers and devices.

• 한국전자통신학회논문지
• /
• 제3권3호
• /
• pp.177-182
• /
• 2008

고속 전송에 적합한 MC-CDMA시스템은 출력이 Multi-Level로 출력됨으로 인하여 출력신호의 복잡성과 출력단의 선형적인 증폭기 사용으로 인한 고가, 고복잡성 등의 단점을 가진다. 이러한 단점을 보완하고자 제안된 기술이 Binary CDMA 기술이다. Binary CDMA 시스템에서 가장 중요한 파라미터는 고속 데이터 연산 시 병목현상이 발생되는 코릴레이터이다. 기존의 코릴레이터는 전력소모가 작다는 장점이 있지만 코릴레이션의 값을 얻기 위해 여러 단의 가산을 거쳐야 하므로 연산량이 많아 처리 속도가 낮아지는 단점을 가지고 있다. 그러므로 본 논문에서는 Binary CDMA 시스템에서 고속의 데이터를 처리함과 동시에 데이터 량이 증가하더라도 칩 면적이 독립적이며 전력소모가 일정한 구조를 가지는 Binary CDMA 시스템 PBS 코릴레이터를 제안하였다.

• 한국컴퓨터정보학회논문지
• /
• 제12권1호
• /
• pp.155-160
• /
• 2007

고속 데이터 전송에 적합한 Multi-Code CDMA 시스템은 출력이 Multi-Level이 됨으로써 출력신호의 복잡성과 출력단에 선형적인 증폭기를 사용하므로 고가, 고복잡성 등의 단점을 가진다. 이러한 단점을 보완하고자 기존 CDMA 기술에 기반을 둔 Binary CDMA 기술이 제안되었다. Binary CDMA 시스템에서 고속 데이터 연산 시 병목현상이 발생되는 코릴레이터는 동기획득시 매우 중요한 파라미터이다. 기존의 코릴레이터는 전력소모가 작다는 장점이 있지만 코릴레이션의 값을 얻기 위해 여러단의 가산을 거쳐야 하므로 연산량이 많아 처리 속도가 낮은 단점을 가지고 있다. 그러므로 본 논문은 Binary CDMA 시스템에서 고속의 데이터를 처리할 수 있으며 데이터 량이 증가하더라도 칩 면적이 독립적이며 전력소모가 일정한 구조를 가지는 코릴레이터를 제안하였다.

• 한국통신학회논문지
• /
• 제22권1호
• /
• pp.162-172
• /
• 1997

In this paper, we investigated the performance of a binary feedback switch algorithm for the ABR(Available Bit Rate) service in ATM networks. A binary feedback switch is also called EFCI(Explicit Forward Congestion Indication) switch and can be classificed into input cell processing(IP) scheme according to processing methods for the EFCI bit in data-cell header. We proposed two implementation methods for the binary feedback switch according to EFCI-bit processing schemes, and analyzed the ACR(Allowed Cell Rate) of source and the queue length of switch for each scheme in steady state. In addition, we derived the upper and lower bounds for maximum and minimum queue lengths, respectively, and investigated the impact of ABR parameters on the queue length.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2020년도 춘계학술발표대회
• /
• pp.290-291
• /
• 2020

안드로이드 OS는 대중적이고 중요한 시스템으로 자리 잡았고, 이에 따른 다양한 연구도 진행 중이다. 본 논문에서는 보안측면에서의 취약점 분석 방법을 제시하여, 각종 보안 위협을 예방하는데 기여하고자 한다. 안드로이드 라이브러리를 대상으로 Binary Lifting 기술을 사용하여 코드기반(LLVM IR) 퍼징을 진행하는, 취약점 분석 과정을 설계 수행한다.

• 센서학회지
• /
• 제30권2호
• /
• pp.82-87
• /
• 2021

In this paper, we propose a high-speed, low-power complementary metal-oxide semiconductor (CMOS) binary image sensor featuring a gate/body-tied (GBT) p-channel metal-oxide-semiconductor field-effect transistor (PMOSFET)-type photodetector based on a double-tail comparator. The GBT photodetector forms a structure in which the floating gate (n+ polysilicon) and body of the PMOSFET are tied, and amplifies the photocurrent generated by incident light. The double-tail comparator compares the output signal of a pixel against a reference voltage and returns a binary signal, and it exhibits improved power consumption and processing speed compared with those of a conventional two-stage comparator. The proposed sensor has the advantages of a high signal processing speed and low power consumption. The proposed CMOS binary image sensor was designed and fabricated using a standard 0.18 ㎛ CMOS process.

• IEIE Transactions on Smart Processing and Computing
• /
• 제2권4호
• /
• pp.197-202
• /
• 2013

Large gains in speech intelligibility can be obtained using the SNR-based binary mask approach. This approach retains the time-frequency (T-F) units of the mixture signal, where the target signal is stronger than the interference noise (masker) (e.g., SNR > 0 dB), and removes the T-F units, where the interfering noise is dominant. This paper introduces two alternative binary masks based on the distortion constraints to improve the speech intelligibility. The distortion constraints are induced by a gain function for estimating the short-time spectral amplitude. One binary mask is designed to retain the speech underestimated (T-F) units while removing the speech overestimated (T-F)units. The other binary mask is designed to retain the noise overestimated (T-F) units while removing noise underestimated (T-F) units. Listening tests with oracle binary masks were conducted to assess the potential of the two binary masks in improving the intelligibility. The results suggested that the two binary masks based on distortion constraints can provide large gains in intelligibility when applied to noise-corrupted speech.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.133-136
• /
• 2002

This paper presents a new method of Huffman decoding which gives a significant improvement of processing efficiency based on the reconstruction of an efficient one-dimensional array data structure incorporating the numeric interpretation of the accrued codewords in the binary tree. In the Proposed search method, the branching address is directly obtained by the arithematic operation with the incoming digit value eliminating the compare instruction needed in the binary tree search. The proposed search method gives 30% of improved Processing efficiency and the memory space of the reconstructed Huffman table is reduced to one third compared to the ordinary ‘compare and jump’ based binary tree. The experimental result with the six MPEG-2 AAC test files also shows about 198% of performance improvement compared to those of the widely used conventional sequential search method.