• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.1
• /
• pp.39-44
• /
• 2023

Renewable energy such as solar and wind power is a resource that is sensitive to weather conditions and environmental changes. Since the amount of power generated by a facility can vary depending on the installation location and structure, it is important to accurately predict the amount of power generation. Using meteorological data, a data preprocessing process based on principal component analysis was conducted to monitor the relationship between features that affect energy production prediction. In addition, in this study, the prediction was tested by reconstructing the dataset according to the sensitivity and applying it to the machine learning model. Using the proposed model, the performance of energy production prediction using random forest regression was confirmed by predicting energy production according to the meteorological environment for new and renewable energy, and comparing it with the actual production value at that time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.4
• /
• pp.703-715
• /
• 2017

In this paper, we analyze the channel characteristics of the long distance air-ground wideband common data link and we propose a mathematical method to analyze the effect of narrowband and wideband interference of air-ground channel on the received signal of wideband data link. In this paper, we analyze the reception performance according to the communication distance using the proposed performance analysis method, and found out that the communication distance is limited by the narrowband and wideband interference of ground reflection wave. As a result of the performance analysis of the method of controlling the receiving antenna upward, not only the narrow band but also the wideband interference is effectively reduced, so that the communication distance is increased even in the existing wideband data link not including the equalizer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4C
• /
• pp.454-461
• /
• 2007

The next-generation computer is the ultra-lightweight mobile computer that communicates with peripheral handhold devices and provides dynamically the services appropriate to user. To provide the dynamic services on the ultra-lightweight mobile computer, security problem for user or computer system information should be solved and security mechanism is necessary for the ultra-lightweight mobile computing environment that has battery limit and low performance. In this paper, the security mechanism on the component based middleware for the ultra-lightweight mobile computer was implemented using RC-5 cipher algorithm and SHA-1 authentication algorithm. The security components are dynamically loaded and executed into the component based middleware on the ultra-lightweight mobile computer.

• Aerospace Engineering and Technology
• /
• v.9 no.1
• /
• pp.106-115
• /
• 2010

Because of space limitations, interferences between antennas of the KSLV-I communication systems occur and their effects become worse during all sorts of tests such as the flight test using a light plane. In this paper, coupled signal magnitude is calculated using the FDTD method. The theory of the FDTD, absorbing boundary condition, source input technique, and post processing of data are explained. The calculated coupling factor between two IFAs, which have 2 GHz resonance frequency and placed 5 cm apart, is -12.7 dB. Applied coupling calculation method can be effectively used for KSLV-I performance analysis, subsystem design, antenna arrangement, and communication link budget for the next space launch vehicle.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.578-580
• /
• 2017

IoT technology poses a lot of security threats. Various algorithms are thus employed in ensuring security of transactions between IoT devices. Advanced Encryption Standard (AES) has gained huge popularity among many other symmetric key algorithms due to its robustness till date. This paper presents a hardware based implementation of the AES algorithm. We present a four-stage pipelined architecture of the encryption and key generation. This method allowed a total plain text size of 512 bits to be encrypted in 46 cycles. The proposed hardware design achieved a maximum frequency of 1.18GHz yielding a throughput of 13Gbps and 800MHz yielding a throughput of 8.9Gbps on the 65nm and 180nm processes respectively.

• Annual Conference of KIPS
• /
• 2021.05a
• /
• pp.25-28
• /
• 2021

블록체인은 탈집중화, 위변조 방지, 추적 가능, 노드 간 공동 유지 및 보수가 가능한 데이터베이스로서 서로 신뢰하지 않은 노드 간 통신 신뢰 문제를 해결할 수 있는 점 대 점 통신 네트워크를 실현할 수 있다. 최근 몇 년 동안, 블록체인 기술은 지속적으로 발전하여 데이터 보안 문제를 해결하기 위한 중요한 기술로 주목받고 있다. 블록체인의 응용은 최초의 디지털 화폐 영역에서 금융·정무·공업 제조 영역으로 확대되고 있다. 블록체인의 특성에 따라 블록체인의 성능은 분산형 데이터 통신에 비해 크게 떨어지고 처리량이 제한되는 문제점이 존재한다. 본 논문에서는 최근 연구되고 있는 블록체인의 보안 구조 및 성능 분석에 대해 조사하고, 기존에 연구되었던 기술과 비교하여 블록체인의 안전성을 유지하며 성능을 향상시키는 방법에 대해 고찰한다. 이후 유향 비순환 그래프 (DAG: Directed Acyclic Graph) 및 샤딩 (Sharding)을 이용하여 안전성과 성능을 강화시키는 방법에 대해 제안한다. 제안하는 시스템은 DAG를 사용하여 위변조 방지 및 처리 속도 향상의 이점을 가지고 있으며, 샤딩을 사용함으로써 데이터 처리량을 향상시킨다. 마지막으로 제안하는 시스템은 기존 블록체인과 비교하여 안정성과 데이터 처리량 측면에서 비교 분석을 진행한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.1
• /
• pp.215-221
• /
• 2016

In this thesis we introduce a large quantity of input interface system using a low cost single chip microcontroller which is consists of walking board with 1600 switches, RS485 communication for switch data communication and PC application software for walking pattern analysis. When a pedestrian walks on the walking board, the pattern analysis of foot pressed switches can be utilized on diverse divisions of sports and industry such as walking physical therapy, dancing, a large quantity of sensors interface system, etc.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.3
• /
• pp.339-347
• /
• 1993

The channel assignment problem in a mobile communication system is a NP-complete combinatorial optimization problem, in which the calculation time increases exponentially as the range of the problem is extended. This paper adapts a conventional Hopfield neural network model to the channel assignment problem to relieve the calculation time by means of the parallelism supplied from the neural network. In the simulation study, we checked the feasability of such a parallel method for the fixed channel assignment with uniform, and nouniform channel requirements, and for the dynamic channel assignment with considering continously varying channel requirements.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2173-2183
• /
• 1998

We consider a frequency-hopped multiple-access communication system that employs reed-solomon code over GF(Q) and M-ary FSK signaling ($M{\leq}Q$) in rayleigh fading channel. We investigate the tradeoff among the modulation symbol size (M), the number of frequency slots, and the code rate in maximizing the average number of successfully transmitted information bits per unit time and unit bandwidth (called normalized throughput). We find that it is desirabel to use a large M in noise-limited environment. In interference-limited environment, it is more improtant to prevent errors (hits) by increasing the number of frequency slots than to correct them with formward error correction techniques or to reduce the error rate by increasing M.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.541-548
• /
• 2005

IP lookup and forwarding process becomes the bottleneck of packet transmission as IP traffic increases. Previous hardware-based IP address lookup schemes using an index-based table are not memory-efficient due to sparse distribution of the routing prefixes. In this paper, we propose memory-efficient hardware based IP lookup scheme called set-associative IP address lookup scheme, which provides the same IP lookup speed with much smaller memory requirement. In the proposed scheme, an NHA entry stores the prefix and next hop together. The IP lookup procedure compares a destination IP address with eight entries in a corresponding set simultaneously and finds the longest matched prefix. The memory requirement of the proposed scheme is about $42\%$ of that of Lin's scheme. Thus, the set-associative IP address lookup scheme is a memory-efficient hardware based IP address lookup scheme.