• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1441-1446
• /
• 2014

For the escape from a maze, the cooperative method by robot swarm was proposed in this paper. The robots can freely move by collecting essential data and making a decision in the use of sensors; however, a central control system is required to organize all robots for the escape from the maze. The robots explore new mazes and then send the information to the system for analyzing and mapping the escaping route. Three issues were considered as follows for the effective escape by multiple robots from the mazes in this paper. In the first, the mazes began to divide and secondly, dead-ends should be blocked. Finally, after the first arrivals at the destination, a shortcut should be provided for rapid escaping from the maze. The parallel-escape algorithms were applied to the different size of mazes, so that robot swarm can effectively get away the mazes.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1407-1417
• /
• 1996

In recent researches on thread partitioning algorithms break a thread at the long latency operation and merge threads to get the longer threads under the given constraints. Due to this limitation, even a program with little parallelism is partitioned into small-sized threads and context-swithings occur frequently. In the paper, we propose another method array localization about the array name, dependence distance(the difference of accessed element index from loop index), and the element usage that indicates whether element is used or defined. Using this information we can allocate array elements to the node where the corresponding loop activation is executed. By array localization, remote accesses to array elements can be replaced with local accesses to localized array elements. As a resuit,the boundaries of some threads are removed, programs can be partitioned into the larger threads and the number of context switchings reduced.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.74-87
• /
• 2000

PVM (parallel virtual machine) provides a programming environment that allows a collection of networked workstations to appear as a single parallel computational resource. The performance of parallel applications in this environment depends on the performance of data transfers between tasks. In this paper, we present a new Myrinet-based communication model of PVM that improves PVM communication performance over a high-speed Myrinet LAN. The proposed PVM communication model adopts a communication mechanism that allows any user-level process to directly access the network interface board without going through UDP/IP protocol stacks in the kernel. This mechanism provides faster data transfers between PVM tasks over the Myrinet since it avoids data copy overhead from kernel (user space) to user space (kernel) and reduces communication latency due to network protocol software layers. We implemented EPVM (Enhanced PVM), our updated version of the traditional PVM using UDP/IP, that is based on the proposed communication model over the Myrinet. Performance results show EPVM achieves communication speed-up of one to two over the traditional PVM.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.105-113
• /
• 1994

This paper introduces the Parallel Advanced Loosely coupled Multiprocessor (PALM) architecture, which is based on HCH(m,p), where m is number of links per a communication processor (CP) and p is the number of application processors (APs) connected to the CP. communication links between a pair of CPs and/or between a CP and an AP, are made of dual-Port RAMs, which provide fast and reliable word-parallel communication between processors. Among the wide spectrum of HCH networks, HCH(m,2) is also known to be a cost optimal topology, such that HCH(m,2) consists of the largest number of APs retaining the minimal number of CPs and communication links. We also implement a testbed based on HCH(2,2). The experiment result shows that the small communication/computation ratio of the PALM system would realize fine-grain parallelism on message-passing MIMD systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8B
• /
• pp.1371-1382
• /
• 2000

IMT-2000 system is the third generation mobile communication system which aims at mobile multimedia services with global roaming. Like 2nd generation system, the IMT-2000 system is also under strong influence of interferences among active subscribers in the multiple access environment. That is, in multiple access environment, signals from one subscriber could interfere with others in the same cell or in the neighboring cells. The interference control in the IMT-2000 systems is much more difficult then the interference control in the 2ndgeneration CDMA cellular systems, since the transmitted power of a subcriber might be different that of others in the IMT-2000 system. In this paper, a parallel interference cancellation with traffic discrimination is proposed which can effectively cancel interferences by grouping the subscribers into several equi-power classes. As a conclusion, simulation results show that the proposed method outperforms the conventional partial PIC scheme in several aspects.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1C
• /
• pp.45-54
• /
• 2010

