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
Design of Dynamic Route Control Gateway for High-Speed Data Communication over Public Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 593~603
In this paper, a dynamic route control scheme to increase speed of data communication over public network is presented. And a new structure of gateway which is suitable for the public network environments is proposed and analyzed. For dynamic allocation of transmission routing resources of the gateway and improvement of call processing ratio of the system, virtual queue is used. As results, route utilization ratio of the proposed scheme can be improved up to 60% as compared to the conventional fixed route control scheme. For the case of limited number of routes, it provides high speed data communication while maintaining delay time as low as possible. In addition, as the allocation period at call access node can be varied with the traffic in the proposed scheme, various traffics can be applied easily. Thus, it can be expected that the presented dynamic route control gateway may be suitable for application in high speed data communication over public network.
Design of a CAM-Type Traffic Policing Controller with minimum additional delay
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 604~612
In order to satisfy the desired QoS level associated with each existing connection, ATM networks require traffic policing during a connection. Users who respect the contract should receive the function of transparent traffic policing without any interruption. However, contract violations should be detected and mediated immediately. So we propose a CAM type policing controller to allow user cell streams to minimize additional delay. The proposed policing scheme controls policing actions including traffic shaping by suitably spacing cells on each virtual circuit. This policing action is based on parallel processing of multiple cell stream which arrive in ATM multiplexed virtual circuits. We have developed an analytical model of the proposed policing scheme to examine the amount of cell loss and delay, which depends on traffic load, the size of policing buffers and minimum spacing cell time.
The Broadband Auto Frequency Channel Selection of the Digital TV Tuner using Frequency Mapping Function
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 613~623
Digital TV tuner for 8-VSB modulation was developed with satisfying the requirements of ATSC. The double frequency conversion and the active tracking filter in the front-end were used to reduce interference of the adjacent channels and multi-channels, which suppress If beat and image band. However, it was impossible to get frequency mapping between tracking filter and first VCO(Voltage Controlled Oscillator) in the double conversion digital TV tuner differing from conventional NTSC tuner. This paper, therefore, suggests the available structure and a new method for automatic frequency selection by obtaining the mapping of frequency characteristic over tracking voltage and the combined hardware which compose of Micro-controller, EEPROM, D/A(Digital-to-Analog Converter), OP amp and switch driver to solve above problems.
The Study on Improvement of Traffic Rho Performance in RF Transmitter of CDMA Handset
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 624~628
In this paper, the phenomenon to show in CDMA handset in case of which CDMA handset do not meet Traffic Rho value of IS-98B specifications, which have minimum requirements of CDMA handset about electrical performance is analyzed. This paper proposed method to improve Traffic Rho through improving the matching circuit of TX IF SAW FILTER and deleting noise of LDO(Low Dropout Regulator) to generate 3.OV_TX in TX block. HP8924C(CDMA Mobile Station Tester Set) and HP8595E(Spectrum Analyzer) measures the improved CDMA waveform.
Frequency-Domain Equalizer Using 2-Dimensional LMS Algorithm for DWMT Based VDSL Transceiver
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 629~634
In this paper, we describe the structure of the DWMT (discrete wavelet multitone) transceiver for VDSL system. The DWMT transceiver consists of the transmultiplexer using cosine modulation filter bank (CMFB), time domain equalizer (TEQ) and frequency domain equalizer (FEQ) minimizing the effects of the transmission channel. For FEQ, we have expanded the conventional l-D linear transversal equalizer into 2-dimensions, i.e. time and subchannel axes and we have implemented it using the 2-dimensional LMS methods. In order to qualify the performance of FEQ, we have applied it to the DWMT based VDSL transceiver and the equalizer's performance is verified by simulation using the VDSL line test model specified by the ANSI T1E1.4 requirements.
Performance Analysis of 2D-RAKE Receiver over Correlated Nakagami Fading Channel
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 635~639
The average bit error rate (BER) performance of 2D-RAKE receiver, operating in a correlated Nakagami fading channel, is analyzed. The analysis assumes correlated fading between the array elements with identical fading parameters but with unbalanced average signal-to-noise ratio (SNR). And independent but non-identically distributed frequency-selective fading channel with different fading parameters is assumed. The analyses show that fading correlation, delay profile, average SNR distribution, and fading parameters of combined branches affect the overall performance of 2D-RAKE receiver.
Mobility Extension using Location Concept in Mobile Agent Languages
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 640~645
Mobility in the mobile agent language is an important issue. The scope range of the agent which can move is closely related with the work which the agent can do for users. The location concept proposed in this paper can make an activity scope of agent various by defining and classifying the destination of mobile agent as a logical and physical location. We designed and implemented a java class that describes creation, deletion, and execution of agent and a service system of agent that executes the described program on the computer which is linked to network to assist the location concept. The location concept will advance the mobility of agent and this agent is expected to provide much better service for users.
Design and Implementation of a Concuuuency Control Manager for Main Memory Databases
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 646~680
In this paper, we discuss the design and implementation of a concurrency control manager for a main memory DBMS(MMDBMS). Since an MMDBMS, unlike a disk-based DBMS, performs all of data update or retrieval operations by accessing main memory only, the portion of the cost for concurrency control in the total cost for a data update or retrieval is fairly high. Thus, the development of an efficient concurrency control manager highly accelerates the performance of the entire system. Our concurrency control manager employs the 2-phase locking protocol, and has the following characteristics. First, it adapts the partition, an allocation unit of main memory, as a locking granule, and thus, effectively adjusts the trade-off between the system concurrency and locking cost through the analysis of applications. Second, it enjoys low locking costs by maintaining the lock information directly in the partition itself. Third, it provides the latch as a mechanism for physical consistency of system data. Our latch supports both of the shared and exclusive modes, and maximizes the CPU utilization by combining the Bakery algorithm and Unix semaphore facility. Fourth, for solving the deadlock problem, it periodically examines whether a system is in a deadlock state using lock waiting information. In addition, we discuss various issues arising in development such as mutual exclusion of a transaction table, mutual exclusion of indexes and system catalogs, and realtime application supports.
Design and Implementation of an Index Manager for a Main Memory DBMS
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 661~674
The main memory DBMS(MMDBMS) efficiently supports various database applications that require high performance since it employs main memory rather than disk as a primary storage. In this paper, we discuss theexperiences obtained in developing the index manager of the Tachyon, a next-generation MMDBMS. The indexmanager is an essential sub-component of the DBMS used to speed up the retrieval of objects from a largevolume of a database in response to a certain search condition. Previous research efforts on indexing proposed various index structures. However, they hardly dealt with the practical issues occured in implementating an index manager on a target DBMS. In this paper, we touch these issues and present our experiences in developing the index manager on the Tachyon as solutions. The main issues touched are (1) compact representation of an indexentry, (2) support of variable-length keys, (3) support of multiple-attribute keys, (4) support of duplicated keys,(5) definition of external APls, (6) concurrency control, and (7) backup and recovery. We believe that ourcontribution would help MMDBMS developers highly reduce their trial-and-errors.
A New Implementable Scheduling Algorithm Supporting Various Traffics in ATM Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 675~682
In this paper, we propose a new scheduling algorithm called the Adaptive Weighted Round Robin with Delay Tolerance (AWRR/DT). The proposed scheme is based on the per-class queueing mechanism in which a number of connections of similar characteristics are multiplexed into one class-queue. Traffic classes of the proposed method are classified into a single non-real-time traffic class and other real-time traffic classes. The proposed scheme determines the weights of classes according to the input traffic and delay characteristics of each class at the beginning of every cycle. Furthermore, this scheme incorporates a cell discarding method to reduce the QoS degradation that may be incurred by congestion of networks. We have evaluated the proposed scheme through discrete-event simulation. Simulation results indicate that the proposed scheme can reduce the average delay of non-real-time class while maintaining the QoS of real-timeclasses. The proposed algorithm can be effectively applied to high-speed networks such as ATM networks.
Intelligent Modelling Techniques Using the Neuro-Fuzzy Logic Control in ATM Traffic Controller
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 683~691
In this paper, we proposed the cell multiplexer using Hopfield neural network and the bandwidth predictor using the backpropagation neural network in order to make an accurate call setup decision. The cell multiplexer controls heterogeneous traffic and the bandwidth predictor estimates minimum bandwidth which satisfies traffic's QoS and maximizes throughput in network. Also, a novel connection admission controller decides on connection setup using the predicted bandwidth from bandwidth predictor and available bandwidth in networks. And then, we proposed a fuzzy traffic policer, when traffic sources violate the contract, takes an appropriate action and aim proved traffic shaper, which controls burstness which is one of key characteristics in multimedia traffic. We simulated the proposed controller. Simulation results show that the proposed controller outperforms existing controller.
Performance Analysis of LAN Interworking Unit for Capacity Dimensioning of Internet Access Links
Park, Chul-geun ; Han, Dong-hwan ;
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 692~699
We build and analyze some types of queueing model to discuss capacity dimensioning of access links of a LAN interworking unit connected to the Internet backbone network. We assume that the IWU has a FIFO buffer to transmit IP packets to the Internet through the backbone. In order to analyze the system, we use a Poisson process and an MMPP process as input traffic models of IP packets and we use a general service time distribution as a service time model. But we use both an exponential service time and a deterministic service time in numerical examples for simple and efficient performance comparisons. As performance measures, we obtain the packet loss probability and the mean packet delay. We present some numerical results to show the effect of arrival rate, buffer size and link capacity on packet loss and mean delay.
A Study on Implementation and Design of Secure VOD System
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 700~707
In this paper, we address vulnerabilities of legacy VOD system and implement secure-VOD system to protect security holes of it. Our secure-VOD system provide user authentication using one-time password, message authentication and encryption/decryption for video server information. To improve security of existing fixed password system, our secure-VOD system use one-time password. Also, our secure-VOD system provides integrity for video server information by generating and verifying message authentication code using HMAC-HAS 160 algorithm. Finally, our secure-VOD system uses RC5 encryption algorithm to guarantee confidentiality for video server information.
VLSI Array Architecture for High Speed Fractal Image Compression
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 708~714
In this paper, an one-dimensional VLSI array for high speed processing of fractal image compression algorithm based the quad-tree partitioning method is proposed. First of all, the single assignment code algorithm is derived from the sequential Fisher's algorithm, and then the data dependence graph(DG) is obtained. The two-dimension array is designed by projecting this DG along the optimal direction and the one-dimensional VLSI array is designed by transforming the obtained two-dimensional array. The number of Input/Output pins in the designed one-dimensional array can be reduced and the architecture of process elements(PEs) can he simplified by sharing the input pins of range and domain blocks and internal arithmetic units of PEs. Also, the utilization of PEs can be increased by reusing PEs for operations to the each block-size. For fractal image compression of 512X512gray-scale image, the proposed array can be processed fastly about 67 times more than sequential algorithm. The operations of the proposed one-dimensional VLSI array are verified by the computer simulation.
3-D Subband Filter Banks for Lossless Compression of Volumetric Images
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 715~724
This Paper presents 3-D subband filter banks which are effective for progressive and lossless compression of volumetric images. For such a purpose, ORT(Overlapping Rounding Transform), applied so far to 1-D losslesssubband filter banks, is now used to implement two types of 3-D lossless subband filter banks: separable andnon-separable types. Separable fiter banks are implemented form applying 1-D lossless filter banks consecutively.Non-separable later banks are developed by expanding the 1-D ORT into 3-D one. In particular, the proposed ORT based 3-D non-separable filter banks generalizes the 3-D HINT(Hierarchical INTerpolation) algorithm.Through the experiment comparisons on various volumetric medical images, we prove that the proposedseparablefnon-separable filter banks perform better, in terms of compression ratio (first order entropy), than theother lossless compression techniques such as block based transform and conventional 3-D HINT.
Texture Coding in MPEG-4 Using Modified Boundary Block Merging Technique
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 725~733
In this paper, we propose a modified boundary block merging technique for the texture coding of MPEG-4. We propose an ORP(Optimized Region Partitioning) method that partition the VOP-based reference position to minimize the number of coding blocks. The merging possibility is improved by adding +90。and -90。 Rotation merging. We propose a MRM(Multiple Rotation Merging) method which applies the rotation merging in the order of 180。, +90。and -90。. If a pair of boundary blocks has low correlation, existing BBM's padding technique is not efficient. Our padding after merging method gives better result even if it has low correlation. The proposed method showed 5 ~8(%) coding bit reduction at the same PSNR values compared to BBM method.
A Study on Assembly Part Recognition Using Part-Based Superquadric Model
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 734~742
This paper presents a new volumetric approach to 3D object recognition by using PBSM (part-based superquadric model). The assembly part object can be constructed with the set of volumetric primitives and the relationships between them. We describe volumetric characteristics of the model object with superquadric parameters. In addition, our model base has the relationships between volumetric primitives as well as the surface information : the surface type, the junction type between neighboring surfaces. These surface properties and relationships between parts are effectively used in recognition process. Our integrated method is robust to recognition of the identity, position, and orientation of randomly oriented assembly parts. Furthermore, we can reduce the effects of self-occlusion and non-linear shape changes according to viewpoint. In this paper, we show that our integrated method is robust to recognition of the identity, position, and orientation of randomly oriented assembly parts through experimental results.
Image Compression Based on Wavelet Transform Using Shffling and Bit Plane Correlation
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 743~754
In this paper, we propose wavelet transform image compression method using shuffling and bit plane correlation. Proposed method is that original image decompose into multiresolutions using biorthogonal wavelet transform with linear phase response property and decomposed subbands are classified by maximum classification gain. And classified data sets in each subband are quantized using arbitrary set optimum bit allocation method. Quantized data sets in each subband are shuffled and context based bit plane arithmetic encoded .In context based bit plane arithmetic encoding, the context for each subband is not assigned uniformly, but assigned according to maximum correlation direction. Our results are comparable, or superior for some images at low rates, to published state-of-the-art coders.
Entropy Coders Based on Binary Forword Classification for Image Compression
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 755~762
Entropy coders as a noiseless compression method are widely used as end-point compression for images so there have been many contributions to increase of entropy coder performance and to reduction of entropy coder complexity. In this paper, we propose some entropy coders based on binary forward classification (BFC). BFC requires overhead of classification but there is no change between the amount of input information and that of classified output information, which we prove this property in this paper. And using the proved property, we propose entropy coders which are Golomb-Rice coder after BFC (BFC+GR) and arithmetic coder with BFC(BFC+A). The proposed entropy decoders do not have further complexity Son BFC. Simulation results also show better performance than other entropy coders which have similar complexity to proposed coders.
Residual Image Compression based on Wavelet Transform
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 763~770
In this paper, a new stereo image compression algorithm is suggested in which the residual image extracted from the stereo image by the disparity-compensated prediction method is compressed using the wavelet transform considering the inter & intra correlation between subbands. The compression performance of the proposed method is significantly improved by comparing with the conventional algorithm such as EPIC, EPWIC & JPEG through the computer simulation and the PSNR is also increased about 3.5dB compared with the EPIC. Finally, the stereo image having a good 3D effect can be reconstructed from the compressed image data by the proposed method.
An Efficient Hardware-Software Co-Implementation of an H.263 Video Codec
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 771~782
In this paper, an H.263 video codec is implemented by adopting the concept of hardware and software co-design. Each module of the codec is investigated to find which approach between hardware and software is better to achieve real-time processing speed as well as flexibility. The hardware portion includes motion-related engines, such as motion estimation and compensation, and a memory control part. The remaining portion of theH.263 video codec is implemented in software using a RISC processor. This paper also introduces efficient design methods for hardware and software modules. In hardware, an area-efficient architecture for the motion estimator of a multi-resolution block matching algorithm using multiple candidates and spatial correlation in motion vector fields (MRMCS), is suggested to reduce the chip size. Software optimization techniques are also explored by using the statistics of transformed coefficients and the minimum sum of absolute difference (SAD)obtained from the motion estimator.
A Proposal for Hit Ratio Improvement of a Microprocessor's Cache Memory
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 783~787
A microprocessor, which is used as a CPU for state-of-the-art personal computers, adopts 256KB or 512KB L2(Level 2) cache memory. This cache hires Direct Mapping Procedure, 32B Line Size, and no Write Allocation. In this cache architecture, we can expert about 2.5% hit ratio improvement by using 8-way Set Associative Mapping instead of Direct Mapping, 128B Line Size instead of 32B, and Write Allocation.
Low-noise VLSI Implementation of Pipelined IIR Filters
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 4B, 2000, Pages 788~795
Scattered look-ahead pipelining method can be efficiently used for high sample rate or low-power applications of digital recursive filters. Although the pipelined filters are guaranteed to be stable by this method, these filters suffer from large round off noise when the poles are crowed within some critical regions. To avoid this problem, a low-noise implementation technique was proposed using constrained Remez exchange algorithm. By the constrained filter design approach, the desired filter spectrum is satisfied while some of the pole angles are constrained to avoid pole crowding within critical regions. In the proposed approach, to obtain improved spectrum characteristics or better round off noise properties, the radius of the angle-constrained pole is optimized depending on the direction of the pole movement.