Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The Journal of Korean Institute of Communications and Information Sciences
Journal Basic Information
Journal DOI :
The Korean Institute of Communications and Information Sciences
Editor in Chief :
Kyung-Hi Chang / Song Chong / Jong-Taek Oh / Jae-Jin Lee / Myung-Sik Yoo
Volume & Issues
Volume 28, Issue 12C - Dec 2003
Volume 28, Issue 12B - Dec 2003
Volume 28, Issue 12A - Dec 2003
Volume 28, Issue 11C - Nov 2003
Volume 28, Issue 11B - Nov 2003
Volume 28, Issue 11A - Nov 2003
Volume 28, Issue 10C - Oct 2003
Volume 28, Issue 10B - Oct 2003
Volume 28, Issue 10A - Oct 2003
Volume 28, Issue 9C - Sep 2003
Volume 28, Issue 9B - Sep 2003
Volume 28, Issue 9A - Sep 2003
Volume 28, Issue 8C - Aug 2003
Volume 28, Issue 8B - Aug 2003
Volume 28, Issue 8A - Aug 2003
Volume 28, Issue 7C - Jul 2003
Volume 28, Issue 7B - Jul 2003
Volume 28, Issue 7A - Jul 2003
Volume 28, Issue 6C - Jun 2003
Volume 28, Issue 6B - Jun 2003
Volume 28, Issue 6A - Jun 2003
Volume 28, Issue 5C - May 2003
Volume 28, Issue 5B - May 2003
Volume 28, Issue 5A - May 2003
Volume 28, Issue 4C - Apr 2003
Volume 28, Issue 4B - Apr 2003
Volume 28, Issue 4A - Apr 2003
Volume 28, Issue 3C - Mar 2003
Volume 28, Issue 3B - Mar 2003
Volume 28, Issue 3A - Mar 2003
Volume 28, Issue 2C - Feb 2003
Volume 28, Issue 2B - Feb 2003
Volume 28, Issue 2A - Feb 2003
Volume 28, Issue 1C - Jan 2003
Volume 28, Issue 1B - Jan 2003
Volume 28, Issue 1A - Jan 2003
Volume 28, Issue 9 - 00 2003
Volume 28, Issue 8 - 00 2003
Volume 28, Issue 7 - 00 2003
Volume 28, Issue 6 - 00 2003
Volume 28, Issue 5 - 00 2003
Volume 28, Issue 3 - 00 2003
Volume 28, Issue 2 - 00 2003
Volume 28, Issue 1 - 00 2003
Selecting the target year
Effective Scheduling Algorithm using Queue Separation and Packet Segmentation for Jumbo Packets
The Journal of Korean Institute of Communications and Information Sciences, volume 28, issue 9A, 2003, Pages 663~668
With the advent of high speed networking technology, computers connected to the high-speed networks tend to consume more of their CPU cycles to process data. So one of the solutions to improve the performance of the computers is to reduce the CPU cycles for processing the data. As the consumption of the CPU cycles is increased in proportion to the number of the packets per second to be processed, reducing the number of the packets per second by increasing the length of the packet is one of the solutions. In order to meet this requirement, two types of jumbo packets such as jumbograms and jumbo frames have already been standardized or being discussed. In case that the jumbograms and general packets are interleaved and scheduled together in a router, the jumbogrms may deteriorate the QoS of the general packets due to the transfer delay. They also frequently exhaust the memory with storing the huge length of the packets. This produces the congestion state easily in the router that results in the loss of the packets. In this paper, we analyze the problems in processing the jumbo packets and suggest a noble solution to overcome the problems.
Improvement of duty rate on Meteor Burst Communication using DS-SS system
The Journal of Korean Institute of Communications and Information Sciences, volume 28, issue 9A, 2003, Pages 669~677
In spite of many advantages of Meteor Burst Communications(MBC) on its transmission channel, the fact that its duty rate is less than10 percents is a considerable deficiency of MBC. To overcome with this deficiency without paying large cost, we use a direct sequence(DS)-spread spectrum(SS) method applying a reference code to improve the duty rate on the transmission channel. This method doesn't need to add the components for acquisition or tracking the signal so that it keeps the cost efficiency the MBC has as well as improves the duty rate on the transmission channel. The improvement by this method is more significant when the received signal is weak. Simulation results show that if we increases the process gain (Gp) by 10 dB when the average burst length is 50ms, the burst length tends to be extended more than 220% of its average length, 160ms, and the frequency of generating this phenomenon increases 3.1 times more.
PN Code Acquisition at Low Signal-to-Noise Ratio Based on Seed Accumulating Sequential Estimation
The Journal of Korean Institute of Communications and Information Sciences, volume 28, issue 9A, 2003, Pages 678~683
The pseudo-noise (PN) code acquisition based on the sequential estimation (SE) proposed by Ward performs well only at relatively high chip signal-to-noise ratios (SNRs). In this paper, a seed accumulating sequential estimation (SASE) method and a PN code acquisition system based on it are proposed, which perform well at low chip SNR (of practical interest) also. Then, the mean acquisition time performance of the proposed system is investigated. Numerical results show that the system based on the SASE performs dramatically better than that based on the SE at low chip SNR, and the improvement becomes larger as the period of PN code increases.
Delay Analysis of a Message based on the Stop-and-Wait ARQ in a Time- Varying Radio Link
The Journal of Korean Institute of Communications and Information Sciences, volume 28, issue 9A, 2003, Pages 684~693
This paper analyzes transmissiondelays of a message and a packet in a time-varying and packet-based radio link. The paper assumes that thearrivals of messages have a Bernoulli process and the lengths of the messages a exponential distribution. To reflect the feature of the time-varying radio link, we use a two-state Markov model. From the model the mean transmission delay of and the mean queue length of the packet are analyzed in terms of the packet distribution function, the packet transmission service time, and the PER of the radio link. And the mean message transmission delay time and the mean queue length are derived using the performance indices of the packet. Numerical results show that the message arrival rate and the message length have some bounds to keep the transmission of the message steady and to improve the performance indices of the message. It can be known that the PER of the state influences on the performance indices more than the sojourn time of the state.
Performance Analysis of Smart Antenna Base Station Implemented for CDMA2000 1X
The Journal of Korean Institute of Communications and Information Sciences, volume 28, issue 9A, 2003, Pages 694~701
In this paper, we present a hardware structure and new features of a smart antenna BTS (Base Transceiver Station) for CDMA2000 1X system. The proposed smart antenna BTS is a composite system consisting of many subsystems, i.e., array antenna element, frequency up/down converters, AD (Analog-to-Digital) and DA (Digital-to-Analog) converters, spreading/despreading units, convolutional encoder/Viterbi decoder, searcher, tracker, beamformer, calibration unit etc. Through the experimental tests, we found that the desired beam-pattern in both uplink and downlink communications is provided through the calibration procedure. Also it has been confirmed that the adaptive beamforming algorithm adopted to our smart antenna BTS is fast and accurate enough to support 4 fingers to each user. In our experiments, commercial mobile terminals operating PCS (Personal Communication System) band have been used. It has been confirmed that the smart antenna BTS tremendously improves the FER (Frame Error Rate) performance compared to the conventional 2-antenna diversity system.
MAC Scheduling Algorithm for Efficient Management of Wireless Resources in Bluetooth Systems
The Journal of Korean Institute of Communications and Information Sciences, volume 28, issue 9A, 2003, Pages 702~709
In this paper, we propose an efficient and QoS-aware MAC scheduling algorithm for Bluetooth, which considers both throughput and delay performance of each Master-Slave pair in scheduling decisions, and thus, attempts to maximize overall performance. The proposed algorithm, MTDPP (Modified Throughput-Delay Priority Policy), makes up for the drawbacks of T-D PP (Throughput-Delay Priority Policy) proposed in  and improves the performance. Since Bluetooth employs a master-driven TDD based scheduling algorithm, which is basically operated with the Round Robin policy, many slots may be wasted by POLL or NULL packets when there is no data waiting for transmission in queues. To overcome this link wastage problem, several algorithms have been proposed. Among them, queue state-based priority policy and low power mode-based algorithm can perform with high throughput and reasonable fairness. However, their performances may depend on traffic characteristics, i.e., static or dynamic, and they require additional computational and signaling overheads. In order to tackle such problems, we propose a new scheduling algorithm. Performance of our proposed algorithm is evaluated with respect to throughput and delay. Simulation results show that overall performances can be improved by selecting suitable parameters of our algorithm.
Performance Analysis of a New Adaptive PTS Scheme for Reducing the PAPR and High Speed Processing in OFDM Systems
The Journal of Korean Institute of Communications and Information Sciences, volume 28, issue 9A, 2003, Pages 710~716
OFDM is a very attractive technique for achieving high-bit-rate data transmission and high spectrum efficiency. However one of disadvantages of OFDM signal is the high PAPR characteristic when multicarriers are added up coherently. In this paper, we propose an adaptive PTS scheme using two threshold levels for PAPR reduction and reducing the amount of PAPR calculations with clipping scheme. Simulation results show that it is almost same between average bit error rate performance of the proposed scheme and that of a conventional scheme. Also, we obtain a great performance gain in the amount of calculations compared to the conventional scheme. Therefore, proposed system has a good performance in data processing time in OFDM wireless communication systems.
Random Channel Allocation Scheme Based on Split Algorithm in HIPERLAN 2
The Journal of Korean Institute of Communications and Information Sciences, volume 28, issue 9A, 2003, Pages 717~727
The HIPERLAN/2(HIgh PERformance Local Area Network Type2) is one of the wireless LAN standards for providing raw data rates of up to 54 Mbps. The MAC protocol of HIPERLAN/2 is based on TDMA/TDD, and resources in one MAC frame can be allocated dynamically by Access Point(AP). The random channel(RCH) is defined for the purpose of giving a mobile terminal the opportunity to request transmission resources in the uplink MAC frames. It is desirable that the number of RCHs is dynamically adapted by the AP depending on the current traffic situation. Allocation of excessive RCHs may waste radio resources and insufficient RCHs compared to traffic loads may result in many collisions in access attempts. We propose an RCH allocation scheme based on split algorithm in HIPERLAN/2. The simulation and analytic results show that the proposed scheme achieves a higher channel throughput, lower access delay and delay jitter than previously proposed RCH allocation schemes.
A Study on the Mobile IP Routing Optimization through the MRT Agent
The Journal of Korean Institute of Communications and Information Sciences, volume 28, issue 9A, 2003, Pages 728~735
It is a mainly issue that provide mobility smoothly in Mobile IP networks. The IP mobility support being standardized in the IETF utilized tunneling of IP packets from a home agent to foreign agent and utilized reverse tunneling of IP packets from foreign agent to home agent. In this paper, We propose that solve the triangular routing problem in IP mobility and that lessen the messages about IETF routing optimization. Through the Mobile Routing Table on the edge router, agent process the message instead of a end node when handoff occur and that lessen the routing path length by sending directly from FA to to Correspond Node's router. This action lessen the message occurrence frequency and the packet drop. We compare the standard IP, Routing Optimization of Mobile IP, Wu's method and the proposed algorithm. Finally, the simulation results are presented.
Resource Allocation schemes for the asymmetric multimedia services
The Journal of Korean Institute of Communications and Information Sciences, volume 28, issue 9A, 2003, Pages 736~745
Resource allocation methods are proposed to address the problem of how flexibly allocate limited wireless resource to high bandwidth demanded realtime class with certain QoS guarantees in CDMA/TDD systems. In this method, A reserved access scheme is used for allocating the resource to realtime and non-realtime class respectively. We also propose a slot allocation algorithm for the CDMA/TDD system, which can prevent the performance degradation due to the interlink interference in each cell. Our framework is able to guarantee QoS continuity of realtime class and carry the maximum number of non-realtime subscriber. System performance of proposed method is evaluated by considering transmission delay, channel utilization and data loss, assuming a practical multi-cell environment and a multimedia service model. Our simulation results demonstrate the significant performance improvement.
A study of algorithm for non-streaming synchronized data processing
The Journal of Korean Institute of Communications and Information Sciences, volume 28, issue 9A, 2003, Pages 746~753
In this paper, we propose an efficient algorithm for non-streaming synchronized data processing based on ATSC-DASE in terrestrial digital data broadcasting services. Non-streaming synchronized data is encapsulated in DSM-CC sections with PTS(presentation time stamp) values associated with A/V and it is transmitted in a form of MPEG-2 TS(transport stream). At the receiver, the transmitted A/V data are processed by PC based set-top box(STB) in real-time, and the transmitted non-streaming synchronized data is also stored at the STB and is displayed at right time by the proposed algorithm. To verity the proper operation of the proposed algorithm, we make a scenario for non-streaming synchronized data by XML, and finally we are able to display it properly by using declarative application(DA) browser.
The Analysis of Light Coupling and Propagation for The Composite Fiber-Dielectric Slab with a Conductor Cladding Using The Three Dimensional Finite Difference-Beam Propagating Method
The Journal of Korean Institute of Communications and Information Sciences, volume 28, issue 9A, 2003, Pages 754~762
The coupled and propagated property of the composite side-polished fiber and infinite planar waveguide with conductor cladding (PWGCC) is presented by using the 3-D finite difference beam propagating method (FD-BPM) in according to the variety of refractive indexes between the fiber and the infinite planar waveguide. It is also introduced for the technique to be applied at and consisted of the analysis domain of 3-D FD-BPM for the coupling between the side-polished fiber and PWG. It is also compared the properties of coupling between the side-polished fiber and PWGCC with them of the general symmetric and asymmetric PWG without perfect conductor (PEC), which has been investigated by many researcher.
Research on Conditional Execution Out-of-order Instruction Issue Microprocessor Using Register Renaming Method
The Journal of Korean Institute of Communications and Information Sciences, volume 28, issue 9A, 2003, Pages 763~773
In this paper, we present a register renaming method for conditional execution out-of-order instruction issue microprocessors. Register renaming method reduces false data dependencies (write after read(WAR) and write after write(WAW)). To implement a conditional execution out-of-order instruction issue microprocessor using register renaming, we use a register file which includes both in-order state physical registers and look-ahead state physical registers to share all logical registers. And we design an in-order state indicator, a renaming state indicator, a physical register assigning indicator, a condition prediction buffer and a reorder buffer. As we utilize the above hardwares, we can do register renaming and trace the in-order state. In this paper, we present an improved register renaming method using smaller hardware resources than conventional register renaming method. And this method eliminates an associative lookup and provides a short recovery time.