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 :
Kwang Soon Kim
Volume & Issues
Volume 29, Issue 12C - Dec 2004
Volume 29, Issue 12B - Dec 2004
Volume 29, Issue 12A - Dec 2004
Volume 29, Issue 11C - Nov 2004
Volume 29, Issue 11B - Nov 2004
Volume 29, Issue 11A - Nov 2004
Volume 29, Issue 10C - Oct 2004
Volume 29, Issue 10B - Oct 2004
Volume 29, Issue 10A - Oct 2004
Volume 29, Issue 9C - Sep 2004
Volume 29, Issue 9B - Sep 2004
Volume 29, Issue 9A - Sep 2004
Volume 29, Issue 8C - Aug 2004
Volume 29, Issue 8B - Aug 2004
Volume 29, Issue 8A - Aug 2004
Volume 29, Issue 7C - Jul 2004
Volume 29, Issue 7B - Jul 2004
Volume 29, Issue 7A - Jul 2004
Volume 29, Issue 6C - Jun 2004
Volume 29, Issue 6B - Jun 2004
Volume 29, Issue 6A - Jun 2004
Volume 29, Issue 5C - May 2004
Volume 29, Issue 5B - May 2004
Volume 29, Issue 5A - May 2004
Volume 29, Issue 4C - Apr 2004
Volume 29, Issue 4B - Apr 2004
Volume 29, Issue 4A - Apr 2004
Volume 29, Issue 3C - Mar 2004
Volume 29, Issue 3B - Mar 2004
Volume 29, Issue 3A - Mar 2004
Volume 29, Issue 2C - Feb 2004
Volume 29, Issue 2B - Feb 2004
Volume 29, Issue 2A - Feb 2004
Volume 29, Issue 1C - Jan 2004
Volume 29, Issue 1B - Jan 2004
Volume 29, Issue 1A - Jan 2004
Selecting the target year
Hierarchical-based Dynamic Bandwidth Allocation Algorithm for Multi-class Services in Ethernet PON
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 223~232
In this paper we propose the hierarchical-based dynamic bandwidth allocation algorithm for multi-class services in Ethernet-PON. The proposed algorithm consists of the high level scheduler in OLT and the low level scheduler in ONU. The hierarchical architecture is able to provide scalability and resource efficiency in Ethernet-PON which has the distributed nature of the scheduling domain, with queues and the scheduler located at a large distance from each other. We also propose three dynamic bandwidth allocation algorithms for the low level scheduler: Proportional Allocation algorithm, Maximum Request First Allocation (MRFA) algorithm and High Priority First Allocation (HPFA) algorithm. We implement the Ethernet-PON standardized in the IEEE 802,3ah using OPNET. We also evaluate and analyze the performance for the proposed algorithms in terms of channel utilization, queuing delay and the amount of remainder.
A Vector Channel Characteristics in the Dense Urban Area
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 233~239
The capacity and the performance of the spatial filtering system depends on the spatial properties of wireless vector channel. In this paper, we have analyzed the wireless vector channel characteristics in the dense urban area using the data collected from the real environments. After analyzing the measurement data, it has been found out that the signals were received mainly from only a few directions (such as roads or commercial buildings) even if mobile users are randomly distributed in a cell. Moreover, the DOA(Direction-of-Arrival) of a received signal may not change continuously while a mobile is moving, it may jump from one direction to the other direction with fading.
Performance Evaluation for Linear Space-time Coded MIMO-OFDM System considering Diversity-Spatial Multiplexing
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 240~247
In order to transmit data at high speed in the wireless environment, OFDM is selected as the transmission method of various high-speed wireless communication system since it has the advantage to deal easily the serious selective frequency fading channel by the multiple path. We evaluate STBC-OFDM and linear STBC-OFDM combining with a class of recently proposed linear scalable space-time block codes and OFDM in MIMO channel environments, and demonstrate the performance for spatial multiplexing and diversity gain. The codes are able to use jointly transmit diversity in combination with spatial multiplexing, and achieve spatial and temporal diversity. Frequency diversity of frequency selective channels can be utilized by combining the linear STBC and OFDM. Simulation results are shown to demonstrate the better performance of proposed approach in comparison with STBC-OFDM.
Multi-Sequence Signaling Based Asynchronous Trellis-Coded DS/CDMA System
Sangho Choe ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 248~256
Woerner had suggested an asynchronous trellis-coded DS/CDMA system based on a multi-sequence signaling, biorthogonal sequence, which is superior to single sequence signaling, such as M-ary PSK, due to their better cross-correlation properties. This paper analyzes and compares system performance between OPSM, a recently-presented multi-sequence signaling scheme, and biorthogonal sequence signaling. Interuser interference moments of the two schemes are derived and compared which verifies that OPSM, having smaller signature sequences per symbol than biorthogonal signaling, reduces cross-correlation. Numerical results compare the power and spectral efficiency of asynchronous trellis-coded DS/CDMA systems based on multi-sequence signaling.
Performance Analysis of Arbitrary Rectangular QAM over Nakagami Fading Channels with MRC in the Presence of Co-channel Interference
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 257~265
General closed-form expression is derived and analyzed for the exact bit error rate (BER) performance of the arbitrary rectangular Gray coded QAM signal in conjunction with maximal-ratio combining (MRC) diversity on frequency non-selective slow m-distributed Nakagami fading channel in the presence of co-channel interference. Numerical results demonstrate error performance improvement with the use of MRC diversity reception. The new expressions presented here are suitable for evaluating various cases of practical interest on wireless communication channels.
Efficient Soft Handover method for Bluetooth
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 266~275
Recently, wireless networks require an efficient handover scheme due to increase of mobile devices. But Bluetooth has several problems to support the efficient handover, which are the additional increase of signaling traffic and long time of the initial setup processes of inquiry and paging processes. This paper suggests an efficient Soft Handover method for Bluetooth (eSoHoB), which reduces the eplased time of the inquiry and paging process and supports a soft handover using the anticipation method. This paper implements the eSoHoB using two Bluetooth hardware modules and a testbed to be able to receive streaming data while a Bluetooth terminal is moving. This paper measures handover delays and the operation of the soft handover to verify the proposed mhthod.
A re-route method for reliable data transport in Ad Hoc Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 276~287
An ad hoc network is infra(Base Sstation or Access Point) free wireless mobile communication technology. Mobile nodes function as routers and servers in ad hoc networks. Many routing protocols for ad hoc network have been proposed. If any route is broken owing to moving node, source must repair broken route again. But route repair technology after route collapses is not suitable to transmit real-time data packet for QoS guarantee. So this paper presents route repair technology that prevents route from breaking. If intermediate node moves to critical section, the node issues handoff packet and sends the packet to the next node. After next node receives handoff packet, the node broadcasts route request packet to the previous node for intermediate node. Finally, even if intermediate node moves out of the routing region, the source can continuously transmit data packets to the destination through the new path.
Data throughput measurement for Wireless LAN of IEEE 802.11g in mobile environment
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 288~292
Recently the application area of wireless LAN has been increased, rapidly. The application area was limited in indoor, but as the data throughput and performance of wireless LAN becomes better the application is to extend to the Internet connection and wireless bridge in outdoor. In this paper, the data throughput of wireless LAN in mobile environment is measured, and the usability of wireless LAN for ITS, Telematics, and LBS is confirmed.
Grouping of Wireless Terminals for High-Rate Transmission in Wireless LANs
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 293~302
Wireless LAN is a rather mature communication technology that connects mobile terminals. A typical wireless LAN system is composed of one AP and more than one terminals, which is called a BSS. Terminals near to an AP can receive high rate data but terminals far from an AP may not receive data with guaranteed high speed rate because received signal strength is weakened. This paper proposes a method to allow high speed data transmission by grouping terminals and using part of wireless terminals as repeaters. We compare and analyze proposed grouping algorithms based on Depth First Search and Breadth First Search via simulations. A grouping algorithm based on Breadth First Search is shown to be more effective in term of efficiency and coverage.
Design and Fabrication of four L-slotted Microstrip Antenna for 5.25GHz Band Wireless LAN
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 303~310
In this paper, L-shaped slot antenna for 5.15㎓-5.35㎓ is designed, fabricated. and measured. The prototype consist of four L-shaped slot. To obtain suitable bandwidth, the form layer is inserted between ground plane and substrate. Important parameters in the design are four L-slot length. width, position, air-gap height. and feed Point position. From these parameters optimized, a four L-shaped slot antenna is fabricated and measured. The measured results of the antenna are obtained as follows results. The resonant frequency of the fabrication four L-shaped slot antenna is 5.25㎓, bandwidth for approximately 5％(VSWR＜1.5) and the gain is 8-9㏈i. The experimental far-field patterns are stable across the pass band. The 3dB bandwidth in H-Plane and I-Plane are 69
A Study on the Reflection Type Analog Phase Shifter using Varactor and Branch Coupler
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 311~317
A low loss reflection type analog phase shifter which is realized with two varactors and branch coupler. is described. A new design technique for the large phase shift is applied using short stub microstripe lines. This paper presented the realization of design and experimental results. Through the experiment using the duroid microstrip line and varactors, the phase of 2.26GHz signal is controlled to the DC voltage with the phase shift range of 170
. The achieved insertion loss of less than 3㏈ and the return loss of mote than 12㏈ are achieved over all phase states.
Reducing Power Consumption of a Scheduling for Reuse Module Selection under the Time Constraint
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 318~323
In this paper, we present a reducing power consumption of a scheduling for reuse module selection under the time constraint. Traditional high-level synthesis do not allow reuse of complex, realistic datapath component during the task of scheduling. On the other hand, the proposed scheduling of reducing power consumption is able to approach a productivity of the design the low power to reuse which given a library of user-defined datapath component and to share of resource sharing on the switching activity in a shared resource. Also, we are obtainable the optimal the scheduling result in experimental results of our approach various HLS benchmark environment using chaining and multi-cycling in the scheduling techniques.
A Study on Design of a Low Complexity TCM Decoder Combined with Space-Time Block Codes
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 324~330
In this paper, we propose the TCM(Trellis coded modulation) decoding scheme that reduces the number of operations in branch metric with STBC(space time block codes) channel information and present the implementation results. The proposed TCM decoding scheme needs only 1 signal point in each TCM subset. Using bias point scheme, It detects the minimum distance symbol. The proposed TCM decoding scheme can reduce the branch metric calculations. In case of 16QAM 8 subset, the reduction ratio is about 50％ and for 64QAM 8 subset, about 80％ reduction can be obtained. The results of logic synthesis for the TCM and STBC decoder with the proposed scheme are 57.6K gate count.
Low System Complexity Parallel Multiplier for a Class of Finite Fields based on AOP
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 331~336
This study focuses on the hardware implementation of fast and low-system-complexity multiplier over GF(2
). From the properties of an irreducible AOP of degree m. the modular reduction in GF(2
) multiplicative operation can be simplified using cyclic shift operation. And then, GF(2
) multiplicative operation can be established using the away structure of AND and XOR gates. The proposed multiplier is composed of m(m+1) 2-input AND gates and (m+1)
2-input XOR gates. And the minimum critical path delay is Τ
proposed multiplier obtained have low circuit complexity and delay time, and the interconnections of the circuit are regular, well-suited for VLSI realization.n.
Design of an Area-Efficient Survivor Path Unit for Viterbi Decoder Supporting Punctured Codes
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 337~346
Punctured convolutional codes increase transmission efficiency without increasing hardware complexity. However, Viterbi decoder supporting punctured codes requires long decoding length and large survivor memory to achieve sifficiently low bit error rate (BER), when compared to the Viterbi decoder for a rate 1/2 convolutional code. This Paper presents novel architecture adopting a pipelined trace-forward unit reducing survivor memory requirements in the Viterbi decoder. The proposed survivor path architecture reduces the memory requirements by removing the initial decoding delay needed to perform trace-back operation and by accelerating the trace-forward process to identify the survivor path in the Viterbi decoder. Experimental results show that the area of survivor path unit has been reduced by 16％ compared to that of conventional hybrid survivor path unit
An Optimal SMT Processor Architecture for IPv4 Packet Routing
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 3A, 2004, Pages 347~357
Network systems have been developed to meet the high performance of forwarding packets and flexibility for providing various services, so network processor emerged. In order to improve the performance of network processors, fast external interface and special functional units have been used. Recently as an architectural method of improving performance, the SMT(Simultaneous Multi Threading) architecture is proposed, but this architecture is difficult to implement due to its complexity. Therefore research for architectural optimization is needed to develop the SMT network processors. In this paper we analyze each functional units on performing network algorithms and propose an optimized SMT network Processor architecture.