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 25, Issue 12B - Dec 2000
Volume 25, Issue 12A - Dec 2000
Volume 25, Issue 11B - Nov 2000
Volume 25, Issue 11A - Nov 2000
Volume 25, Issue 10B - Oct 2000
Volume 25, Issue 10A - Oct 2000
Volume 25, Issue 9B - Sep 2000
Volume 25, Issue 9A - Sep 2000
Volume 25, Issue 8B - Aug 2000
Volume 25, Issue 8A - Aug 2000
Volume 25, Issue 7B - Jul 2000
Volume 25, Issue 7A - Jul 2000
Volume 25, Issue 6B - Jun 2000
Volume 25, Issue 6A - Jun 2000
Volume 25, Issue 5B - May 2000
Volume 25, Issue 5A - May 2000
Volume 25, Issue 4B - Apr 2000
Volume 25, Issue 4A - Apr 2000
Volume 25, Issue 3B - Mar 2000
Volume 25, Issue 3A - Mar 2000
Volume 25, Issue 1B - Jan 2000
Volume 25, Issue 1A - Jan 2000
Volume 25, Issue 9 - 00 2000
Volume 25, Issue 8 - 00 2000
Volume 25, Issue 7 - 00 2000
Volume 25, Issue 5 - 00 2000
Volume 25, Issue 4 - 00 2000
Volume 25, Issue 2B - 00 2000
Volume 25, Issue 2A - 00 2000
Volume 25, Issue 1 - 00 2000
Volume 25, Issue 12 - 00 2000
Volume 25, Issue 10 - 00 2000
Selecting the target year
Performance Improvement of A Hybrid TDMA/CDMA Systems with Multi-channel Linear Equalizer
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1273~1281
In this paper we studied for multi-user detection system, which hold the merit of CDMA system and can enhance the system capacity. We designed actually realizable quasi-optimal multiuser detection system by use of linear equalizer on the concept that multiuser detection algorithm can be reduced by combining TDMA with CDMA. we call this the hybrid TDMA/CDMA system. And we proposed multiuser detection system, which can use PSAD and MSDD channel estimation method. As a result of performance analysis we acquired equal or much better performance by use of linear multichannel equalizer in the case of not so many user. And on the occasion of many user within cell we can also acquired much better performance in comparison with conventional single user detection system by use of hybrid TDMA/CDMA system.
A Study on the Channel Assignment Scheme on Enhancing New Call Service in Wireless Network
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1282~1289
In this paper we propose a Fractional Channel Reservation (FCS) scheme to satisfy a desired handoof dropping probability and to reduce the blocking probability of new calls using mobility characteristics and incoming handoff rate in mobile communication networks. When the ratio of the handoff call arrival rate is less then the ratio of the new call arrival rete, the proposed scheme is capable of determining the number of the guard channels which can guarantee the Quality of Service(QoS) in terms of the request handoff dropping probability and allocating dynamically the wireless channels the new calls according to the rest of the guard channels to reduce the new call blocking probability. Also we perform mathematical analysis and simulation to evaluate the performance of proposed scheme and compare to conventional guard channel scheme in terms of dropping probability blocking probability and the utilization efficiency of wireless channels.
Performance Analysis of MAP Algorithm by Robust Equalization Techniques in Nongaussian Noise Channel
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1290~1298
Turbo Code decoder is an iterate decoding technology, which extracts extrinsic information from the bit to be decoded by calculating both forward and backward metrics, and uses the information to the next decoding step Turbo Code shows excellent performance, approaching Shannon Limit at the view of BER, when the size of Interleaver is big and iterate decoding is run enough. But it has the problems which are increased complexity and delay and difficulty of real-time processing due to Interleaver and iterate decoding. In this paper, it is analyzed that MAP(maximum a posteriori) algorithm which is used as one of Turbo Code decoding, and the factor which determines its performance. MAP algorithm proceeds iterate decoding by determining soft decision value through the environment and transition probability between all adjacent bits and received symbols. Therefore, to improve the performance of MAP algorithm, the trust between adjacent received symbols must be ensured. However, MAP algorithm itself, can not do any action for ensuring so the conclusion is that it is needed more algorithm, so to decrease iterate decoding. Consequently, MAP algorithm and Turbo Code performance are analyzed in the nongaussian channel applying Robust equalization technique in order to input more trusted information into MAP algorithm for the received symbols.
The Prediction Modelling of Traffic Flow with Time-Variable Non-Linear Characteristic in ATM Network
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1299~1305
In B-ISDN, to realize ATM, the optimum control method of multi-media traffic must be proposed. Because there is not the traffic model of multi-media to make clear, the realization of optimum ATM congestion control is very difficult. In this paper, the traffic model is assumed to be slowly time-variable non-linear function and for real-time prediction of it, new model which is composed with parallel triple neural networks is proposed. And the simulation to predict assumed ATM traffic is executed. From the result, it's capability is shown that the proposed neural network model can be used in ATM congestion control.
The Quality Loss of a X-Band Transmitter on the LEO Satellite
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1306~1312
The quality loss of a X-band transmitter has been derived by means of MC simulation. The transmitter as a payload of LEO(Low Earth Orbit) satellite is capable of the down transmission the image data of hundreds Mbps generated from the Electro-Optical Instrument in real time. The parameters such as data asymmetry amplitude unbalance,phase unbalance, wave shaping and channel interference are included in the quality loss simulation Assuming that normally distributed gaussian noise is simply added to the channel, the quality loss of 0.7 dB has been obtained through this simulation based on a 95% confidence interval. The obtained quality loss can be applied to the link budgets as an additional loss item.
Performance Analysis of Turbo Codes for LEO Satellite Communication Channel
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1313~1321
In recent years LEO(Low Earth Orbit) satellite communication systems have gained a lot of interest as high speed multimedia services by satellite are about to be provided. It is mandatory to use very efficient ECC(Error Correcting Code) to support high speed multimedia services over LEO satellite channel. Turbo codes developed by Berrou et al. in 1993 have been actively researched since it can achieve a performance close to the Shannon limit. In this paper, a LEO satellite channel model is adopted and the fading characteristics of LEO satellite channel are analyzed for the change of elevation angle in various propagation environments. The performance of turbo code is analyzed and compared to that of conventional convolutional code using the satellite channel model. In the simulation results using the Globalstar orbit constellations, performance of turbo codes shows 1.0~2.0dB coding gain compared to that of convolutional codes over all elevation angle and propagation environment ranges we have investigated. The performance difference resulting from the change of elevation angle in various propagation environments and the performance of different ECC are analyzed in detail, so that the results can be applied to choose an appropriate ECC scheme for various system environment.
Performance analysis of noncoherent satellite DS-CDMA system with orthogonal signals
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1322~1331
In this paper, we compare the performance of noncoherent DS-CDMA system where orthogonal code is used for identifying the user to reduce multiple access interference or for M-ary orthogonal signaling to improve the performance of demodulation. The effects of M-ary orthogonal signaling on the noncoherent demodulation is investigated and compared with one of coherent demodulation. The analysis results show that M-ary orthogonal signaling gives better performance than quasi-synchronous orthogonal scheme for a moderate number of users when the processing gain is 128 over AWGN channel. In addition, when the number of user is 41, M=64 orthogonal signaling has a similar performance to the quasi-synchronous orthogonal scheme at the BER of 10-2 when the time misalignment between channels is within 1/2 chip and M=256 orthogonal signaling always outperforms the quasi-synchronous orthogonal scheme. Start after striking space key 2 times.
Design of a High Speed Asymmetric Baseband MODEM ASIC Chip for CATV Network
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1332~1339
This paper presents the architecture and design of a high speed asymmetric data transmission baseband MODEM ASIC chip for CATV networks. The implemented MODEM chip supports the physical layer of the DOCSIS(Data Over Cable Service Interface Specification) standard in MCNS(Multimedia Cable Network System) The chip consists of a QPSK/16-QAM transmitter and a 64/256-QAM receiver which contain a symbol timing recovery circuit, a carrier recovery circuit, a blind equalizer using MMA and LMS algorithms. The chip can support data rates of 64Mbps at 256 QAM and 48Mbps at 64-QAM and can provide symbol rates up to 8MBaud. This symbol rate is faster than existing QAM receivers. We have performed logic synthesis using the
standard cell library. The total number of gates is about 290,000 and the implemented chip is being fabricated and will be delivered soon.
Realtime/Non-realtime Multimedia Traffic Transmission in cdma 2000
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1340~1347
The international mobile telecommunication-2000(IMT-2000) system can support not only the non-realtime multimedia traffic such as data such as data image but also the realtime multimedia traffic such as voice, video. In the paper we propose multicode allocation and handoff schemes for efficient transmission of realtime and non-realtime data in cdma2000. In those schemes the bandwidth of target cell is reserved based on moving direction of mobiles to support QoS of realtime multimedia data and the reserved bandwidths is used by the non-realtime mobiles of the target cell until the mobiles want to perform hadoff. Our framework is able to guarantee QoS continuity of realtime multimedia data and carries the maximum number of subscriber. System performance is evaluated and compared with conventional scheme considering transmission delay channel utilization and blocking probability by computer simulation.
Traffic analysis of the CDMA base station with repeaters using time delay devices
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1348~1358
The paper contributes to a traffic analysis for the CDMA cellular base station with repeater which are operated in a cell site. Usually the repeaters' traffic of the CDMA cellular system hardly could be separated from that of the base station because the links of the repeaters are divided from RF circuits of the base station. The paper introduces a traffic measuring method that separates the traffic of repeaters from that of the base station using time delay device. To get general results we use a single BTS(Base station Transceiver Subsystem) with three repeater as well as a single BTS with a single repeater. Then we proved that the traffic of the repeaters could separate from that of the base station clearly.
A New CDMA Uplink Channel Structure and DBCE Detection Scheme Using Staggered Burst Pilot
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1359~1367
A new coherent detection scheme with data based channel estimation (DBCE) for CDMA/BP(staggered burst pilot in parallel) channel structure is proposed. Because the pilot burst initiates DBCE operation periodically it is shown to be remarkably stable to Gaussian noise and Doppler shift with proper parameter settings. In our own system parameter setting, there is a negligible loss(0.068 dB) in
by the introduction of the burst pilot. When compared with an ideal coherent detection, the required
on Doppler shift corresponding to the speed of 160Km/H is degraded less that 2.0 dB. the burst pilot can be implemented without complexity even though some extra correlators are needed for DBCE. This improvement is superior to the previously coherent CDMA detectors with external or internal pilot.
Codesign of IS-95 based CDMA Searcher
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1368~1376
This paper describes the codesign method for IS-95 based CDMA(Code Division Multiple Access). By codesign we mean to design hardware and software simultaneously. Codesign lead to reduction in design time, cost and power consumption. When we partition a system into hardware and software, some modules with longer processing time and larger power consumption are implemented using hardware and the remaining part is implemented using software. In proposed design, we design the synchronous accumulator of CDMA searcher in hardware and the other part in software, The hardware part is designed using VHDL, while software part is designed using GC(Generic C). We simulated and verified the system using COSSAP in SYNOPSYSTM. Experimentation showed the maximum 48.5% speed reduction compared with the design using software only.
Analysis of ISUP signalling Delay in Common Channel Signaling System
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1377~1386
As all delays resulting from the signaling network directly affect the response time of network management activity, all control informations have to be transported most efficiently. It is very important to know the performance of the signaling system not only because of smooth network operation but also because of efficient engineering of signaling networks. In this paper, we analyzed mean queueing delay of signaling link for ISUP signaling messages in common channel signaling system by using M[X]/G/1 and M[X]/D/1 batch arrival queueing system. This is because we modeled arrival process of the signaling messages as batch arrival process considering that many kinds of signaling messages are generated at short intervals when a call requests a connection. Analysis was carried out considering different call processing scenario based on ITU-T specification. We also described the numerical results from the different types of queueing models.
The Design Of Improved Information Security System based on SSL(Secure Socket Layer) For Providing Secure Communication Services
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1387~1394
The SSL(Secure Socket Layer) protocol is one of the mechanism widely used in the recent network system. The improved information security mechanism based on the SSL is designed in this paper. There are important four information security services. The first is the authentication service using the Certificate offered from the SSL(Secure Socket Layer), the second is the message confidentiality service using the DES encryption algorithm, the third is the message integrity service using Hash function, and the fourth is Non-repudiation service. Therefore, information could be transferred securely under the information security mechanism including Non-repudiation service especially designed in this paper.
An Adaptive Distributed Wavelength Routing Algorithm in WDM Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1395~1404
In this paper, we propose a heuristic wavelength routing algorithm for IP datagrams in WDM (Wavelength-Division Multiplexing) networks which operates in a distributed manner, while most previous works have focused centralized algorithms. We first present an efficient construction method for a loose virtual topology with a connectivity property, which reserves a few wavelength to cope with dynamic traffic demands properly. This connectivity property assures that data from any source node could reach any destination node by hopping one or multiple lightpaths. We then develop a high-speed distributed wavelength routing algorithm adaptive to dynamic traffic demands by using such a loose virtual topology and derive the general bounds on average utilization in the distributed wavelength routing algorithms. Finally, we show that the performance of the proposed algorithms is better than that of the FSP(Fixed Shortest-Path) wavelength routing algorithms through simulation using the NSFNET and a dynamic hot-spot traffic model, and that the algorithms is a good candidate in distributed WDM networks in terms of the blocking performance, the control traffic overhead, and the computation complexity.
Distributed Wavelength Assignment Algorithm in WDM Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1405~1412
In this paper, we propose an efficient dynamic wavelength assignment algorithm in distributed WDM (Wavelength-Division Multiplexing) networks without wavelength conversion. The algorithm tries to assign a locally-most-used wavelength distributedly on a fixed routing path. We first formulate our algorithm by using the concept of a sample space which consists of optical fibers connected to nodes on a routing path of a lightpath to be assigned a wavelength. In particular, we analyze the blocking performance mathematically as compared with that of the most-used (MU) wavelength assignment algorithm previously proposed for WDM networks under centralized control. We also obtain numerical results by simulation on the blocking performance of other centralized/distributed wavelength assignment algorithms as well as our algorithm using the M/M/c/c dynamic traffic model. Consequently, we show that analytical results match simulation results and that our algorithm is efficient in distributed WDM networks in terms of blocking performance, control traffic overhead and computation complexity.
A Study on Efficient Transmission Rate Control of ABR Traffic in ATM
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1413~1421
In this paper, we analyze previous flow control algorithm for serving ABR traffic, and then propose the algorithm which calculate fair transmission rate and control efficiently ABR traffic using VS/VD switch which has an effect on WAN environment with long delay. For getting the transmission rate, the proposed algorithm use FMMAR as ER scheme which calculate exactly the fair share. And, in large delay state. we can obtain fair cell sharing by calculating transmission rates which obtained by transmitted queue length information of VD to VS for serve and drain cell in queue Through the computer simulation, we evaluate the performance of proposed algorithm. According to the results, the proposed algorithm shows good performance.
Analysis of S-CDMA Technique for Cable Modem Upstream Channel
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1422~1430
S(Synchronous)-CDMA is a new cable modem technology applicable to the upstream channel for high speed multimedia communication using CATV networks. In this paper we analyze the transmitting and receiving process of S-CDMA scheme based on Terayon patent and derive bit error probability of S-CDMA and TDMA scheme in the
-mixture impulse noise model which appropriately reflects impulse noise characteristics of upstream channel by using various parameters. This analysis results are a good match with the simulation results. We also compare Eb/No gain performance of S-CDMA with TDMA in 16, 32, 64, QAM.
Cell-interleavd VC merging scheme for multipoint-to-multipoint communication in ATM network
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1431~1440
In order to support efficiently the multimedia applications, such as virtual classroom, video conferencing and tele-medical, the efficient multipoint-to-multipoint(MP-to-MP) connection management function is essential. Shared tree is reported as the most useful method for this purpose. In this paper we propose a new MP-to-MP connection setup & management scheme, called CIMA(Cell Interleaved Multiplexing on ATM) scheme,which is a VC merging method for MP-to-MP communication using shared tree. In the CIMA scheme,MRM cell delivers the cell merging information to the next node. The receiving node can identfy cells which arrived through a channel using the same VPI/VCI by the merging information in the MRM cell. Therefore the CIMA scheme can solve easily the Cell Interleaving Problem(CIP) that happens in VC merging. We analyzed the overhead of the proposed CIMA by mathematical analysis,and simulated the buffer usage of CIMA with OPNET. As the result of analysis,we found that the CIMA scheme has acceptable merging overhead and doesn't cause the buffer scare problem.
Automatic Protection Switching Schemesfor Network Survivability in ATM-PON Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1441~1451
There are two types of protection switching : a) automatic switching and b) forced switching. The switching mechanism is generally realised by OAM functions, therefore, the required OAM information field should be reserved in the PLOAM cells. This paper proposes an unidirectional and a bidirectional protection switching method and potential advantages. The unidirectional protection switching method can be faster than the bidirectional method because the unidirectional method does not require an APS protocol for protection switching. The bidirectional protection switching method uses APS K1 byte and K2 byte, which is included in octets of a PST message through downstream or upstream PLOAM cells, for protection switching. As making comparisons between the unidirectional and the bidirectional protection. switching method, this paper proposes an effective constructing method for ATM-PON network.
unifying solution method for logical topology design on wavelength routed optical networks
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 9A, 2000, Pages 1452~1460
A series of papers in recent literature on logical topology design for wavelength routed optical networks have proposed mathematical models and solution methods unifying logical topology design wavelength assignment and traffic routing. The most recent one is by Krishnaswamy and Sivarajan which is more unifying and complete than the previous models. Especially the mathematical formulation is an integer linear program and hence regarded in readiness for an efficient solution method compared to the previous nonlinear programming models. The solution method in  is however elementary one relying on the rounding of linear program relaxation. When the rounding happens to be successful it tends to produce near-optimal solutions. In general there is no such guarantee so that the obtained solution may not satisfy the essential constraints such as logical -path hop-count and even wavelength number constraints. Also the computational efforts for linear program relaxation seems to be too excessive. In this paper we propose an improved and unifying solution method based on the same to be too excessive. In this paper we propose an improved and unifying solution method based on the same model. First its computation is considerably smaller. Second it guarantees the solution satisfies all the constraints. Finally applied the same instances the quality of solution is fairly competitive to the previous near optimal solution.