• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.215-218
• /
• 1998

This paper proposes a blind multi-user detector using Code-Constrained Minimum Variance (CCMV) method which directly detects the DS-CDMA signals in a multipath fading channel without estimating the channels. This algorithm reduces the complexity of computation by making a small size data matrix with the order of the channel length. Advantageously it requires to know the spreading code and the time delay of only the desired user.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.3
• /
• pp.1711-1717
• /
• 2014

There have been many studies on IEEE 802.15.4 for home area networks(HAN) in Smart Grids. Existing unslotted or slotted IEEE 802.15.4 has almost not met strict conditions of the U.S. Department Of Energy(DOE). This study proposed a improved algorithm that reduces collisions, delay time and changes in the delay time. For this purpose, numbers were given to nodes to make the transmission in the order of the node numbers. Since the probability of the occurrence of collisions would decrease compared to random transmission if the nodes were given numbers, Backoff time was set at 0. In the proposed Numbered-Unslotted-ZeroBackoff algorithm, when the packet size was 133 octets and less than 180 packets per second occurred, it was found that packet delivery ratio was over 99.99%, and that all the maximum delay, the mean delay and the minimum delay were less than 0.02 seconds. This paper could confirm that the algorithm proposed in this study met the strict conditions of the DOE.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.349-359
• /
• 2009

In this paper, we propose a stereo-video transmission method for reduction of delay and maximization of 3D effect. Conventional multimedia synchronization algorithms were designed to achieve minimum delay and synchronize multiple video and audio streams, however, they could not be effective for 3D video transmission. In this paper, we proposed a synchronization algorithm by considering the minimum error of time difference between streams for 3D effect. The minimum error of time difference for 3D effect was derived based on a 3D subjective quality test. We compute display time of the delivered videos within the allowed time-difference and the video are displayed according to the display time. To evaluate the performance of the proposed algorithm, we implemented a real-time video communication system and subjective quality test has been conducted with the proposed system. We found that video quality displayed by the proposed system. We found that video quality displayed by the proposed algorithm ranks 'good' and 'excellent' in the DMOS (Differential Mean Opinion Score) scale, based on the MOS (Mean Opinion Score) test.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1609-1615
• /
• 2006

Overlay multicast technique is an effective way as an alternative to IP multicast. Traditional IP multicast is not widely deployed because of the complexity of IP multicast technology and lack of application. But overlay multicast can be easily deployed by effectively reducing complexity of network routers. Because overlay multicast resides on top of densely connected IP network, In case of multimedia streaming service over overlay multicast tree, real-time data is sensitive to end-to-end delay. Therefore, moderate algorithm's development to this network environment is very important. In this paper, we are interested in minimizing maximum end-to-end delay in overlay multicast tree. The problem is formulated as a degree-bounded minimum delay spanning tree, which is a problem well-known as NP-hard. We develop tabu search heuristic with intensification and diversification strategies. Robust experimental results show that is comparable to the optimal solution and applicable in real time

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.417-422
• /
• 1993

Robots working in the multiple robot system can perform the variety of tasks compared to the single robot system, while they are subject to the various tight constraints such as the precise coordination and the mutual collision avoidance during the task execution. In this paper, we provide an algorithm and graphical verification for collision avoidance between two robots working together. The algorithm calculates the minimum time delay for collision avoidance and the graphical verification is performed through the 3-D graphic simulator.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.528-531
• /
• 2004

This paper presents the design and implementation of a QoS based IrDA in mobile phones. The IrDA standards have arised from the need to connect various mobile devices together. But currently, we have a difficult to connecting various mobile devices together. The difficult thing is to adjust the minimum turn around time. The minimum turn around time in IrDA deals with the time needed for a receiver circuit to recover following saturation by transmissions from the same device (turn around latency). This parameter corresponds to the required time delay between the last byte of the last frames sent by a station and the point at which it is ready the first byte of a frame from another station. This parameter comes into play when the link is turned around and is negotiated independency for each station. We solve this matter by using the Dynamic Adjustment Algorithm (DAA). The dynamic adjustment algorithm adjusts the minimum turn around time according to the numbers of devices. We apply our direct adjustment algorithm to our QoS based IrDA in mobile phones and show the improved performance of connection with various mobile phones together.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.245-251
• /
• 2016

This paper suggests a heuristic algorithm to obtain optimal solution of minimum number of aircraft delay in multi-airport arrivals/departures problem. This single airport arrivals/departures problem can be solved by mathematical optimization method only. The linear programming or genetic algorithm that is a kind of metaheuristic method is used for a multi-airport arrivals/departures problem. Firstly, the proposed algorithm selects the median minimum delays capacity in various arrivals/departures capacities at an airport for the number of aircraft in $i^{th}$ time interval (15 minutes) at each airport. Next, we suggest reallocate method for arrival aircraft between airports. This algorithm better result of the number of delayed aircraft then genetic algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.89-96
• /
• 2016

In this paper, we study mobile data collector (MDC) based data-gathering schemes in wireless sensor networks. In Such networks, MDCs are used to collect data from the environment and transfer them to the sink. The majority of existing data-gathering schemes suffer from high data-gathering latency because they use only a single MDC. Although some schemes use multiple MDCs, they focus on maximizing network lifetime rather than minimizing packet delay. In order to address the limitations of existing schemes, this paper focuses on minimizing packet delay for given number of MDCs and minimizing the number of MDCs for a given delay bound of packets. To achieve the minimum packet delay and minimum number of MDCs, two optimization problems are formulated, and traveling distance and traveling time of MDCs are estimated. The interior-point algorithm is used to obtain the optimal solution for each optimization problem. Numerical results and analysis are presented to validate the proposed method.

• International Journal of Internet, Broadcasting and Communication
• /
• v.4 no.1
• /
• pp.18-22
• /
• 2012

In this paper, we propose an equivalent Wiener-Hopf equation. The proposed algorithm can obtain the weight vector of a TDL(tapped-delay-line) filter and the error simultaneously if the inputs are orthogonal to each other. The equivalent Wiener-Hopf equation was analyzed theoretically based on the MMSE(minimum mean square error) method. The results present that the proposed algorithm is equivalent to original Wiener-Hopf equation. In conclusion, our method can find the coefficient of the TDL (tapped-delay-line) filter where a lattice filter is used, and also when the process of Gram-Schmidt orthogonalization is used. Furthermore, a new cost function is suggested which may facilitate research in the adaptive signal processing area.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.2
• /
• pp.279-287
• /
• 1993

In this paper, double laxity threshold MLT(Minimum Laxity Threshold) algorithm and double queue threshold QLT(Queue Length Threshold) algorithm are proposed as DPS(Dynamic Priority Scheduling) techniques for advanced processing of multiple class traffics. Also, the performance of the proposed algorithms is analyzed by a computer simulation. According to the simulation results, it can be shown that the proposed double laxity threshold ML T algorithm advances the processing performance versus ML T algorithm for 2 or more classes delay sensitive traffics, and that double queue length threshold QL T algorithm provides more efficient performance than QL T for 2 or more classes of non real time traffics.