• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.86-94
• /
• 2010

In this paper, we present a decentralized algorithm to find minimum cost quality of service (QoS) flow subgraphs in network coded multicast schemes. The main objective is to find minimum cost subgraphs that also satisfy user-specified QoS constraints, specifically with respect to rate and delay demands. We consider networks with multiple multicast sessions. Although earlier network coding algorithms in this area have demonstrated performance improvements in terms of QoS parameters, the proposed QoS network coding approach provides a framework that guarantees QoS constraints are actually met over the network.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.281-285
• /
• 2011

One of the key issues in implementing RFID systems is to design anti-collision protocols for identifying all the tags in the interrogation zone of a RFID reader with the minimum identification delay. In this paper, Furthermore, in designing such protocols, the limited resources in tags and readers in terms of memory and computing capability should be fully taken into consideration. we first investigate two typical RFID anti-collision algorithms, namely RFID Gen2 Q algorithm (accepted as the worldwide standard in industrial domain) and FAFQ algorithm including their drawbacks and propose a new RFID anti-collision algorithm, which can improve the performance of RFID systems in terms of tag identification time considerably. Further, we compared performance of the proposed algorithm with Q algorithm and FAFQ algorithm through computer simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1569-1574
• /
• 2008

Almost all the RFID systems in the 13.56MHz ISM band adopt the FSA algorithm as the anti-collision algorithm. The FSA algorithm is based on the slotted ALOHA with a fixed frame size. The FSA, though simple, has a disadvantage that when the number of tags is variable, the system performance degrades because of the fixed frame size. Therefore, this paper proposes a new OFSA. The proposed OFSA algorithm dynamically allocates the optimal frame size at every frame based on the number of tags in the reader's identification range. According to the simulation results, the system efficiency of the proposed algorithm should be maintained optimally. Also, the proposed algorithm always obtained the minimum tag identification delay.

• The Journal of the Acoustical Society of Korea
• /
• v.33 no.4
• /
• pp.262-267
• /
• 2014

Recently, long pulses are transmitted for target detection in active sonar application. Matched filtering implemented by simple convolution algorithm, requires massive computational power for long replica. The computational loads are reduced significantly by implementing the convolution in the frequency domain with overlap add method, but the performance degrades for specified input/output system delay which constrains the size of FFT function. For performance improvement, the replica could be partitioned into uniform blocks (FDL) by re-using IFFT operations, or variable blocks of increasing length (MC) by using the largest possible blocks to calculate the convolution. In this paper, by combining the strong points of the two methods, we propose a new filter partition structure that allows for further optimization of the previous two methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4873-4888
• /
• 2018

A joint blind parameter estimation algorithm based on minimum channel stability function aimed at the non-cooperative high-order modulated paired carrier multiple access (PCMA) signals is proposed. The method, which uses hierarchical search to estimate time delay, amplitude and frequency offset and the estimation of phase offset, including finite ambiguity, is presented simultaneously based on the derivation of the channel stability function. In this work, the structure of hierarchical iterative processing is used to enhance the performance of the algorithm, and the improved algorithm is used to reduce complexity. Compared with existing data-aided algorithms, this algorithm does not require a priori information. Therefore, it has significant advantage in solving the problem of blind parameter estimation of non-cooperative high-order modulated PCMA signals. Simulation results show the performance of the proposed algorithm is similar to the modified Cramer-Rao bound (MCRB) when the signal-to-noise ratio is larger than 16 dB. The simulation results also verify the practicality of the proposed algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.466-476
• /
• 1995

This pater describes pipelining algorithm issues for a VLIW(Very Long Instruction Word) System and the effective pipelined processing method by occurrence in pipelined management of processor minimized to timing delay. The proposed algorithm is executed in pipeline and parallel processings, and by combining basic operations variable instruction set can be desinged for various applications. In this paper, we prove and analyze the efficiency of the proposed pipeline algorithm and compare with other processor pipeline algorithm in terms of time minimizing.

• The Journal of Korea Robotics Society
• /
• v.3 no.3
• /
• pp.237-244
• /
• 2008

Nowadays, research on human-robot interaction has been getting increasing attention. In the research field of human-robot interaction, speech signal processing in particular is the source of much interest. In this paper, we report a speaker localization system with six microphones for a humanoid robot called MAHRU from KIST and propose a time delay of arrival (TDOA)-based feature matrix with its algorithm based on the minimum sum of absolute errors (MSAE) for sound source localization. The TDOA-based feature matrix is defined as a simple database matrix calculated from pairs of microphones installed on a humanoid robot. The proposed method, using the TDOA-based feature matrix and its algorithm based on MSAE, effortlessly localizes a sound source without any requirement for calculating approximate nonlinear equations. To verify the solid performance of our speaker localization system for a humanoid robot, we present various experimental results for the speech sources at all directions within 5 m distance and the height divided into three parts.

• Journal of Korea Multimedia Society
• /
• v.18 no.11
• /
• pp.1375-1382
• /
• 2015

This paper aims to introduce the numerical methods for solving the optimal control theory to model bufferbloat problem. Mathematical tools are useful to provide insight for system engineers and users to understand better about what we are facing right now while experiment in a large-scale testbed can encourage us to implement in realistic scenario. In this paper, we introduce a survey of the numerical methods for solving the optimal control problem. We propose the dynamic optimization sweeping algorithm for optimal control of the active queue management. Simulation results in network simulator ns2 demonstrate that our proposed algorithm can obtain the stability faster than the others while still maintain a short queue length (≈10 packets) and low delay experience for arriving packets (0.4 seconds).

• Korean Management Science Review
• /
• v.23 no.2
• /
• pp.161-174
• /
• 2006

In this paper, we consider a network optimization problem arising from the deployment of BcN access network. BcN convergence services requires that access networks satisfy QoS meausres. BcN services have two types of traffics : stream traffic and elastic traffic. Stream traffic uses blocking probability as a QoS measure, while elastic traffic uses delay factor as a QoS measure. Incorporating the QoS requirements, we formulate the problem as a nonlinear mixed-integer Programming model. The Proposed model seeks to find a minimum cost dimensioning solution, while satisfying the QoS requirement. We propose two local search heuristic algorithms for solving the problem, and develop a network design system that implements the developed heuristic algorithms. We demonstrate the computational efficacy of the proposed algorithm by solving a realistic network design problem.

• Journal of Advanced Navigation Technology
• /
• v.23 no.1
• /
• pp.1-7
• /
• 2019

Thisstudy presentsthe development of a fast-time airport surface simulator. The simulator usesthe output from a first-come first-served (FCFS) scheduler and has adopted one-dimensional dynamic model to simulate the movement of the aircraft on the surface. Higher collision risks situations in the airport surface traffic are analyzed to classify those situations into six cases. A conflict detection and resolution algorithm is implemented to maintain separation distance and to prevent deadlock. The simulator was tested with a scenario at the Incheon International Airport that contains 72 aircraft. Without the conflict detection and resolution, various conflict situations are identified. When the conflict detection and resolution algorithm is managing the traffic, it is confirmed that the conflicts are removed at the price of additional delays. In the conflict resolution algorithm, three prioritization strategies are implemented, and delayed aircraft count and average additional delays are compared. Prioritization based on remaining time or distance showed smaller total additional delay compared to choosing minimum delay priority for each situation.