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 :
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
Detection of Subcarrier-Multiplexed Optical Label Using Optical interleave
Shin Jong Dug ; Lee Moon Hwan ; Kim Boo Gyoun ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1279~1284
In this paper, we propose a novel and simple optical technique for the detection of subcarrier-multiplexed(SCM) labels using optical interleavers. Optical-baseband packet signals with suppressed subcarriers appear at the through-pass port of the optical interleaver and SCM labels with suppressed optical carrier exit from the optical SCM extraction port. Since it does not require optical circulators, this structure shows less insertion loss than the previously proposed optical label detectors. The periodic nature of the interleaver transfer function makes it possible to detect multiple SCM channels simultaneously from an incoming wavelength-multiplexed signal stream. Detection of a 155-Mb/s ASK modulated 9.79-GHz subcarrier using a 10-GHz SCM optical label detector has been performed successfully and verified through optical spectra and bi t-error-rate measurements
New Contention Resolution algorithm for Optical Burst Switch
Jeong Myoung Soon ; Eom Jin seob ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1285~1290
In this paper, a new algorithm for contention resolution in optical burst switched network is proposed and simulated. The proposed algorithm is made from the all mixing of wavelength conversion, deflection routing, segmentation, and optical fiber delay line buffering. We analysis the performance of the proposed contention resolution algorithm by using ns-2. The application of the algorithm into Korea backbone network shows the superior performance of a low burst loss probability.
Proportional Fair Subcarrier Allocation Scheme in the Multiuser OFDM Wireless Mobile Communication Systems
Park Hyo soon ; Kim Jun soek ; Lee Jai yong ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1291~1297
In this paper, the new scheduling algorithm that supports the maximization of system throughput and the proportional fairness among non-real time traffic users is proposed in OFDMA wireless mobile communication systems. The concept of the proposed algorithm is based on the proportional fairness algorithm, which is deployed in 3GPP2, and sorting method. The proportional fairness algorithm is adapted to allocate the number of subcarrier per user. A sorting method is contributed to the maximization of system throughput in the practical allocation of subcarrier per user. Simulation results show that new algorithm had better performance than the max rate rule in case of fairness, higher throughput than the scheduling algorithm without sorting method. Even though the system throughput of the proposed algorithm is almost same with the iteration scheme using subcarrier swapping method between users, the computational time of the former is reduced up to 3 times than the latter.
A Novel Priority Call Admission Coneol Algorithm Based on Total Resource Requirements for CDMA Systems
Park Shi quan ; Park Yong wan ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1298~1308
CAC (Call Admission Control) schemes for different service class are studied in many Papers. A novel priority CAC algorithm, which gives priority to a same class call according to the total resource requirements is proposed and analyzed in this paper. The proposed algorithm provides a priority according to the total resource requirements other than only in a base station. If there are efficient residual resources in the system, it will accept all new calls. Otherwise, it will selectively accept these new calls according to the total resource requirements. The results show that the proposed algorithm provides better call blocking probability, outage probability and throughput than the conventional algorithm.
A Scheme of Supporting a Soft Handoff for IEEE 802.16e
Han Jong soo ; Park Ju hee ; Lee Joon hyuk ; Yun Chan young ; Oh Young hwan ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1309~1318
The rapid growth of the mobile Internet has enabled its application area to expand, and its users want services that require more bandwidth for multimedia services. There are limits to support the various multimedia service to mobile station provided by existing mobile communications. The wireless MAN called the IEEE 802.16 Broadband Wireless Access systems which the IEEE 802.11 wireless LAN is similar to wireline Internet service being able to supper a various contents is used and is designed to consider a handoff is studying. Especially, TG(Task Group)e of IEEE 802.16 is in progress discussion to support a handoff to higher layer using BS(Base Station) or unit of sector, to UC. Yet a scheme is not detail. This thesis proposes the network model for IEEE 802.16e to support a soft handoff between BSs to use a mobile communication network called cdma2000 Ix EV-DO network. The proposed network model supports soft handoff to add a management skill in MA of each BS for MC(Mobility Controller). The proposed network model has merits that is able to apply existing systems as it is and that is able to use a various multimedia service, when using a wireless Internet.
Performance Analysis of Multicarrier Code Selection CDMA System for PAPR Reduction in Multipath Fading Channel
Ryu Kwan Woong ; Park Yong Wan ; Hong Een Kee ; Kim Myovng Jin ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1319~1332
Multicarrier direct sequence code-division multiple access CDMA(MC DS-CDMA) is an attractive technique for achieving high data rate transmission even if the potentially large peak-to-average power ratio(PAPR) is an important factor for its application. On the other hand, code select CDMA(CS-CDMA) is an attractive technique with constant amplitude transmission of multicode signal irregardless of subchannels by introducing code selection method. In this paper we propose a new multiple access scheme based on the combination of MC DS-CDMA and CS-CDMA. Proposed scheme, which we called MC CS-CDMA, includes the sutclasses of MC DS-CDMA and CS-CDMA as special cases. The performance of this system is investigated for multipath Sequency selective fading channel and maximal ratio combining with rake receiver. In addition the PAPR of proposed system is compare with that of both MC BS-CDMA and CS-CDMA. Simulation results show that proposed system improves PAPR reduction than MC DS-CDMA at the expense of the complexity of receiver and the number of available non. Also, the numerical result shows that the proposed system is better performance than MC DS-CDMA due to the increasing processing gain and the number of time diversity gain.
Forward Viterbi Decoder applied LVQ Network
Park Ji woong ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1333~1339
In IS-95 and IMT-2000 systems using variable code rates and constraint lengths, this paper limits code rate 1/2 and constraint length 3 and states the effective reduction of PM(Path Metric) and BM(Branch Metric) memories and arithmetic comparative calculations with appling PVSL(Prototype Vector Selecting Logic) and LVQ(Learning Vector Quantization) in neural network to simplify systems and to decode forwardly. Regardless of extension of constraint length, this paper presents the new Vierbi decoder and the appied algorithm because new structure and algorithm can apply to the existing Viterbi decoder using only uncomplicated application and verifies the rationality of the proposed Viterbi decoder through VHDL simulation and compares the performance between the proposed Viterbi decoder and the existing.
PAPR-minimized Sequence Mapping with Data Space Reduction by Partial Data Side Information in OFDM System
Jin Jiyu ; Ryu Kwan Woongn ; Park Yong wan ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1340~1348
In this paper, we propose a PAPR-minimized sequence mapping scheme that achieves the minimum Peak-to-Average Power Ratio (PAPR) and the minimum amount of computations for the OFDM system. To reduce the PAPR, the mapping table is created with information about block index and symbol patterns of the lower signal power. When the input data sequence comes, it performed division by the block length to find the quotient and remainder. The symbol pattern of the lower signal power can be found in terms of the block index as the quotient in the mapping table and transmitted with remainder as the side information to distinguish and recover the original data sequence in the receiver. The two methods with the proposed mapping scheme are proposed in this paper. One is with mapping table to recover the O%M signal in both transmitter and receiver. The other is with mapping table only in transmitter to reduce the load and the complexity in the mobile system. We show that this algorithm provides the PAPR reduction, the simple processing and less computational complexity to be implemented for the multi-carrier system.
A Study on Adapted Algorithm for Local Wireless Multimedia Communication and Effective Service
Kang Jung yong ; Lee Seon keun ; Kim Hwan yong ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1349~1355
In tile wireless communication networks although the modulation and demodulation structure with proposed BOWLIS algorithm is a little confusing but we certified that it is fit structure in fast operation processing and high speed wireless LAM system that is more strong on frequence and electro magnetic interference because it process the inputted data within 2.8Us that is faster 0.4Us than 3.2Us in standard form. Also we certified that in the sigtlt of consuming power it is better than pipe-lined structure because of reducing the processing step to 4.
Performance Analysis and evaluation of the IEEE 802.11e EDCF
Kim Jong Deok ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1356~1366
Recently, the IEEE 802.11 working group has announced a new distributed MAC called EDCF to provide service differentiation among traffic classes. With the increasing demand for supporting Quality of Service in IEEE 802.11 wireless LANs, the EDCF is now attracting many researchers' attention due to its practical worth as a standard mechanism. In this paper, we focus on the analytical approach to evaluate the performance of the EDCF. An analytical model is developed to estimate the throughput of the EDCF in saturation (asymptotic) conditions. Extensive simulation studies have been carried out for the validation of the analysis, and they show that it estimates the throughput of the EDCF accurately By utilizing the analytical model, we evaluate the performance of the EDCF. Specifically, we concentrate on discovering the characteristics of the EDCF Parameters, such as CW/Sub min/, CW/Sub max/ and AIFS, in the way that they influence on the performance of the EDCF.
Adaptive EDCF for IEEE802.lie MAC Protocol
Kim Kun su ; Kim Beob jeon ; Park Jung shin ; Lee Jai yong ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1367~1374
Efforts for standardization of medium access control (MAC) protocol in IEEE802.11e have been made to support quality of service (QoS) in IEEE802.11 MAC protocol. Enhanced distributed coordination function (EDCF) of 802.11e MAC protocol is modified to support QoS for packets that have differentiated priority. However, EDCF still has e problem of throughput optimization and priority support. Therefore, we have proposed a scheme called adaptive EDCF for both supporting priority of packets and throughput optimization. We have derived the relation between the number of nodes and contention window size for throughput optimization. Based on the analytic results, we have evaluated the performance of the proposed scheme using OPNET simulations. The simulation results show that using the proposed scheme can Improve the overall throughput regardless of the number of nodes and the decrement of the throughput with increasing the number of nodes can be alleviated. Additionally, we have shown that the adaptive EDCF can support priority of packets more effectively than existing EDCF.
A New Preamble Structure for a MIMO OFDM-based WLAN System
Kim Ji hyung ; Hong Dae sik ; Kang Chang eon ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1375~1379
In this paper, we propose a new preamble structure for channel estimation in a MIMO OFDM-based WLAN System. Moreover, both the backward compatibility with IEEE 802.11a system and low overhead are considered for the preamble design. Simulation results show that the proposed preamble has low overhead and is obtained the good performance gain for channel estimation.
A study on a packet scheduler for wireless access networks
Jang Jae Shin ; Choi Jin Seek ; Kwak Dong Yong ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1380~1386
Future communication networks would consist of wired and wireless access networks where there would be various types of traffic services. To meet the QoS requirements of those various traffic services simultaneously, new QoS control schemes are required. Since they are simple to deploy, cheep to manage, and easy to support subscriber mobility, wireless access networks are considered here. In this paper, a wireless joint buffer management and scheduling (W-JoBS) scheme, which is a modified version of the original JoBS algorithm at error-prone wireless access networks, is proposed. W-JoBS scheme is for providing service fairness among traffic classes with service compensation and channel-state dependent packet scheduling schemes. With computer simulation, this proposed W-JoBS scheme is evaluated and the performance of W-JoBS is compared with that of the original JoBS.
Performance Analysis on Various Design Issues of Turbo Decoder
Park Taegeun ; Kim Kiwhan ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 12A, 2004, Pages 1387~1395
Turbo decoder inherently requires large memory and intensive hardware complexity due to iterative decoding, despite of excellent decoding efficiency. To decrease the memory space and reduce hardware complexity, various design issues have to be discussed. In this paper, various design issues on Turbo decoder are investigated and the tradeoffs between the hardware complexity and the performance are analyzed. Through the various simulations on the fixed-length analysis, we decided 5-bits for the received data, 6-bits for a priori information, and 7-bits for the quantization state metric, so the performance gets close to that of infinite precision. The MAX operation which is the main function of Log-MAP decoding algorithm is analyzed and the error correction term for MAX* operation can be efficiently implemented with very small hardware overhead. The size of the sliding window was decided as 32 to reduce the state metric memory space and to achieve an acceptable BER.