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 24, Issue 12B - Dec 1999
Volume 24, Issue 12A - Dec 1999
Volume 24, Issue 11A - Nov 1999
Volume 24, Issue 10B - Oct 1999
Volume 24, Issue 10A - Oct 1999
Volume 24, Issue 9B - Sep 1999
Volume 24, Issue 9A - Sep 1999
Volume 24, Issue 8B - Aug 1999
Volume 24, Issue 8A - Aug 1999
Volume 24, Issue 7B - Jul 1999
Volume 24, Issue 7A - Jul 1999
Volume 24, Issue 6B - Jun 1999
Volume 24, Issue 6A - Jun 1999
Volume 24, Issue 5B - 00 1999
Volume 24, Issue 5A - 00 1999
Volume 24, Issue 4B - 00 1999
Volume 24, Issue 4A - 00 1999
Volume 24, Issue 3B - 00 1999
Volume 24, Issue 3A - 00 1999
Volume 24, Issue 2B - 00 1999
Volume 24, Issue 2A - 00 1999
Volume 24, Issue 1B - 00 1999
Volume 24, Issue 1A - 00 1999
Volume 24, Issue 12 - 00 1999
Volume 24, Issue 11B - 00 1999
Selecting the target year
A Study on Adaptive MMSE RAKE Detector for Forward-link CDMA Communication Systems
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1265~1275
An adaptive MMSE detector can be used to cancel the MAI in CDMA system. But standard adaptive MMSE detector cannot be used in real mobile environment due to fast fading channel. Furthermore multipath reception make it more difficult to converge to optimum weight values. In this paper we discuss and model the multipath fading environment in Forward-link Synchronous CDMA channels and propose adaptive MMSE RAKE detector structure which can be applied in the mobile station. A proposed adaptive MMSE detector requires estimation of received signal delay and complex channel coefficients such as amplitude and phase variation. These burden can be solved by utilizing the common pilot channel. The pilot channel may have higher power than the traffic channel, which give more exact channel estimation. Moreover RAKE structure gives more accurate and stable result which can be used as reliable reference signal in multipath fading channel environment. With this structure, conventional adaptive algorithm such as LMS or NLMS can be applied in adaptive MMSE detector.
A Fault Tolerant ATM Switch using a Fully Adaptive Self-routing Algorithm - The Cyclic Banyan Network
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1276~1284
We have evaluated the BER's and CLP's of Wireless ATM (WATM) cells employing the concatenated FEC code with pilot symbols for fading compensation through the simulation in indoor wireless channel modeled as a Rayleigh and a Rician fading channel, respectively. The results of the performance evaluation are compared with those obtained by employing the convolutional code in the same condition. In Rayleigh fading channel, considering the maximum tolerance BER (
) as a criterion of the voice service, it is blown that the performance improvement of about 4 dB is obtained in terms of
by employing the concatenated FEC code with pilot symbols rather than the convolutional code with pilot symbols.When the values of K parameter which means the ratio of the direct signal to scattered signal power in Rician fading channel are 6 and 10, it is shown that the performance improvement of about 4 dB and 2 dB is obtained, respectively, in terms of
by employing the concatenated FEC code with pilot symbols considering the maximum tolerance BER of the voice service. Also in Rician fading channel of K=6 and K= 10, considering CLP =
as a criterion, it is observed that the performance improvement of about 3.5 dB and1.5 dB is obtained, respectively, in terms of
by employing the concatenated FEC code with pilot symbols.
The Effect of Compressed Video Traffic over ABR on Satellite ATM Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1285~1294
In this paper we consider the performance of TCP video traffic over ABR with Long-Range Dependent VBR traffic. As compressed coded video traffics are increasing rapidly over Internet, lots of studies are being done for transmitting those traffics efficiently using limited network resources. We consider here the transmitting video service over ABR service in ATM networks, especially satellite networks. CBR or VBR services are suggested in transmitting the video traffic in ATM Forum TM 4.0. But ABR service connection, which is considered as appropriate service for data traffic, can be established with a small amount of bandwidth, MCR (Minimum cell rate). Furthermore ABR service can control the source's transmitting rate using feedback mechanism. Using this feature ABR service can be used in some applications which can control their quality of services corresponding to network loads. Compressed video sources with MPEG-2 are used for Long-Range Dependent VBR traffic here. We model the compressed video source to resemble the MPEG-2 transport streams. These compressed video traffic streams are consisted of three different frames, I-frame, P-frame, and B-frame. So when a network are overloaded, we can control the quality of service using this traffic features. TCP Traffics over ABR need large buffers in ATM switch to satisfy their QoS with background VBR traffics, which have high deviations in bandwidth. Furthermore satellite ATM networks with large feedback delay need large buffers corresponding RTT delay. The performance comparisons among EFCI and ER switch (ERICA+) switches in the network circumstances described above were shown in this paper. We also considered the case with ON-OFF VBR traffics.
Implementation and Performance Analysis of Mobile Multimedia Terminal (H.324M)
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1295~1305
In this paper, we present the implementation and performance analysis of H.324M mobile multimedia terminal which s under standardization. The H.324M is the mobile extension of H.324 which is the standard for low bit rate multimedia terminals operating over GSTN. For H.324M, the multiplexing protocol (H.223) of H.324 is enhanced to protect data from the transmission errors over mobile channels. The multiplexing protocol of H.324M is classified into Levels 0, 1, 2, and 3 depending on the level of error protection. Each Level is analyzed according to different types of the data loss elements. Simulation results show that the loss caused by the corrupted flag and header produces the most serious performance degradation. Levels 1 and 2 which protect the header and flag are effective in reducing the total loss. Furthermore, the optimal flag length and threshold value for Levels 1 and 2 are determined.
The Calculation of Cell Radius for CDMA PCS System on the presumption of Log-normal Distribution with The Hata Path Loss Model
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1306~1313
In this paper, we propose the signal strength path loss model (modified Hata path loss Model) and the signal strength distribution model (log-normal distribution) for the cell design of the land mobile communication system. We applied the measured experimental data at Soosungdon and Sanjuckdong in Daeku, to this model and calculate the fraction of total area above threshold.
Performance Comparison Among Realtime Operating Systems for IMT-2000 Base Station Controller
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1314~1321
This paper presents a performance comparison of commercial realtime operating systems which is widely used and guarantees short response time for call processing in IMT-2000 base station. For this, we analyzed wireless call process and extracted primitives which have strong influence on the performance of the system are derived. Constructing and running a test-bed for call processing on the basis of the analysis, we tested if there's a bottleneck in the performance of the system and compared the performances among the commercial realtime operating systems.
High-Resolution Algorithm for Direction Finding of Multiple Incoherent Plane Waves
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1322~1328
In this paper, we propose a Multiple Signal Classification(MUSIC) in conjunction with signal enhancement (SE-MUSIC) for solving the direction-of-arrival estimation problem of multiple incoherent plane waves incident on a uniform linear array. The proposed SE-MUSIC algorithms involve the following main two-step procedure : ( i )to find the enhanced matrix that possesses the prescribed properties and which lies closest to a given covariance matrix estimate in the Frobenius norm sense and (ii) to apply the MUSIC to the enhanced matrix. Simulation results are illustrated to demonstrate the better resolution and statistical performance of the proposed method than MUSIC at lower SNR.
Signal Interference Rejection using Data-Recycling LMS Algorithm in Digital Communication System
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1329~1338
In this paper, an efficient signal interference control technique to improve the convergence speed of LMS algorithm is introduced. The convergence characteristics of the proposed algorithm, whose coefficients are multiply adapted in a symbol time period by recycling the received data, are analyzed to prove theoretically the improvement of convergence speed. According as the step-size parameter
is increased, the rate of convergence of the algorithm is controlled. Also, a increase in the step-size parameter
has the effect of reducing the variation in the experimentally computed learning curve. Increasing the eigenvalue spread has the effect of controlling down the rate of convergence of the adaptive equalizer and also increasing the steady-state value of the mean squared error and also demonstrate the superiority of signal interference control to the filter algorithm increasing convergence speed by (B+1) times due to the data-recycling LMS technique.
A Study on Digital Information Hiding Technique using Random Sequence and Hadamard Matrix
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1339~1345
In this paper we propose the digital information hiding technique by which we use the combination of random sequence and Hadamard matrix to hide multiple information. The prior work used only one random sequence multiplied by information signal to lower the energy level of information signal and thus it is difficult for a third party to detect the information signal or jam it. But because we have to use the orthogonal code for hiding key in order to hide multiple information in the same digital image, only the use of random sequence that are not uncorrelated has some problems in the information hiding scheme. Thus we present a new information hiding scheme that can be used in hiding multiple information by the use of random sequence that spreads the energy level of the data to be hidden and Hadamard matrix that makes the random sequence uncorrelated.
Improved Performance of FSE for the ISI Reduction Pulse Diagnostic Apparatus Data Channel
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1346~1353
We propose the MADF(multiplication free adaptive digital filter) algorithm and implement the fractionally spaced equalizer based on it. To evaluate the performance of proposed MADF algorithm, fractionally spaced equalizer(FSE) is used. Especially, we present that this method have the advantages for the condition having the low-frequency and slow speed
Analysis of MMPP/M/1 Queue with several homogeneous two-state MMPP sources
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1354~1358
In this paper, we suggest a simple computational algorithm to obtain the queue length distribution in the finite queue, where the input process consists of several homogeneous two-state Markov modulated Poisson processes. With comparison to the conventional algorithm, is more practical, in particular, when a large number of input sources are loaded to the system.
An Efficient Explicit Rate Feedback Switch Algorithm for the ABR Flow Control
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1359~1371
In this paper, we propose an efficient explicit rate (ER) feedback switch algorithm for available bit rate (ABR) flow control. In order to improve the disadvantages of existing ER feedback switch algorithms with congestion avoidance, the proposed scheme adjusts the target utilization dynamically according to the queue length and its growth rate. also, we investigate the performance of the proposed switch algorithm and compare it with ERICA and NIST switches using simulation. Simulation results show that the proposed switch algorithm can control the cell emission rate of a source rapidly according to variations of available link bandwidth by using dynamic adaptation of target utilization. It also exhibits a better performance than the existing ER feedback switches in terms of queue length and link utilization.
Performance Analysis of Error Control Techniques Using Forward Error Correction in B-ISDN
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1372~1382
The major source of errors in high-speed networks such as Broadband ISDN(B-lSDN) is buffer overflow during congested conditions. These congestion errors are the dominant sources of errors in 1high-speed networks and result in cell losses. Conventional communication protocols use error detection and retransmission to deal with lost packets and transmission errors. However, these conventional ARQ(Automatic Repeat Request) methods are not suitable for the high-speed networks since the transmission delay due to retransmissions becomes significantly large. As an alternative, we have presented a method to recover consecutive cell losses using forward error correction(FEC) in ATM(Asynchronous Transfer Mode)networks to reduce the problem. The performance estimation based on the cell discard process model has showed our method can reduce the cell loss rate substantially. Also, the performance estimations in ATM networks by interleaving and IP multicast service are discussed.
Adaptive rate control for video communication
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1383~1391
This paper presents a rate control method that minimizes global distortion under given target bit rates for video communication. This method makes the quality of reconstructed images better than that of the conventional ones based on R-D model at the same bit rates. Given a set of quantizers, a sequence of macroblocks to be quantized selects the optimal quantizer for each macroblock so that the total cost measure is minimized and the finite buffer is never in overflow. To solve this problem we provide a heuristic algorithm based on Lagrangian optimization using an operational rate-distortion framework and a quantization method follows H.263recommendation.
Two-Stage Fast Full Search Algorithm for Black Motion Estimation
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1392~1400
In this paper, we propose a two-stage fast full search algorithm for block motion estimation that produces the same performance to that of full search algorithm (FSA) but with remarkable computation reduction. The proposed algorithm uses the search region subsampling and the difference of adjacent pixels in the current block. In the first stage, we subsample the search region by a factor of 9, and then calculate mean absolute error (MAE) at the subsampled search points. And in the second stage, we reduce the search points that need block matching process by using the lower bound of MAE value at each search Point. We Set the lower bound of MAE value for each search point from the MAE values which are calculated at the first stage and the difference of adjacent pixels in the current block. The experimental results show that we can reduce the computational complexity considerably without any degradation of picture quality.
Fast Black Matching Algorithm Using The Lower and Upper Bound of Mean Absolute Difference
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1401~1410
In this paper, we propose a fast block matching algorithm using the lower and upper bound of mean absolute difference (MAD) which is calculated at the search region overlapped with neighbor blocks. At first, we calculate the lower bound of MAD and reduce the search point by using this lower bound. In this method, we can get good prediction error performance close to full search block matching algorithm (FSBMA), but there exists some computational complexity that has to be reduced. Therefore, we further reduce the computational complexity by using pixel subsampling besides the lower and upper bound of MAD. Experimental results show that we can remarkably reduce the computational complexity with good prediction error performance close to FSBMA.
Fast Motion Estimation Algorithm Using Motion Vector Prediction and Neural Network
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1411~1418
In this paper, we propose a fast motion estimation algorithm using motion prediction and neural network. Considering that the motion vectors have high spatial correlation, the motion vector of current block is predicted by those of neighboring blocks. The codebook of motion vector is designed by Kohonen self-organizing feature map(KSFM) learning algorithm which has a fast learning speed and 2-D adaptive chararteristics. Since the similar codevectors are closely located in the 2-D codebook the motion is progressively estimated from the predicted codevector in the codebook. Computer simulation results show that the proposed method has a good performance with reduced computational complexity.
Efficient Implementation of Morphological Filters by Structuring Element Decomposition
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1419~1424
In order to implement morphological filters on image processing systems, the size of structuring element must be small due to the architectural constraints of the systems, which requires the decomposition of structuring element into small elements for the filters with large structuring elements. In this paper, an algorithm for decomposition of structuring element with no restriction on the shape and size is developed which enables sub-optimal implementation of any morphological filter on 3X3 pipeline machine. The given structuring element is first decomposed into the union of elements using sequential search procedure, then each element is further decomposed optimally into 3X3 elements, resulting in final sub-optimal 3
3 hybrid decomposition. The proposed algorithm is applied to some structuring elements and the results close to the optimum are obtained.
Performance analysis of EY-NPMA protocol in the infinite population model of HIPERLAN
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1425~1433
In this Paper, we analyzed the HIPERLAN(Hlgh PErformance Radio LAN) MAC(Medium Access Control) protocol, which was a standard for Wireless LANs defined by ETSI. We analyzed mathematically the elimination phase and the yield phase of the channel contention phase of CAC(Channel Access Control) layer in the infinite population model of the HIPERLAN using EY-NPMA(Elimination Yield-Nonpreemptive Priority Multiple Access)protocol. Also we analyzed the probability of successful transmission in the transmission phase. And, we proved results of a mathematical analysis by the simulation of HIPERLAN MAC protocol.
Simplified Equivalent Circuit of Hairpin Line Filters
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1434~1441
This paper presents an equivalent circuit of the hairpin line filter for accurate analysis and design. Its validity was verified by computer simulations and filter design experiments. Though the various design equations for a hairpin line filter have been proposed, there has not been a practically simplified equivalent circuit because it is hard to effectively represent interconnection effects between non-adjacent elements. In this paper, all the open ports of the hairpin line filter circuit are changed to the short ports using circuit duality, and the resulting circuits are transformed to graph model. The further simplified circuit model is obtained from boundary conditions, and then the final equivalent circuit of the hairpin line filter is derived in a dual structure of the filter.
Implementation of the Frame Memory Hardware for MPEG-2 Video Encoder
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9A, 1999, Pages 1442~1450
In this paper, we present an efficient hardware architecture for the frame memory of the MPEG-2 video encoder. Both the total size of internal buffers and the number of logic gates are reduced by the proposed memory map which can provide an effective interface between MPEG-2 video encoder and the external DRAM. Furthermore, the proposed scheme can reduce the DRAM access time. To realize the frame memory hardware,
, VTI, vemn5a3 standard cell library is used. VHDL simulator and logic synthesis tool are used for hardware design and RTL (register transfer level) function verification. The frame memory hardware emulator of the proposed architecture is designed for gate-level function verification. It is expected that the proposed frame memory hardware using VHDL can achieve suitable performance for MPEG-2 MP@ML.