• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1276-1291
• /
• 2014

In the field of visible light communication (VLC), light-emitting diodes (LEDs) are used for transmitting data via visible light. In this study, we analyze pulse dual slope modulation (PDSM) as a means of delivering information in VLC. PDSM involves the modulation of symmetrical slope pulses to encode binary 0s and 1s, and owing to the moderately increasing and decreasing pulse shapes that are created, this method enables more spectral efficiency than the variable pulse position modulation (VPPM) technique currently adopted in IEEE 802.15.7. In particular, PDSM allows for the avoidance of intra-frame flicker by providing idle pulses in a spectrum-efficient way. A simple detection scheme is proposed for PDSMsignals, and its bit error rate (BER) is analyzed mathematically at varying slopes to validate the process through simulation. The BER performance of PDSM detection using dual sampling is compared to the performances of PDSM and VPPM using correlation detection. It is found that, when the probability of idle pulse transmission is less than 0.08 and higher than 0, the BER of dual sampling PDSM is lower than that of PDSM using correlation detection over the entire light intensity range.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권9호
• /
• pp.4549-4566
• /
• 2017

This work presents a novel facial descriptor, which is named as multiscale adaptive local directional texture pattern (MALDTP) and employed for expression recognition. We apply an adaptive threshold value to encode facial image in different scales, and concatenate a series of histograms based on the MALDTP to generate facial descriptor in term of Gabor filters. In addition, some dedicated experiments were conducted to evaluate the performance of the MALDTP method in a person-independent way. The experimental results demonstrate that our proposed method achieves higher recognition rate than local directional texture pattern (LDTP). Moreover, the MALDTP method has lower computational complexity, fewer storage space and higher classification accuracy than local Gabor binary pattern histogram sequence (LGBPHS) method. In a nutshell, the proposed MALDTP method can not only avoid choosing the threshold by experience but also contain much more structural and contrast information of facial image than LDTP.

• 한국정보과학회논문지:시스템및이론
• /
• 제32권10호
• /
• pp.507-511
• /
• 2005

유한체 GF(p)에서 r=2p+1이 2-솟수이고, p에 대한 2의 위수 m을 가질 때, $q=r^e,\;(e{\geq}2)$를 연결정수로 갖는 FCSR의 생성된 출력 수열에 대한 선형복잡도를 구한다. 또한, 합산 난수 발생기(Summation Generator)는 LFSR의 출력 수열을 정수 합산하여 키 수열을 발생한다. 이와 유사하게 두개의 FCSR의 출력 수열을 상관관계에 안전한 비트별 논리합(bitwise exclusive-oring)을 이용한 이진 난수열 발생기를 제안하고, 선형복잡도 측면에서 출력된 수열의 암호학적 특성을 살펴본다

• 정보저장시스템학회:학술대회논문집
• /
• 정보저장시스템학회 2005년도 추계학술대회 논문집
• /
• pp.44-46
• /
• 2005

Data storage related with writing and retrieving requires high storage capacity, fast transfer rate and less access time. Today any data storage system cannot satisfy these conditions, however holographic data storage system can perform faster data transfer rate because it is a page oriented memory system using volume hologram in writing and retrieving data. System can be constructed without mechanical actuating part therefore fast data transfer rate and high storage capacity about $1Tb/cm^3$ can be realized. In this paper, to reduce errors of binary data stored in holographic data storage system, a new method for bit error reduction is suggested. We proposal Algorithm use The Extended Kalman filter. The Kalman filter reduce measurement noise. Therefore, By using this error reduction method following results are obtained; the effect of measurement nois of Pixel is decreased and the intensity profile of data page becomes uniform therefore the better data storage system can be constructed.

• 한국정보과학회논문지:시스템및이론
• /
• 제33권1_2호
• /
• pp.62-68
• /
• 2006

현대 통신 분야에서 많이 응용되고 있는 유한 필드상의 중요한 연산근 곱셈과 지수승 연산 등이 있다. 유한 필드에서 지수 연산은 이진 방법을 이용하여 곱셈과 제곱을 반복함으로서 구현될 수 있다. 그래서 이러한 연산들을 위한 빠른 알고리즘과 효율적인 하드웨어 구조 개발이 중요하다. 본 논문에서는 GF($2^m$)상의 MSB-우선 곱셈 연산을 위한 효율적인 비트-시리얼 시스톨릭 곱셈기를 구현하였다. 제안된 곱셈기는 지수 연산기의 핵심 회로로 사용될 수 있으며 기존의 곱셈기들과 비교하여 보다 적은 입력-단자의 수와 공간-시간 복잡도를 가진다. 그리고 제안된 구조는 정규성과 모듈성, 단 방향 자료 흐름을 가지기 때문에 VLSI 칩과 같은 하드웨어로 보다 쉽게 구현할 수 있다.

• 한국통신학회논문지
• /
• 제23권7호
• /
• pp.1718-1731
• /
• 1998

