• Transactions of the Korean Society of Automotive Engineers
• /
• v.18 no.2
• /
• pp.39-47
• /
• 2010

As vehicles become intelligent for convenience and safety of drivers, in-vehicle networking (IVN) systems are essential components of intelligent vehicles. Recently, the chassis networking system which require increased network capacity and real-time capability is being developed to expand the application area of IVN systems. Also, FlexRay has been developed for the chassis networking system. However, FlexRay needs a complex scheduling method of static segment, which is a barrier for implementing the chassis networking system. Especially, if we want to migrate from CAN network to FlexRay network using CAN message database that was well constructed for the chassis networking system by automotive vendors, a novel scheduling method is necessary to be able to reduce design complexity. This paper presents a node-based scheduling method for FlexRay network system. And, in order to demonstrate the method's feasibility, its performance is evaluated through an experimental testbed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.892-897
• /
• 2008

In this paper, a new architecture for digit-parallel/bit-serial GF$(2^m)$ multiplier with low latency is proposed. The proposed multiplier operates in polynomial basis of GF$(2^m)$ and produces multiplication results at a rate of one per D clock cycles, where D is the selected digit size. The digit-parallel/bit-serial multiplier is faster than bit-serial ones but with lower area complexity than bit-parallel ones. The most significant feature of the proposed architecture is that a trade-off between hardware complexity and delay time can be achieved.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.5
• /
• pp.489-496
• /
• 2006

The random-based cleaning algorithm is a simple algorithm widely used in commercial vacuum cleaning robots. This algorithm has two limitations, that is, cleaning takes a long time and there is no guarantee that the cleaning will cover the whole cleaning area. This has lead to customer dissatisfaction. Thus, in recent years, many intelligent cleaning algorithms that takes into consideration information gathered from the cleaning area environment have been proposed. The plowing-based algorithm, which is the most efficient algorithm known to date when there are no obstacles in the cleaning area, has a deficiency that when obstacle prevail, its performance is not guaranteed. In this paper, we propose the Group-k algorithm that is efficient for that situation, that is, when obstacle prevail. The goal is not to complete the cleaning as soon as possible, but to clean the majority of the cleaning area as fast as possible. The motivation behind this is that areas close to obstacles are usually difficult for robots to handle, and hence, many require human assistance anyway In our approach, obstacles are grouped by the complexity of the obstacles, which we refer to as 'complex rank', and then decide the cleaning route based on this complex rank. Results from our simulation-based experiments show that although the cleaning completion time takes longer than the plowing-based algorithm, the Group-k algorithm cleans the majority of the cleaning area faster than the plowing algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2C
• /
• pp.150-159
• /
• 2002

This paper presents the convergence time, SER(Symbol Error Rate), MSE(Mean Square Error), hardware complexity and step-size(${\mu}$) about various LMS(Least Mean Square) algorithms in FS-DFE(Fractionally Spaced-Decision Feedback Equalize) for Cable Modem based on MCNS(Multimedia Cable Network System) DOCSIS(Data Over Cable Service Interface Specification) v1.0/v1.1 standards. We designed and simulated using ${SPW}^{TM}$ and synthesized using STD90 library through ${SYNOPSYS}^{TM}$. And also, we adopted the time-multiplexed multiplication and tap shared architecture in order to achieve the low hardware complexity. Simulation results show that DS-LMS algorithms[1][3] is the optimum solution about performace and hardware size. in high order QAM applications. Finally, we achieved area saving about 58% using DS-LMS algorithm compare with conventional equalizer architecture.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1288-1298
• /
• 2002

To implement elliptic curve cryptosystem in GF(2$\^$m/) at high speed, a fast divider is required. Although bit-parallel architecture is well suited for high speed division operations, elliptic curve cryptosystem requires large m(at least 163) to support a sufficient security. In other words, since the bit-parallel architecture has an area complexity of 0(m$\^$m/), it is not suited for this application. In this paper, we propose a new serial-in serial-out systolic array for computing division operations in GF(2$\^$m/) using the standard basis representation. Based on a modified version of tile binary extended greatest common divisor algorithm, we obtain a new data dependence graph and design an efficient bit-serial systolic divider. The proposed divider has 0(m) time complexity and 0(m) area complexity. If input data come in continuously, the proposed divider can produce division results at a rate of one per m clock cycles, after an initial delay of 5m-2 cycles. Analysis shows that the proposed divider provides a significant reduction in both chip area and computational delay time compared to previously proposed systolic dividers with the same I/O format. Since the proposed divider can perform division operations at high speed with the reduced chip area, it is well suited for division circuit of elliptic curve cryptosystem. Furthermore, since the proposed architecture does not restrict the choice of irreducible polynomial, and has a unidirectional data flow and regularity, it provides a high flexibility and scalability with respect to the field size m.

• Journal of Broadcast Engineering
• /
• v.19 no.5
• /
• pp.640-655
• /
• 2014

