• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.824-833
• /
• 2004

Due to the bandwidth and storage limitations, medical images are needed to be compressed before transmission and storage. DICOM (Digital Imaging and Communications in Medicine) specification, which is the medical images standard, provides a mechanism for supporting the use of JPEG still image compression standard. In this paper, we explain a method for compressing medical images by JPEG standard and propose two methods for JPEG compression. First, because medical images differ from natural images in optical feature, we propose a method to design adaptively the quantization table using spectrum analysis. Second, because medical images have higher pixel depth than natural images do, we propose a method to design Huffman table which considers the probability distribution feature of symbols. Therefore, we propose methods to design a quantization table and Huffman table suitable for medical images. Simulation results show the improved performance compared to the quantization table and the adjusted Huffman table of JPEG standard. Proposed methods which are satisfied JPEG Standard, can be applied to PACS (Picture Archiving and Communications System).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.86-100
• /
• 2004

To provide the end-to-end service differentiation for assured services, the random early demotion and promotion (REDP) marker in the edge router at each domain boundary monitors the aggregate flow of the incoming in-profile packets and demotes in-profile packets or promotes the previously demoted in-profile packets at the aggregate flow level according to the negotiated interdomain service level agreement (SLA). The REDP marker achieves UDP fairness in demoting and promoting packets through random and early marking decisions on packets. But, TCP fairness of the REDP marker is not obvious as for UDP sources. In this paper, to improve TCP fairness of the REDP marker, we propose a modified REDP marker where we combine a dropper, meters and a token filling rate configuration component with the REDP marker. To make packet transmission rates of TCP flows more fair, at the aggregate flow level the combined dropper drops incoming excessive in-profile packets randomly with a constant probability when the token level in the leaky bucket stays in demotion region without incoming demoted in-profile packets. Considering the case where the token level cannot stay in demotion region without the prior demotion, we propose a token filling rate configuration method using traffic meters. By using the token filling rate configuration method, the modified REDP marker newly configures a token filling rate which is less than the negotiated rate determined by interdomain SLA and larger than the current input aggregate in-profile traffic rate. Then, with the newly configured token filling rate, the token level in the modified REDP marker can stay in demotion region pertinently fir the operation of the dropper to improve TCP fairness. We experiment with the modified REDP marker using ns2 simulator fur TCP sources at the general case where the token level cannot stay in demotion region without the prior demotion at the negotiated rate set as the bottleneck link bandwidth. The simulation results demonstrate that through the combined dropper with the newly configured token filling rate, the modified REDP marker also increases both aggregate in-profile throughput and link utilization in addition to TCP fairness improvement compared to the REDP marker.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.111-117
• /
• 2009

In the wideband code division access (WCDMA) systems, a pilot channel is used to determine WCDMA network coverage, cell identification, synchronization, timing acquisition and tracking, user-set handoff, channel estimation, and so on. A wireless repeater, which is deployed in the urban area for the WCDMA system to meet the growing demand on wireless communication services, has the possibility to receive several pilot signals from a large number of base stations, however, cannot distinguish its service base station's signal among them. This pilot interference results in frequent handoffs in the user equipment, which degrades the radio reception, transmission efficiency, quality of service, and channel capacity and increases the unwanted power consumption. In this paper, thus, we propose a pilot pollution interference cancellation scheme using one of the adaptive estimation algorithms, normalized least mean square (NLMS), which is applicable to a wireless repeater. We carried out link-level and network-level computer simulations to evaluate the performance of the proposed scheme in a wireless repeater. The simulation results verify the bit error rate (BER) improvement in the link level and the call drop probability improvement in the network level.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.11
• /
• pp.9-17
• /
• 2011

As semiconductor process rapidly developed, the density of chips becomes higher and the space between adjacent lines narrows smaller. This trend increases the capacitance and inductance in interconnects and the coupling-capacitance of adjacent lines grows even bigger than the self-capacitance of themselves, especially in global interconnects. Inductive and capacitive coupling observed in these phenomena may cause serious problems in signal integrity. This paper proposes a codeword generation technique using extra interconnect lines to reduce the crosstalk caused by inductive and capacitive coupling and to reduce dynamic power consumption considering probability of input data. To estimate the performance of the proposed technique, the experimental results have been obtained using FastCap, FastHenry and HSPICE, and it has been shown that the power consumption using the proposed technique has yielded approximately 15% less than the results of the previous technique.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.119-128
• /
• 2003