디지탈 quadrature 복조기는 디지탈 통신 시스템에서 변조된 신호의 정확한 위상 복조를 위해 꼭 필요하다. 기존의 방법들은 주로 DDFS(Direct Digital Frequency Synthsizer)를 이용하여 캐리어를 발생시킨 후에 승산기를 이용하여 복조를 수행하였다. 그리고, DDFS에는 주로 ROM(Read Only Memory)을 사용하였는데, 높은 속도와 정확도를 요구하는 경우 ROM의 속도와 크기가 제한이 될 수있다. 이러한 점을 극복하기 위하여 CORDIC(COordinate Rotation Digital Computer) 알고리듬을 사용하여 주파수 합성은 물론 캐리어 복조까지 수행하는 방식을 제안하였다. 최적의 하드웨어 구현을 위해 제한된 단어길이에 의한 영향을 분석하였으며, 하드웨어 비용면에서 ROM을 사용하는 방법과 비교한 결과 약 1/3 정도로 면적이 줄었다. 제안된 구조를 이요한 전주문형 VLSI 구현 결과를 보인다.

• 산업경영시스템학회지
• /
• 제13권21호
• /
• pp.91-100
• /
• 1990

This paper is concerned with the development of optimal algorithms for multi-stage flowshop scheduling problems with sequence dependent setup times. In the previous researches the setup time of a job is considered to be able to begin at the earliest opportunity given a particular sequence at the start of operations. In this paper the setup time of a job is considered to be able to begin only at the completion of that job on the previous machine to reflect the effects of the setup time to the performance measure of sequence dependent setup time flowshop scheduling. The results of the study consist of two areas; first, a general integer programming(IP) model is formulated and a nixed integer linear programming(MILP) model is also formulated by introducing a new binary variable. Second a depth-first branch and bound algorithm is developed. To reduce the computational burdens we use the best heuristic schedule developed by Choi(1989) as the first trial. The experiments for developed algorithm are designed for a 4$\times$3$\times$3 factorial design with 360 observations. The experimental factors are PS(ratio of processing time to setup time), M(number of machines), N(number of jobs).

• 대한설비공학회:학술대회논문집
• /
• 대한설비공학회 2008년도 하계학술발표대회 논문집
• /
• pp.120-123
• /
• 2008

Refrigeration plants using absorption principles have been around for many years with initial development taking place over 100 years ago. Although the majority of absorption cycles are based on water-LiBr cycle, many applications exist where ammonia-water can be used, especially where lower temperatures are desirable. In both systems water is used as working fluid, but in quite different ways: as a solvent for the ammonia system, and as refrigerant for the lithium bromide system. This explains that the lithium bromide absorption system is strictly limited to evaporation temperatures above $0^{\circ}C$. The main industrial applications for refrigeration are in the temperature range below $0^{\circ}C$, the field for the binary system ammonia-water.

• 한국시뮬레이션학회논문지
• /
• 제11권3호
• /
• pp.23-34
• /
• 2002

Dynamic storage allocation (DSA) is a field fairly well studied for a long time as a basic problem of system software area. Due to memory fragmentation problem of DSA and its unpredictable worst case execution time, real-time system designers have believed that DSA may not be promising for real-time application service. Recently, the need for an efficient DSA algorithm is widely discussed and the algorithm is considered to be very important in the real-time system. This paper proposes an efficient DSA algorithm called QSB (quick semi-buddy) which is designed to be suitable for real-time environment. QSB scheme effectively maintains free lists based on quick-fit approach to quickly accommodate small and frequent memory requests, and the other free lists devised with adaptation upon a typical binary buddy mechanism for bigger requests in harmony for the .improved performance. Comprehensive simulation results show that the proposed scheme outperforms QHF which is known to be effective in terms of memory fragmentation up to about 16%. Furthermore, the memory allocation failure ratio is significantly decreased and the worst case execution time is predictable.

• Journal of Communications and Networks
• /
• 제15권3호
• /
• pp.283-291
• /
• 2013

In this paper, we propose new multiuser detectors (MUDs) based on compressed sensing approaches for the large-scale multiple antenna systems equipped with dozens of low-power antennas. We consider the scenarios where the number of receiver antennas is smaller than the total number of users, but the number of active users is relatively small. This prior information motivates sparsity-embracing MUDs such as sparsity-embracing linear/nonlinear MUDs where the detection of active users and their symbol detection are employed. In addition, sparsity-embracing MUDs with maximum a posteriori probability criterion (MAP-MUDs) are presented. They jointly detect active users and their symbols by exploiting the probability of user activity, and it can be solved efficiently by introducing convex relaxing senses. Furthermore, it is shown that sparsity-embracing MUDs exploiting common users' activity across multiple symbols, i.e., frame-by-frame, can be considered to improve performance. Also, in multiple multiple-input and multiple-output networks with aggressive frequency reuse, we propose the interference cancellation strategy for the proposed sparsity-embracing MUDs. That first cancels out the interference induced by adjacent networks and then recovers the desired users' information by exploiting the low user activity. In simulation studies for binary phase shift keying modulation, numerical evidences establish the effectiveness of our proposed MUDs exploiting low user activity, as compared with the conventional MUD.