Many of today's video systems have additional depth camera to provide extra features such as 3D support. Thanks to these changes made in multimedia system, it is now much easier to obtain depth information of the video. Depth information can be used in various areas such as object classification, background area recognition, and so on. With depth information, we can achieve even higher coding efficiency compared to only using conventional method. Thus, in this paper, we propose the 2D video coding algorithm which uses depth information on top of the next generation 2D video codec HEVC. Background area can be recognized with depth information and by performing HEVC with it, coding complexity can be reduced. If current CU is background area, we propose the following three methods, 1) Earlier stop split structure of CU with PU SKIP mode, 2) Limiting split structure of CU with CU information in temporal position, 3) Limiting the range of motion searching. We implement our proposal using HEVC HM 12.0 reference software. With these methods results shows that encoding complexity is reduced more than 40% with only 0.5% BD-Bitrate loss. Especially, in case of video acquired through the Kinect developed by Microsoft Corp., encoding complexity is reduced by max 53% without a loss of quality. So, it is expected that these techniques can apply real-time online communication, mobile or handheld video service and so on.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.9
• /
• pp.1-9
• /
• 2007

For an efficient implementation of cryptosystems based on arithmetic in a finite field $GF(2^n)$, their hardware implementation is an important research topic. To construct a multiplier with low area complexity, the divide-and-conquer technique such as the original Karatsuba-Ofman method and multi-segment Karatsuba methods is a useful method. Leone proposed an efficient parallel multiplier with low area complexity, and Ernst at al. proposed a multiplier of a multi-segment Karatsuba method. In [1], the authors proposed new $MSK_5$ and $MSK_7$ methods with low area complexity to improve Ernst's method. In [3], the authors proposed a method which combines $MSK_2$ and $MSK_3$. In this paper we propose an efficient multiplication method by combining $MSK_2,\;MSK_3\;and\;MSK_5$ together. The proposed method reduces $116{\cdot}3^l$ gates and $2T_X$ time delay compared with Gather's method at the degree $25{\cdot}2^l-2^l with l>0.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.369-377
• /
• 2006

Recently, the metropolitan area network (MAN) has attracted much attention in telecommunication research and has emerged as one of the most important research topics in the community. Several standards representing the first step for developing metropolitan networks have been published; IEEE 802.16 (WiMAX) has taken a relevant role in reaching the goal of realizing a full-service network all over a urban and suburban area. At the same time, the wireless local area networks (WLAN) have been widely used for in-home or short range communications, mainly basing on the IEEE 802.11 (WiFi) standard. A consequence is the increasing interest in interworking technology, that allows an interconnection between different standards by maintaining certain properties, mainly in terms of quality of service (QoS). One of the major issues is to design bridging devices capable of transparently interconnect different wireless technologies. In this paper, we propose two interconnection bridging solutions between WiMAX and WiFi links; the first is more based on the concept of maintaining a certain end-to-end QoS level independently from the wireless technologies used. The second method is more devoted to the reduction of the implementation complexity at the cost of no QoS assurance. The performance of the two methods are compared by resorting to computer simulations showing the advantages of each one technique.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3268-3283
• /
• 2018

With the advent of the Information Age, the source identification of digital images, as a part of digital image forensics, has attracted increasing attention. Therefore, an effective technique to identify the source of digital images is urgently needed at this stage. In this paper, first, we study and implement some previous work on image source identification based on sensor pattern noise, such as the Lukas method, principal component analysis method and the random subspace method. Second, to extract a purer sensor pattern noise, we propose a sample selection method to improve the random subspace method. By analyzing the image texture feature, we select a patch with less complexity to extract more reliable sensor pattern noise, which improves the accuracy of identification. Finally, experiment results reveal that the proposed sample selection method can extract a purer sensor pattern noise, which further improves the accuracy of image source identification. At the same time, this approach is less complicated than the deep learning models and is close to the most advanced performance.

• Journal of Korean Port Research
• /
• v.14 no.4
• /
• pp.451-461
• /
• 2000

The design and maintenance of navigation channel and water facilities of an harbor which is located at the mouth of river or at the estuary area are difficult due to the complexity of estuarial water and sediment circulation. Effects of deepening navigable waterways, of changing coastline configurations, or of discharging dredged material to the open sea are necessary to be investigated and predicted in terms of water quality and possible physical changes to the coastal environment. A borad analysis of the transport mechanism in the estuary area was made in terms of sediment property, falling velocity, concentration and flow characteristics. In order to simulate the transport processes, a two-dimensional finite element model is developed, which includes erosion, transport and deposition mechanism of suspended sediments. Galerkin’s weighted residual method is used to solve the transient convection-diffusion equation. The fluid domain is subdivided into a series of triangular elements in which a quadratic approximation is made for suspended sediment concentration. Model could deal with a continuous aggregation by stipulating the settling velocity of the flocs in each element. The model provides suspended sediment concentration, bed shear stress, erosion versus deposition rate and bed profile at the given time step.