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 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 the Implementation of Point-to-Point Relay System for Digital LMDS System
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1601~1607
LMDS(Local Multipoint Distribution Service) is a broadband wireless transmission system in millimeter wave frequency. LMDS system is consisted with relay system to connect between head-end and hub and distribution system to connect between hub and subscribers. In this study, we develop point-to-point relay system to use back-bone system n LMDS network. We develop STM-1 transceiver over 27GHz and analyze the system performance. We can get the similar measurement results comparing the theoretical results and then prove that this system can fit LMDS back-bone network requirement. This is the first system in Korea and we expect this system can apply the various network.
A Study on the Inter Cell Interference Analysis of Digital LMDS System
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1608~1615
In this study, we investigate the inter cell interference of LMDS(Local multipoint Distribution Service) system cell in LMDS system design process. There are several interference sources in LMDS system but we consider co-channel adjacent interference, cross-polarization interference, tx/rx interworking interference as three major factors. As the summation of each interference, C/N is keep 19 dB in 2km range but decreased gradually over 2km. Based on theoretical results, we process the experimental test and get results that C/I=20 dB have to be maintained to transmit the data successfully under rain fall attenuation condition. This experiential results are similar to the theoretical analysis results we examined.
Performance Analysis of Low Bit-Rate Image Transmission over Concatenated Code WLL system
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1616~1623
This paper describes error resilient coding scheme is added in WLL system and its application for robust low-bit rate still image transmission over power controlled W-CDA system Rayleigh fading channels. The baseline JPEG compressing methods are uses in image coding over wireless channel. The channel uses Reed-Solomon(RS) outer codes concatenated with convolutional inner codes, and truncated type I hybrid ARQ protocol based on the selective repeat strategy and the RS error detection capability. Simulation results are proved for the statistics of the frame-error bursts of the proposed system in comparison with conventional WLL system. it gains the 2 dB of the Eb/No in same BER.
A New Frame Offset Assignment Algorithm For Reducing the Soft Handoff Blocking Probability Due to Lack of Frame Offset Capacity
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1624~1630
Code division multiple access (CDMA) is a promising air interface technique for cellular systems. When an MS (Mobile Station) moves to an adjacent cell, the handoff between the serving cell and the target cell is needed. Compared with the hard handoffs, the soft handoffs between two CDMA channels with the identical frequency assignments and frame offsets can provide a better quality of service by minimizing the undesirable ping pong phenomenon of back-and forth handoffs between two adjacent cells in conventional hard handoffs. For the soft handoff of a call to an adjacent cell to be successful, the adjacent cell should assign to the call the same frame offset as that being used in the original cell by the call. In this paper, considering the assignment states of the frame offsets of the adjacent cells, a frame offset assignment algorithm for the originated call is proposed. And analytic method for the handoff blocking probability due to the lack of the frame offset capacity is also presented to show the advantage of the proposed algorithm with respect to the soft handoff blocking probability.
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 9B, 1999, Pages 1631~1642
In this paper, we propose a new fault tolerant ATM Switch and a new adaptive self-routing scheme used to make the switch to be fault tolerant. It can provide more multiple paths than the related previous switches between an input/output pair of a switch by adding extra links between switching elements in the same stage and extending the self-routing scheme of the Banyan network. Our routing scheme is as simple as that of the banyan network, which is based on the topological relationships among the switching elements (SE’s) that render a packet to the same destination with the regular self-routing. These topological properties of the Banyan network are discovered in this paper. We present an algebraic proof to show the correctness of this scheme, and an analytic reliability analysis to provide quantitative comparisons with other switches, which shows that the new switch is more cost effective than the Banyan network and other augmented MIN’s in terms of the reliability.
A GoP-based Dynamic Transmission Scheduling for supporting Fast Scan Functions with m-times playback rate in Video-On-Demand
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1643~1651
Video-On-Demand (VOD) is expected to provide the user with interactive operations such as VCR functions. In particular, fast scan functions like “Fast Forward” of “Fast Backward” for a certain speedup playback are required. Since they require a significant amount of system resources, schemes to reduce bandwidth requirements for the network or disk are needed. In MPEG standard, Group-of-Pictures (GoP) is a random access unit which can be decoded independently. Since storing and transmitting a video stream based on GoP is efficient, it is practical to support fast scan functions based on GoP. In this paper, we present a dynamic transmission scheduling scheme to support fast scan functions with m-times normal playback rate for a stored video. The proposed scheme writes a transmission schedule whenever user requests a fast scan function. That is, the scheme constructs the data set to be smoothed by skipping GoPs according to a given speedup factor, and then writes the transmission schedule by applying a bandwidth smoothing. Finally, the scheme restarts the transmission of video data to a client according to the new schedule. The proposed scheme results in speeding up the playback rate by utilizing “GoP skipping”, and then reduces the computational overhead by applying a bandwidth smoothing based on GoP.
A Placement Policy improving Retrieval Efficiency of video streams in Clustered VOD Servers
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1652~1660
One of the most important goals in VOD servers is to provide services to more clients with services which clients request. In order to provide service efficiently and rapidly, though considering a few of policies, efficient placement of data when they are stored is direct cause to improve efficiency of retrievals. In this paper, we propose a efficient placement policy, encoded video data being stored in clustered VOD servers. In the proposed placement policy, partitioning a large disk array into smaller disk groups which consists of a few of disks with similar performances, specially disk I/O bandwidth. In last chapter, we compare proposed placement policy with conventional policies, and show the results of improved performances with proposed policy.
An Efficient VPI/VCI Allocation Algorithm for ABR Multipoint-to-point Connection in ATM Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1661~1667
In this paper, we propose an efficient VP extension algorithm for ABR multipoint-to-point connection in ATM networks. The VC merging or VP merging is used to implement ABR multipoint-to-point connection. We use the VP merging technique. To solve the scarcity problem of VP resources, we propose an efficient VP extension algorithm. Since the proposed scheme follows the standard VPI/VCI format, it doesn’t require another table according to the VP extension. We compare the proposed scheme with VC merging algorithm. The result shows that the proposed method can provide fair bandwidth allocation among the sources in multipoint-to-point connection.
A Design of Narrowband Bandpass Filter using High-Temperature Superconductor
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1668~1675
In this thesis, a narrowband bandpass filter using HTS is proposed for the multiplexer of the satellite communication subsystems. The proposed structure using HTS provides the narrower band and the lower insertion loss characteristics than the conventional parallel-coupled-line bandpass filter. The filter structure using hairpin-line only cause the spurious modes due to the surface waves. But these modes can be lessened by using the hybrid hairpin-line/parallel-coupled-line proposed in this thesis. The narrowband bandpass filters using HTS at the operation frequency of 14.25 GHz are fabricated to have the narrow bandwidth less 1% and the insertion loss less 3dB in comparison with the normal metal microstrip filter with the same three poles. The experimental results show that the filter using HTS has the characteristics of the narrower bandwidth and less insertion loss and can be fabricated with more compact size in comparison with the bandpass filter using normal metal.
A Design of the Double Circular Array Patch Antenna Minimized the Side Lobe
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1676~1682
In this paper, the double circular array microstrip patch antenna was designed to minimize the side lobe in which a cooperate feeding network was used to supply the same amplitude and equi-phase to each antenna element. Eight microstirip patch antenna(MPA) elements were arrayed with
interval in the inner circle and the outer circle respectively. The simulation results showed that when the radii of the inner circle and the outer circle were 0.7
0 and 1.45
0, the side lobes of beam pattern were minimized. As the results of the measurements, the return loss of the designed antenna was -14.5[dB] at 11.75[GHz] in the input terminal. When the level of the main lobe was normalized at 0[dB], those of the first and the second side lobe were -18[dB] and -26[dB] respectively. The radiation patterns agree well with the simulated patterns.
Implementation of Frequency Bandwidth Expander using VCO Drift Canceller and Comb generator
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1683~1689
We have implemented Frequency bandwidth expander with frequency upconverting by VCO drift canceller and comb generator. Te output of the low frequency synthesizer which the output frequency is 220~280MHz(Resolution : 5MHz) is expanded to 1660~2140MHz by this system. The phase noise of this system only depends on the phase noise of comb generator and low frequency synthesizer. The phase noise of VCO don’t influence at the frequency expander because the drift of VCO cancel out. When we control the output of VCO, the output frequency of this system is varied by 60MHz x N as filter banker. The switching time and the spurious of the frequency expander is below 3usec, -55dBc respectively. This system easily expands bandwidth additively by expanding the output bandwidth of the VCO. We can apply the frequency expander to very wide band microwave synthesizer which has fast switching time.
Region-based H.263 Video Codec with Effective Rate Control Algorithm for Low VBR Video
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1690~1696
Video sequence should be hierachically classified for the content-based retrieval. Cut detection algorithm is an essential process to classify shots. It is generally difficult for cut detection algorithms to detect cut points since a current frame is compared with a previous one, because movement of camera or object made adrupt scene change. We reduce ratio of failed cut detection so that compare the difference between frames of predicted cut point and their neighbors. In this paper, first we get predicted cut point, then we judge that the predicted cut point is true point or not. And we extracted DC images in MPEG video sequence for comparison. As a result of experiments. We confirmed that the cut detection ratio of the proposed algorithm is higher than of any other algorithms.
Fast Block Matching Algorithm With Half-pel Accuracy for Video Compression
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1697~1703
In this paper, we propose the fast block matching algorithm with half pel accuracy using the lower bound of mean absolute difference (MAD) at search point of half pel accuracy motion estimation. The proposed method uses the lower bound of MAD at search point of half pel accuracy which calculated from MAD's at search points of integer pel accuracy. We can reduce the computational complexity by executing the block matching operation only at the necessary search point. The points are selected when the lower bound of MAD at that point is smaller than reference MAD of integer pel motion estimation. Experimental results show that the proposed method can reduce the computational complexity considerably and keeping the same performance with conventional method.
An Efficient Object Detection Algorithm Using Stereo Images
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1704~1712
This research features efficient detection of obstacles, especially vehicles, in the forward direction of navigation for the development of unmanned automous vehicle. We separate image regions into ground and non-ground planes using the Helmholtz shearing technique in order to reliably exclude regions that do not contain obstacles. We propose a computationally simple and efficient method for the detection of vehicles in the forward direction by analysis of horizontally and vertically projected histograms of residual disparity map obtained from Helmholtz shearing. We have experimented the proposed method on real outdoor stereo data. Experimental results show that our method gives accurate detection of forward vehicles and is computationally very efficient.
Key Frame Extraction and Region Segmentation-based Video Retrieval in Compressed Domain
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1713~1720
This paper presents a new key frame extraction technique, for scene change detection, using the proposed AHIM (Accumulative Histogram Intersection Measure) from the DC image constructed by DCT DC coefficients in the compressed video sequence that is video compression standard such as MPEG. For fast content-based browsing and video retrieval in a video database, we also provide a novel coarse-to-fine video indexing scheme. In the extracted key frame, we perform the region segmentation as a preprocessing. First, the segmented image is projected with the horizontal direction, then we transform the result into a histogram, which is saved as a database index. In the second step, we calculate the moments and change them into a distance value. From the simulation results, the proposed method clearly shows the validity and superiority in respect of computation time and memory space, and that in conjunction with other techniques for indexing, such as color, can provide a powerful framework for image indexing and retrieval.
A Study on An Error-Resilient Constant Bit Rate Video Codec
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1721~1730
In this thesis, an error resilient video coding algorithm, under the error-prone environment such as wireless communication, is suggested. The suggested algorithm adapts the Classified VQ method for intra imagers that reduces some load by searching similar vectors. The Duplicate Vector Position Code is proposed for the higher compression efficiency and the robust decoding in error environment. As a result, the bitstream encoded by the proposed method is in a CBR(Constant Bit Rate) preventing from error propagation. The experiment that adds practical error to the encoded bitsrteam shows the error-robustness superior to H.263.
Color Image Processing using Fuzzy Cluster Filters and Weighted Vector
-trimmed Mean Filter
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1731~1741
Color images are often corrupted by the noise due to noisy sensors or channel transmission errors. Some filters such as vector media and vector
-trimmed mean filter have bee used for color noise removal. In this paper, We propose the fuzzy cluster filters based on the possibilistic c-means clustering, because the possibilistic c-means clustering can get robust memberships in noisy environments. Also, we propose weighted vector
-trimmed mean filter to improve the conventional vector
-trimmed mean filter. In this filter, the central data are more weighted than the outlying data. In this paper, we implemented the color noise generator to evaluate the performance of the proposed filters in the color noise environments. The NCD measure and visual measure by human observer are used for evaluation the performance of the proposed filters. In the experiment, proposed fuzzy cluster filters in the sense of NCD measure gave the best performance over conventional filters in the mixed noise. Simulation results showed that proposed weighted vector
-trimmed mean filters better than the conventional vector
-trimmed mean filter in any kinds of noise.
Bit-Rate Control Using Histogram Based Rate-Distortion Characteristics
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1742~1754
In this paper, we propose a rate control scheme, using histogram based rate-distortion (R-D) estimation, which produces a consistent picture quality between consecutive frames. The histogram based R-D estimation used in our rate control scheme offers a closed-form mathematical model that enable us to predict the bits and the distortion generated from an encoded frame at a given quantization parameter (QP) and vice versa. The most attractive feature of the R-D estimation is low complexity of computing the R-D data because its major operation is just to obtain a histogram or weighted histogram of DCT coefficients from an input picture. Furthermore, it is accurate enough to be applied to the practical video coding. Therefore, the proposed rate control scheme using this R-D estimation model is appropriate for the applications requiring low delay and low complexity, and controls the output bit-rate ad quality accurately. Our rate control scheme ensures that the video buffer do not underflow and overflow by satisfying the buffer constraint and, additionally, prevents quality difference between consecutive frames from exceeding certain level by adopting the distortion constraint. In addition, a consistent 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 improment of about 3.5 dB and 1.5 dB is obtained, respectively, in terms of
by employing the concatenated FEC code with pilot symbols.
Region-based H.263 Video Codec with Effective Rate Control Algorithm for Low VBR Video
Song, Hwangjun ;
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1755~1766
A region-based video codec based on the H.263+ standard is examined and its associated novel rate control scheme is proposed in this work. The region-based coding scheme is a hybrid method that consists of the traditional block DCT coding and the object-based coding. Basically, we adopt H.263+ as the platform, and develop a fast macroblock-based segmentation method to implement the region-based video codec. The proposed rate control solution includes rate control in three levels: encoding frame selection, frame-layer rate control and macroblock-layer rate control. The goal is to enhance the visual quality of decoded frames at low bit rates. The efficiency of proposed rate control scheme applied to the region-based video codes is demonstrated via several typical test sequences.
On the Control of Energy Flow between the Connection Parts of Syllables for the Korean Multi-Syllabic Speech Synthesis in the Time Domain Using Mono-syllables as a Synthesis Unit
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1767~1774
This paper is to synthesize Korean multi-syllabic speeches in the time domain using mono-syllables as a synthesis unit. Specially it is to control the shape forms of speech energy flows between the connection parts of syllables in the case of concatenation mono-syllables. For this it is controlled with the prosody parameters1) extracted from speech waveforms in the time domains and presented the experimental results controlled the energy flows by using the induced concatenation rules from the korean syllable shapeforms in connetion parts of syllables. In the results of experiments, it is removed the incontinuities of energy follows in the connection parts produced by concatenating the mono-syllables in the time domain and also improved the qualities and naturalites of synthesized speeches.
Reducing the Number of Hidden Nodes in MLP using the Vertex of Hidden Layer's Hypercube
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1775~1784
This paper proposes a method of removing unnecessary hidden nodes by a new cost function that evaluates the variance and the mean of hidden node outputs during training. The proposed cost function makes necessary hidden nodes be activated and unnecessary hidden nodes be constants. We can remove the constant hidden nodes without performance degradation. Using the CEDAR handwritten digit recognition, we have shown that the proposed method can remove the number of hidden nodes up to 37.2%, with higher recognition rate and shorter learning time.
An approximated implementation of affine projection algorithm using Gram-Scheme orthogonalization
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1785~1794
The affine projection algorithm has known t require less computational complexity than RLS but have much faster convergence than NLMS for speech-like input signals. But the affine projection algorithm is still much more computationally demanding than the LMS algorithm because it requires the matrix inversion. In this paper, we show that the affine projection algorithm can be realized with the Gram-Schmidt orthogonalizaion of input vectors. Using the derived relation, we propose an approximate but much more efficient implementation of the affine projection algorithm. Simulation results show that the proposed algorithm has the convergence speed that is comparable to the affine projection algorithm with only a slight extra calculation complexity beyond that of NLMS.
Estimation Techniques for Sampling Frequency Offset in OFDM Systems
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 9B, 1999, Pages 1795~1805
In an OFDM (Orthogonal Frequency-Division Multiplexing) system, the sampling frequency offset between the transmitter and receiver is known to cause the interchannel interference (ICI), resulting in performance degradation. In this paper, we propose two time-domain techniques to estimate the sampling frequency offset, especially for a high data-rate OFDM system. The first technique estimates the sampling frequency offset by using the phase difference between two received samples with a fixed amount of time interval, corresponding to the transmitted training symbol, under the assumption of perfect symbol and carrier offset synchronization. The second technique estimates the sampling frequency offset and carrier frequency offset jointly, when the two offsets exist together, by using two training symbols with different frequency components and using a sample algebraic calculation. The proposed estimation techniques for sampling frequency offset cause no time delay due to all time-domain processing, and have a good performance due to no ICI effect. The performances of the proposed techniques are demonstrated by various simulations.