• Journal of Advanced Navigation Technology
• /
• v.6 no.1
• /
• pp.44-51
• /
• 2002

This paper describes the performance evaluation and analysis of an Orthogonal Frequency-Division Multiplexing (OFDM) system having the least Inter Symbol Interference (ISI) in a multi-path fading channel environment. Wireless Local Area Network (W-LAN) in accordance with IEEE 802.11a and IEEE 802.11b provides high-speed transmission to universities, businesses and other various places. In addition, service providers can offer a public W-LAN service on restricted areas such as a subway. The proliferation of W-LAN has led to greater W-LAN service demands, but problems are also on the rise in offering a good W-LAN service. In particular, urban areas with high radio wave interference and many buildings are vulnerable to deteriorated QoS including disconnected data and errors. For example, when high-speed data is transmitted in such areas, the relatively high frequency generates ISI between Access Points (AP) and Mobile Terminals (such as a notebook computer), leading to a frequency selective fading channel environment. Consequently, it is difficult to expect a goodW-LAN service. The simulation proves that the OFDM system enables W-LAN to implement QoS in high-speed data transmission in a multi-path fading channel environment. The enhanced OFDM performance with 52 sub-carriers is verified via data modulation methods such as BPSK, QPSK and 16QAM based on IEEE 802.11a and punched convolutional codes with code rate of 1/2 and 3/4 and constraint length of 7. Especially, the simulation finds that the OFDM system has better performance and there is no data disconnection even in a mobile environment by applying a single tap equalizer and a decision feedback equalizer to a mobile channel environment with heavy fading influence. Given the above result, the OFDM system is an ideal solution to guarantee QoS of the W-LAN service in a high-speed mobile environment.

• Journal of KIISE:Software and Applications
• /
• v.29 no.11
• /
• pp.767-774
• /
• 2002

Conventional research on image restoration has focused on restoring degraded images resulting from image formation, storage and communication, mainly in the signal processing field. Related research on recovering original image information of caption regions includes a method using BMA(block matching algorithm). The method has problem with frequent incorrect matching and propagating the errors by incorrect matching. Moreover, it is impossible to recover the frames between two scene changes when scene changes occur more than twice. In this paper, we propose a method for recovering original images using EBMA(Extended Block Matching Algorithm) and a region compensation method. To use it in original image recovery, the method extracts a priori knowledge such as information about scene changes, camera motion and caption regions. The method decides the direction of recovery using the extracted caption information(the start and end frames of a caption) and scene change information. According to the direction of recovery, the recovery is performed in units of character components using EBMA and the region compensation method. Experimental results show that EBMA results in good recovery regardless of the speed of moving object and complexity of background in video. The region compensation method recovered original images successfully, when there is no information about the original image to refer to.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.466-474
• /
• 2007

Asymmetric networks that the downlink bandwidth is larger than the uplink bandwidth may cause the degradation of the TCP performance due to the uplink congestion. In order to solve this problem, this paper designs and implements the Dynamic Segment Size Control mechanism which offers a suitable segment size for current networks. The proposed mechanism does not require any changes in customer premises but suppress the number of ACKs using segment reassembly technique to avoid the uplink congestion. The gateway which adapted the Dynamic Segment Size Control mechanism, detects the uplink congestion condition and dynamically measures the bandwidth asymmetric ratio and the packet loss ratio. The gateway reassembles some of segments received from the server into a large segment and transmits it to the client. This reduces the number of corresponding ACKs. In this mechanism, the SACK option is used when occurs the bit error during the transmission. Based on the simulation in the GEO satellite network environment, we analyzed the performance of the Dynamic Segment Size Control mechanism.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.7
• /
• pp.97-103
• /
• 2004

In this paper, we propose a high speed block turbo code decoding algorithm and an efficient hardware architecture. The multimedia wireless data communication systems need channel codes which have the high-performance error correcting capabilities. Block turbo codes support variable code rates and packet sizes, and show a high performance due to a soft decision iteration decoding of turbo codes. However, block turbo codes have a long decoding time because of the iteration decoding and a complicated extrinsic information operation. The proposed algorithm using the threshold that represents a channel information reduces the long decoding time. After the threshold is decided by a simulation result, the proposed algorithm eliminates the calculation for the bits which have a good channel information and assigns a high reliability value to the bits. The threshold is decided by the absolute mean and the standard deviation of a LLR(Log Likelihood Ratio) in consideration that the LLR distribution is a gaussian one. Also, the proposed algorithm assigns '1', the highest reliable value, to those bits. The hardware design result using verilog HDL reduces a decoding time about 30% in comparison with conventional algorithm, and includes about 20K logic gate and 32Kbit memory sizes.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.20-28
• /
• 2005

TCP(Transmission Control Protocol) is one of the most important Internet protocols, which is widely used in wireless networks as well as wired networks. However, when TCP is deployed for wireless networks, it takes severe performance degradation because TCP was designed for wired network. To overcome this drawback, a number of TCP variants have been proposed in the literature. However, most previous schemes did not consider TCP enhancement over heterogeneous networks. In heterogeneous networks, an mobile node (MN) may move from one access network to another(i.e., vertical handover). In the case of vertical handover, an MN experiences a TCP performance degradation caused by the packet loss and the sudden change of link characteristics between two different access networks. In this work, we investigate the TCP performance degradation occurred in vortical handover across heterogeneous networks. First, we have conducted the measurement study over GPRS-WLAN testbed. In the measurement study. we observed the TCP performance degradation in the case of handover from WLAN to GPRS. In order to study more different TCP behaviors during vertical handover, we performed comprehensive simulations using a network simulator 2(ns-2). Based on measurement and simulation results, we investigated how to improve TCP performance in vertical handover and we concluded that the existing mechanisms cannot be perfect solutions and new mechanisms are strongly required.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.1
• /
• pp.7-14
• /
• 2013