The rapid increase of Internet users, diversity of application services, high speed data transmission, and extension of application areas have resulted in exponential growth of Internet traffic. In order to satisfy the increasing demand of bandwidth, the MPλS protocol, which is based on MPLS for efficient integration of WDM and IP protocols, has been suggested by IETF. In this paper, we present an MPλS simulator which enables to simulate various MPλS function such as optical crossconnect (OXC), multi-wavelength links, routing and wavelength assignment(RWA), and MPλS signaling and control. The simulator is developed based on the ns-2, an widely used multi-protocol network simulator. The function of the simulator is validated by running many simulation based on various scenarios and performance measures such as throughput and blocking probability. The simulator could be widely utilized for validation of proposed protocols before developing real optical network systems.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.538-547
• /
• 2001

Currently, 2D real-time image coding techniques had great developments and many related products were commercially developed. However, these techniques lack the capability of handling 3D actuality, occurred by the advent of virtual reality, because they handle only the temporal transmission for 2D image. Besides, many 3D virtual reality researches have been studied in computer graphics. Since the graphical researches were limited to the application of artificial models, the 3D actuality for real scene images could not be managed also. Therefore, a new 3D model extraction method based on stereo vision, that can deal with real scene virtual reality, is proposed in this paper. The proposed method adapted a compact genetic algorithm using population-based incremental learning (PBIL) to matching environments, in order to reduce memory consumption and computational time of conventional genetic algorithms. Since the PBIL used a probability vector and competitive learning, the matching algorithm became simple and the computation load was considerably reduced. Moreover, the matching quality was superior than conventional methods. Even if the characteristics of images are changed, stable outputs were obtained without the modification of the matching algorithm.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.20 no.3
• /
• pp.133-140
• /
• 2012

In this study, 3 kinds of models about bike frame are simulated with static structural analysis, And fatigue life, damage and durability according to fatigue load are analyzed. A bike frame model with diamond type is compared with another model on the reinforced support with its type. In case of the reinforced support type, maximum equivalent stress or total deformation is shown with 10% or 20% more than the diamond type respectively. At both types of models, the trends of fatigue life and damage at both types are same. 'SAE bracket history' with the severest change of load becomes most unstable but 'Sample history' becomes most stable among the cases of nonuniform fatigue loads. In case of 'Sample history' with the average stress of 0 to -1MPa and the amplitude stress of 0 to 1MPa, the possibility of maximum damage becomes 3%. This stress state can be shown with 6 times more than the damage possibility of 'SAE Bracket history' or 'SAE transmission'. In case of the reinforced support type, fatigue life becomes shorter and damage probability becomes larger at the right side installed with support than diamond type. The structural result of this study can be effectively utilized with the design on bike frame by investigating prevention and durability against its damage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5B
• /
• pp.464-470
• /
• 2011

V2V (Vehicle-to-Vehicle) is a special kind of VANET (Vehicular Ad-hoc Network), which has high mobility and frequent topology changes and causes the link breakage problem. To resolve this problem, geographic routing protocols such as greedy forwarding are proposed. However, the greedy forwarding approach selects the node closest to the destination node as the transfer node within the transmission range so that it may cause many problems owing to many intersections and many changes in vehicular traffic in urban areas. The paper proposes a greedy perimeter urban routing (GPUR) algorithm considering the presence of 2-hop neighbor nodes and the road characteristics. Simulation results using ns-2 reveal that the proposed GPUR algorithm significantly reduces the routing error problem and the probability of local maximum than the existing routing protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.652-657
• /
• 2003

In this paper, Adaptive Modulation and Coding (AMC) is combined with Multiple Input Multiple Output (MIMO) multiplexing to improve the throughput performance of AMC. In addition, a system that adopts Selection Transmit Diversity (STD) in the AMC-MIMO multiplexing system is proposed. The received SNR is improved by adopting STD techniques. And it increases probability of selecting MCS (Modulation and Coding Scheme) level that supports higher data rate. This leads to an increased throughput of the AMC-MIMO system. STD in our simulation selects 2 transmission antennas from 4 antennas and AMC-MIMO multiplexing process operates with the selected antennas. The computer simulation is performed in flat Rayleigh fading channel. The results show that the proposed system achieves a gain of 1Mbps over the AMC-MIMO multiplexing system with the same number of antennas at 15dB SNR.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.1013-1019
• /
• 2016

This paper describes a novel Context-awareness Markov Chain Prediction (CMCP) algorithm based on movement prediction using Markov chain in Delay Tolerant Network (DTN). The existing prediction models require additional information such as a node's schedule and delivery predictability. However, network reliability is lowered when additional information is unknown. To solve this problem, we propose a CMCP model based on node behaviour movement that can predict the mobility without requiring additional information such as a node's schedule or connectivity between nodes in periodic interval node behavior. The main contribution of this paper is the definition of approximate speed and direction for prediction scheme. The prediction of node movement forwarding path is made by manipulating the transition probability matrix based on Markov chain models including buffer availability and given interval time. We present simulation results indicating that such a scheme can be beneficial effects that increased the delivery ratio and decreased the transmission delay time of predicting movement path of the node in DTN.