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 21, Issue 12 - Dec 1996
Volume 21, Issue 11 - Nov 1996
Volume 21, Issue 10 - Oct 1996
Volume 21, Issue 9 - Sep 1996
Volume 21, Issue 8 - Aug 1996
Volume 21, Issue 7 - Jul 1996
Volume 21, Issue 6 - Jun 1996
Volume 21, Issue 5 - May 1996
Volume 21, Issue 4 - Apr 1996
Volume 21, Issue 3 - Mar 1996
Volume 21, Issue 2 - Feb 1996
Volume 21, Issue 1 - Jan 1996
Selecting the target year
Target recognition using multiple necognitron-module
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2739~2749
This aper introduces the multiple Neocognitron module approach for the effective target reognition. The Neocognitron which is designed to classify a pattern by extracting the local features from it, seems to be an unique method that can perform a pattern recognition using the neural networks. But due to its rigid structure, the Neocognitron must be reconstructed whenever there exists a variation on the number of classes. This is a quite difficult problem for the target recognition application that needs huge amount of computation and numerous classes to be classified. In this paper, we construct several smaller Necognitrom modules and train each module to adapt each class. After construction of the mulules, we integrate them in parallel so as to adaopt input at the same time and to produce each score that shold be matched to be learned class. This approach can reduce the sizes of the networks and is adaptive to the increase of classes as well as the authentic distortion, shift, scale variation and slight rotation invariant properties of general Neocognitron. This paper show the effectiveness of the proposed approach through some experience and performs analysis of the inhibitory interconnections in the architecture of the multiple module structure.
A new method of lossless medical image compression
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2750~2767
In this papr, a new lossless compression method is presented based on the Binary Adaptive Arithmetic Coder(BAAC). A simple unbalanced binary tree is created by recursively dividing the BAAC unit interval into two probability sub-inervals. On the tree the More Probable Predicted Value(MPPV) and Less Probable Predicated Value(LPPV) estimated by local statistics of the image pixels are arranged in decreasing order. The BAAC or Huffman coder is thus applied to the branches of the tree. The proposed method allows the coder be directly applied to the full bit-plane medical image without a decomposition of the full bit-planes into a series of binary bit-planes. The use of the full bit model template improves the compresion ratio. In addition, a fast computation for adjusting the interval is possible since a simple arithmetic operation based on probability interval estimation state machine is used for interval sub-division within the BAAC unit interval.
A study on variable block matching algorithm using differential image and quad tree
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2768~2775
VariableBlock Matching algorithm is effective for the estimation of motion vector at complexor edge region by means of using variable block size with respect to the image block. But since VBM algorithm requires considerable number of operations, to solve this problem, we present an algorithm which uses difference images and quad tree structure, and estimates motion using various fast block matching algorithms.
A feature-based motion parameter estimation using bi-directional correspondence scheme
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2776~2788
A new feature-based motion parameter estimation for arbitrary-shaped regions is proposed. Existing motion parameter estimation algorithms such as gradient-based algorithm require iterations that are very sensitive to initial values and which often converge to a local minimum. In this paper, the motion parameters of an object are obtained by solving a set of linear equations derived by the motion of salient feature points of the object. In order to estimate the displacement of the feature points, a new process called the "bi-directional correspondence scheme" is proposed to ensure the robjstness of correspondence. The proposed correspondence scheme iteratively selects the feature points and their corresponding points until unique one-to-one correspondence is established. Furthermore, initially obtained motion paramerters are refined using an iterative method to give a better performance. The proposed algorithm can be used for motion estimationin object-based image coder, and the experimental resuls show that the proposed method outperforms existing schemes schemes in estimating motion parameters of objects in image sequences.sequences.
Real-time fractal coding implementation using the PC
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2789~2800
Real time fractal coding for successive QCIF 144*176 luminance images has been implemented on a 50MHz IBM 486 personal computer. To satisfy the frame encoding speed and data compression ratio, following algorithms are adopted. In order to minimize encoding time, extension SAS being not searching of domain blocks is used. for reducing the bits per pixel, conventioal 4*4 range block is extended to 8*8 range block. and range block extension decrease quality of decoded image. For improvement quality of decoded image, the paper apply quad-tree partition mothod. In order to divide **8 range block, self-simiarity is compared 8*8 range block with spatial contractive transformed 8*8 domain block. According to self-simiarity, the block is partitioned and owing to block partition, increased encoding time is minimized. According to self-simiarity of 8*8 range block and spatial contractive transformed 8*8 domain block, number of fractal factor is varied. Simultaneously with minimizing the decrement of decoded image's quality, transmittion rate and encoding time is shorted. The results enable us to process the real-time fractal coding. For the claire test image, the average PSNR was 32.4dB, 0.12 bit rates and 33ms coding time per frame.
Efficient task allocation algorithms for reducing processors on real-time multiprocessor system
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2801~2809
Scheduling problems in real-time systems are known to be NP-hard. the heuristic approaches aregenerally aplied to solve a certain class of systems. One of such cases is to allocate periodic tasks to multiprocessors while the moethod assures the requirement of the deadine constraints of real-time systems. The study on the allocation of periodic taks includes RMNF, RMFF, FFDUF and Next-Fit-M algorithms, which make a set of task grups first and then allocate to processors. This papre proposes the various algorithms which are based on the Next-Fit-M. To analyze the four proposed methods, simulation was carried on, in which the sample tasks are randomly generated with the various time intervals. The proposed algorithms reduce the number of processors compared with the conventional methods.
Data communication network design algorithm with minimum cost
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2810~2816
In this paper, the problem of obtaining topoloty for mesh network given the link costs and traffic requirements between all pairs of nodes is considered. The proposed DCN algorithm can be applied to the mesh network in a unified manner. Among the cost conditions, the triangle intequality of the MENTOR algorithm is removed in the proposed algorithm. The computational complexity of the algorithm is order N
, where N is the number of nodes in the network. The performances of proposed algorithm are better than those of the MENTOR algorithm in the case of the cost and the reliability of network.
A channel assignment scheme considering traffic characteristics in the CDMA cellular system
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2817~2827
In this paper, we propose a new channel assignment scheme considering traffic characteristics in the CDMA cellular system. The object of proposed method is to reduce the hard handoff of data calls which are very sensitive to transmission errors. In this algorithm, we use three channel assignment policies. First, all of the data calls are assigned to the primary CDMA channel if possible. Second, priority for primary CDMA channel is given to data calls by assigning some primary CDMA traffic channels exclusively for data calls. Third, data calls are assigned to the CDMA channel most served by neighbor cells, when all of the primary CDMA traffic channels are used. A performance analysis shows the minimum soft handoff probability of data calls in handoff which is guarantied any cellconfiguration is increased above 40% by the adopting proposed algorithm.
A shaping algorithm considering cell delay and buffer size
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2828~2835
In this paper we propose a new shaping algorithm which can control the shaping delay and the output buffer size based on the leaky bucket counter with a threshold value. This paper assumes that input traffic of the proposed shaping algorithm is the worst case traffic tolerated by the continuous leaky bucket algorithm and claracterizes traffic patterns that can depart from our shaping algorithm. We also compare shaping delay and output buffer size of the proposed algorithm with the existing shaping algorithm without a threshold value. Our results show that the proposed shaping algorithm can easily manage the shaping delay and output buffer size than any other mechanism.
A study on strategical statistical multiplexing of VBR MPEG bit streams and QoS based multiplexing gains
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2836~2849
Over ATM network, variable bit rate(or VBR) traffic is allowed. Control of VBR traffic is allowed. Control of VBR traffic becomes difficult if it is bursty. VBR video traffic becomes so much bursty during intra frame period that much cell loss would occur when satistical multiplexed in ATM swich. To aviod cellloss, extra communication resources should be allocated, which reduces the capability of an ATM channel. In this paper, we propose two methods which enable a channel limited in resources to serve more VBR MPEG video bit streams. Firstly, we could redue the bitrate fluction of a statiscally multiplexed bundle of VBR video bit streams by reducing the number of intra frames overlapped at the same frame period. This method can be used in ATM switch which controls multiple video sources. Secondary, in two layer enoding, statistical multiplexing gains can be icreased by letting peak bit rate durations of both layers not be overlapped. This results in more smooth traffic. The performance of proposed methods are demonstrated by a proposed calculation method of statistical multiplexing gains(or SMGs.) The proposed SMG is based on both delay and cell loss QoS requirements at the same time.
Design of a shared buffer memory switch with a linked-list architecture for ATM applications
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2850~2861
This paper describes the design of AATM switch LIS of shared buffer type with linked-list architecture to control memory access. The proposed switch LSI consists of the buffer memory, controller and FIFO memory blocks and two special circuits to avoid the cell blocking. One of the special circuit is a new address control scheme with linked-list architecture which maintains the address of buffer memory serially ordered from write address to read address. All of the address is linked as chain is operated like a FIFO. The other is slip-flag register it will be hold the address chain when readaddress missed the reading of data. The circuits control the buffer memory efficiently and reduce the cell loss rate. As a result the designed chip operates at 33ns and occupied on 2.7*2.8mm
using 0.8.mu.m CMOS technology.
A performance study on the fairness of a feedback-based rate control scheme applied to a multicast connection
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2862~2868
A sueueing model is developed and analyzed to evaluate the performance of a local and a remote destination of one multicast connection subject to a simple two-level(binary) feedback-based adaptive rate control scheme. The reate control scheme is a simple extension of the one for point-to-point case. Individual cell loss probabilities at the local and remote destinations are obtained to study the fairness of the adaptive rate control scheme. Numerical results show that this simple adaptive rate control scheme, which is fair when it is applied to a multicast connection consisting of destinations with equal propagation delays, bears bias against remote destination.
A proposal for the unified architecture of switches and severs for the efficient processing of multimedia communications and services
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2869~2885
There werer many researches on the switch system for high speed netowrk such as B-ISDN and the server system for the multimedia services respectively. But, in case of simple connection of these two systems, we have to suffer the bottlenck problem of data transmission, and pay the wasteful expenditure because of duplicated architecture of both systems such as interconnecting network at the switch and the server. Therefore, we propse the unified architecture of switehces and servers, which can be used as switches and servers simultaneously. This is based on the hybercube structure. The links are used iterconnection network of switch system, and each node has the subscriber subsystem and the server subsystem. The proposed architecure has the benifits as follows; the easy espansion of capacity due to the scalability,the simple system development and maintenance because of the equivalance of each nodes, the high reliability against the fault of nodes and links due to the existence of the many alternative links between nodes, the easy flow and QoS managment due to the non-blocking data transmission between any two nodes, the flexible adaptation for additional new services owing to simple insertion server board to node. In this paper, we present overal configuration and node component of proposed architecture, and the procesing flow for the various services.
The typd of service and virtual destination node based multicast routing algorithm in ATM network
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2886~2896
The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.
An effective call admission control using virtual path in ATM networks
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2897~2908
This paper presents an effective call admission control algorithm using the Common Pool on the virtual path in ATM networks. Call admission control decides whether or not to accept a new call, so as to ensure the service quality of both individiual existing calls and of the new call itself. In the proposed algorithm, a new call is accepted when the sum of the bandwidths of existing calls and of the new call will not exceed lind capacity. If the sum of their bandwidths exceed link capacity, reserved bandwidth of Common Pool is considreed to accept the new call. Computer simulation results using a simuple network model are algorithm given to evaluate accuracy and call blocking probability by the proposed method.
Performance analysis of OFDM on the multi-path fading channel
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2923~2931
In this paper, the symbol error probability for orthogonal frequency division multiplexing (OFDM) in the multipath fading environment is obtained analytically. In the analysis, OFDM signals with and without the guard interval are considered, and the two-ray fading model is used for the multi-path fading channel. From the analysis results, it is found that the adjacent subchannel interfernce increases the symbol error rate when the guard interval is not employed or shorter than the length of the delay. It is also shown that the adjacent subchannel interference is a Gaussian random variable and its variance depends on the subchannel location and the number of subchannels. Finally, it is found that the variance of the subchannel interference also increases as the power of the signal increases for the OFDM with insufficient guard interval, yieldin an irreducible error at high signal to noise ratio.
Ka-band satellite link design and performance analysis in jamming environment
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2932~2941
Conventional non-regenerative satellite repeaters do not provide anti-jamming capability enough to provide communications between small terminals in jamming environment. In this paper, we analyze the budget and system requirements for Ka-band satellite communication. For the analysis, we modeled and simulated the Ka-band satellite system based on downlink power limited repeater. Assuming that a spread spectrum is applied for anti-jamming purpose, we also analyzed a tolerable jammer-to-signal power ratio under strong up-link jamming in the bit rates of 2.4Kbps and 19.6Kbps.
Intersymbol interference due to sampling-time jitter and its approximations in a raised cosing filtered system
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2942~2953
This paper studies the effect of intersymbol interference due to sampling-time jitter on the worst-case bit error probability in a digital modultation over an additive white Gaussian noise channel, with the squared-root raised-cosine filters in the transmitter and the receiver. It derives approximation formulas using the Taylor series approximations. the principal results of this paper is the relationship between the worst-casse bit error probability, the degree of jitter, the roll factor of the raised cosine filter, and other quantities. Numerical results show, as expected, that the intersymbol interference decreases as the roll-off factor increases and the jitter decreases. They also show that the approximation formulas are accurate for smally intersymbol interference, i.e., for large roll-noise ratio
.leq.7 dB and begin to lose accuracy for larger signal-to-noise ratio.o.o.
A study on the electromagnetic wave properties of the leaky coaxial cable with the finite difference time domain (FDTD) algorithm
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2954~2965
In this paper, the electromagnetic field characteristics of leaky caxial cable are anlyzed by using the finite difference-time domain(FDTD) technique. Finite difference equations of Maxwell's equations are definedin cylindrical coordinate systems. To simulate the open boundary problem like a free space, the Mur's Absorbing Boundary condition(Mur-ABC) is also used. After modeling the leaky coaxial cable with the three dimensional grid structure, the transient response of the field distribution and the current distribution, the field pattern, the coupling effect are depicted in the time domain.
Study on parallel algorithmfor falult simulation
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2966~2977
As design of very large circuits is made possible by rapid development of VLSI technologies, efficient fault simulation is needed. Ingeneral, fault simulation requires many computer resources. As general-purpose multiprocessors become more common and affordable, these seem to be an attractive and effective alternative for fault simulation. Efficient fault simulation of synchronous sequential circuits has been reported to be attainably by using a linear iterative array model for such a circuit, and combining parallel fault simulation with russogate fault simulation. Such fault simulation algorithm is parallelized on a general-purpose multiprocessor with shard memory for acceleration of fault simulation. Through the experimenal study, the effect of the number of processors on speed-up of simulation, processor utilization, and the effect of multiprocessor hardware on simulation performance are studied. Some results for experiments with benchmark circuits are shown.
Design of FM sound synthesizer IC for multimedia with phase bit optimized
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2978~2990
With the advent of multimedia era, there are ever increasing interest in computer music and sound syntheis. An FM type sound synthesizing method makes possible the syntheis ofvarious sounds ofmusical instruments with a relatively simple hardware architecture. Therefore, in this paper, we designed a hardware architecture for real-time sound synthesizer and its logic gates. In this paper, we designed a basic sound generator for implementation of real-time logic gates, analzed characteristics of sounds synthesized in this architecture and extracted parameters of FM sounds of musical instruments by using the Csound software. The major bolkcs to build the hardware are a phase-generator, a singe-function-generator, an envelope-generator and a multiplier-part. Finally, logic circuits are designed and verified in VHDL and logic gates by 1.0um standard cell library, which will be easily implementable by the form of ASIC.
Neural acquisition system of DS/SS communication system using binary neural network
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 2991~3000
In this paper, an effective neural acquisition system is suggested for acquisition of the DS/SS communication system. The suggested system uses a binary neural network which geometrically analyzes and learns a given PN sequence in the binary field. the probabilities of detection and false alarm are obtained and are compared to simulation values. The equation of the mean acquisition time is derived and is compared to the doubledwell time of the serial serial search system. The significant improvement of the performance is demonstrated. As the length of synchronization sequence becomes longer and the number is increased, the performance is improved.
Design of digital DBNN for pattern recoginition
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 3001~3011
In this paper, using DBNN algorithm which is used in the binary pattern classification or speech signal processing the digital DBNN circuit is designed having the variable expansion depending the size of input data and pattern type. The processing elemen(PE) of the proposed network consists of the synapse and MAXNET circuits for the similarity measurement between reference and input pattern. Global MAXNET selects the global winner among the local winners which is selected in each PE. Through the several simultions, and thus each PE and global MAXNET search the reference pattern that was the most simlar to input pattern for the discord of the pattern.
Comression of optical pulse and generation of fundamental soliton byusing fibers which have different dispersion values
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 11, 1996, Pages 3012~3023
In this paper, we analyze the compression of optical soliton which is obtained by proceeding the optical pulse in FSDD(Fiber with Slowly Decreasing Dispersion) using both NSE(Nonlinear Schrodinger Equation) and GNSE(General Nonlinear Schrodinger Equation) and compare the results. We replace the FSDD with a sequence of fibers having different dispersion values and pompre the results with those obtained in FSDD. It is found that the same results in peak value and FWHM(Full width Half Maximum) can be obtained by replacing FSDD with a sequence of fibers having proper length. We vary the shape of initial pulse which is the input of FSDD and suggest the condition to obtain higher compression rate.