Presently, there are many different technologies used for position detection. However, as signal-receiving devices operating in different locations must detect the precise position of objects located at long distances, it is essential to know the precise time at which an object's or a user's terminal device sends a signal. For this purpose, the existing time of arrival (ToA) technology is not sufficiently reliable, and the existing time difference of arrival (TDoA) technology is more suitable. If a TDoA-based electric surveillance system and other tracking devices fail to achieve precise time-synchronization between devices with separation distance operation, it is impossible to obtain correct TDoA values from the signals sent by the signal-receiving devices; this failure to obtain the correct values directly affects the location estimation error. For this reason, the technology for achieving precise time synchronization between signal-receiving devices in separation distance operation, among the technologies previously mentioned, is a core technology for detecting TDoA-based locations. In this paper, the accuracy of the proposed time synchronization and the measurement error in the TDoA-based location detection technology is evaluated. The TDoA-based location measurement error is significantly improved when using the proposed method for time-synchronization error reduction.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.219-231
• /
• 2005

Many applications in cluster computing require QoS (Quality of Service) services. Since performance predictability is essential to provide QoS service, underlying systems must provide predictable performance guarantees. One way to ensure such guarantees from network subsystems is to generate global schedules from applications'network requests and to execute the local portion of the schedules at each network interface. To ensure accurate execution of the schedules, it is essential that a global time base must be maintained by local clocks at each network interface. The task of providing a single time base is called a synchronization problem and this paper addresses the problem for system area networks. To solve the synchronization problem, FM-QoS (1) proposed a simple synchronization mechanism called FBS(Feedback-Based Synchronization) which uses built-in How control signals. This paper extends the basic notion of FM-QoS to a theoretical framework and generalizes it: 1) to identify a set of built-in network flow control signals for synchrony and to formalize it as a synchronizing schedule, and 2) to analyze the synchronization precision of FBS in terms of flow control parameters. Based on generalization, two application classes are studied for a single switch network and a multiple switch network. For each class, a synchroniring schedule is proposed and its bounded skew is analyzed. Unlike FM-QoS, the synchronizing schedule is proven to minimize the bounded skew value for a single switch network. To understand the analysis results in practical networks, skew values are obtained with flow control parameters of Myrinet-1280/SAN. We observed that the maximum bounded skew of FBS is 9.2 Usec or less over all our experiments. Based on this result, we came to a conclusion that FBS was a feasible synchronization mechanism in system area networks.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.6
• /
• pp.65-71
• /
• 2017

Digital images and videos are subject to various types of noise during storage and transmission. Among these noises, Salt & Pepper noise degrades the compression efficiency of the original data and causing deterioration of performance in edge detection or segmentation used in an image processing method. In order to mitigate this noise, there are many filters such as Median Filter, Weighted Median Filter, Center Weighted Median Filter, Switching Weighted Median Filter and Adaptive Median Filter. However these methods are inferior in performance at high noise density. In this paper we propose a new type of filter for noise mitigation in wireless communication environment where Salt & Pepper noise occurs. The proposed filter detects the location of the damaged pixel by Salt & Pepper noise detection and mitigates the noise by using adjacent pixel values which are not damaged in a certain area. Among the proposed filters, the performance of the filter using the $3{\times}3$ error mask is compared with that of the conventional methods and it is confirmed that when density of noise in the image is 95%, their performances are improved as 13.24 dB compared to MF and 13.09 dB compared to AMF.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.11 s.114
• /
• pp.1120-1131
• /
• 2006

This paper describes the numerical analysis techniques using the Combined Integration/Matrix Method to calculate ground potential rise which can be occurred in the various grounding systems. Combined Integration/Matrix Method is used to reduce the error and computation time with the analytical integration equation and the proper segmentaion of earth embedded conductor. To do it, optimal segmentaion method for the buried conductors is presented through error analysis which is capable of applying the practical scaled various grounding systems. The optimum length of segmented element is much co-related with the buried depth of grounding electrode and the maximum length of buried electrode. As a result, less 3 precent errors was obtained by proposed model. The proposed model is applied to verify an effect of multi-grounding problems which was aroused much controversy with separated or common grounding between the high power grounding system and low power grounding system such as signal and telecommunication grounding.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.409-414
• /
• 2010

The applications based on geographical location are increasing rapidly in wireless sensor networks (WSN). Recently, various localization algorithms have been proposed but the majority of algorithms rely on the specific hardware to measure the distance from the signal sources. In this paper, we propose the Weighted Multiple Rings Localization(WMRL). We assume that each deployed anchor node may periodically emit the successive beacon signals of the different power level. Then, the beacon signals form the concentric rings depending on their emitted power level, theoretically. The proposed algorithm defines the different weighting factor based on the ratio of each radius of ring. Also, If a sensor node may listen, it can find the innermost ring of the propagated signal for each anchor node. Based on this information, the location of a sensor node is derived by a weighted sum of coordinates of the surrounding anchor nodes. Our proposed algorithm is fully distributed and does not require any additional hardwares and the unreliable distance indications such as RSSI and LQI. Nevertheless, the simulation results show that the WMRL with two rings twice outperforms centroid algorithm. In the case of WMRL with three rings, the accuracy is approximately equal to WCL(Weighted Centroid Localization).