This paper studies the design of a multiuser multiple-input multiple-output (MIMO) system, where a base station (BS) transmits independent messages to multiple users. The remarkable "dirty paper coding (DPC)" result was first presented by Costa that the capacity does not change if the Gaussian interference is known at the transmitter noncausally. While several implementable DPC schemes have been proposed recently for single-user dirty-paper channels, DPC is still difficult to implement directly in practical multiuser MIMO channels. In this paper, we propose a network channel matrix triangulation (NMT) algorithm for utilizing interference known at the transmitter. The NMT algorithm decomposes a multiuser MIMO channel into a set of parallel, single-input single-output dirty-paper subchannels and then successively employs the DPC to each subchannel. This approach allows us to extend practical single-user DPC techniques to multiuser MIMO downlink cases. We present the sum rate analysis for the proposed scheme. Simulation results show that the proposed schemes approach the sum rate capacity of the multiuser MIMO downlink at moderate signal-to-noise ratio (SNR) values.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.5 s.120
• /
• pp.486-495
• /
• 2007

In this paper, we present the design procedure of BPF(Band Pass Filter) for the suppression of LO(Local Oscillator) harmonics. The required suppression at given harmonics is the key issues in such a filter design, while the bandwidth and the suppression of the unwanted signals are more important in the conventional RF filter design. In LO filter design the bandwidth is used for the minimization of the insertion loss for the desired signal. In addition, we propose the novel tuning procedure based on Momentum to consider the unknown parasitic effects, which usually are not included in the circuit design step and results in undesirable and frustrating tuning after fabrication.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.27 no.4
• /
• pp.350-357
• /
• 2016

In this paper, a small mu-zero zeroth order resonance(ZOR) antenna based on meta structure is proposed using parasitic patch at 5.8 GHz. The mu-zero ZOR antenna is designed by utilizing the resonance of series inductance and capacitance of mu-negative transmission line and its size can be further reduced by a simple parasitic patch. The parasitic patch can increase series capacitance of mu-negative transmission line related to a resonant frequency. We have simulated and optimized dimension of the parasitic patch using Ansys commercial simulator(HFSS). As a result, the antenna has the following characteristics: kr of 0.59, efficiency of 92 %, and gain of 6.57 dBi. Also, its size is reduced by 24 % compared to a conventional mu-zero ZOR antenna. The measured results are in good agreement with the simulated results.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.131-134
• /
• 2005

This paper describes the efficient peer-to-peer migration method of Grid service agent on the mobile agent based P-Grid. The migration mechanism for transmitting service agent upon the service request is based on the peer's logic network topology. The network topologies that this system uses are organized as star topology, ring topology and tree topology, and agents are migrated by the master/slave method and serial/parallel method. The migration method of services is chosen based on the execution range and characteristic of the requested service. Also, the entire execution time of service is affected by the performance of peer that is a part of network topology, and the migration order, Therefore, the system monitors the performance of peers, and determines the migration priority based on analyzing and learning history. The system can reduce service execution time efficiently with decisions of migration method for service agent and priority of peers.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.1
• /
• pp.42-47
• /
• 2020

In OFDM-based very high-speed communication systems, FFT/IFFT processor should have several properties of low-area and low-power consumption as well as high throughput and low processing latency. Thus, radix-2k MDF (multipath delay feedback) architectures by adopting pipeline and parallel processing are suitable. In MDF architecture, the feedback memory which increases in proportion to the input signal word-length has a large area and power consumption. This paper presents a feedback memory size reduction method of radix-22 MDF IFFT processor for OFDM applications. The proposed method focuses on reducing the feedback memory size in the first two stages of MDF architectures since the first two stages occupy about 75% of the total feedback memory. In OFDM transmissions, IFFT input signals are composed of modulated data and pilot, null signals. In order to reduce the IFFT input word-length, the integer mapping which generates mapped data composed of two signed integer corresponding to modulated data and pilot/null signals is proposed. By simulation, it is shown that the proposed method has achieved a feedback memory reduction up to 39% compared to conventional approach.