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
An image sequence coding using motion-compensated transform technique based on the sub-band decomposition
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 1~16
In this paper, by combining the motion compensated transform coding with the sub-band decomposition technique, we present a motion compensated sub-band coding technique(MCSBC) for image sequence coding. Several problems related to the MCSBC, such as a scheme for motion compensation in each sub-band and the efficient VWL coding of the DCT coefficients in each sub-band are discussed. For an efficient coding, the motion estimation and compensation is performed only on the LL sub-band, but the discrete cosine transform(DCT) is employed to encode all sub-bands in our approach. Then, the transform coefficients in each sub-band are scanned in a different manner depending on the energy distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distribution of each sub-band. The performance of the proposed MCSBC technique is intensively examined by computer simulations on the HDTV image sequences. The simulation results reveal that the proposed MCSBC technique outperforms other coding techniques, especially the well-known motion compensated transform coding technique by about 1.5dB, in terms of the average peak signal to noise ratio.
2-D MMFF Model and Performance Analysis of 2-layer coded Video Traffic Sources
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 17~32
In this paper, a model for two-layered video traffic is proposed. The performance analysis of the proposed model and the effects of two-layer coding scehemes in ATM networks are also studied. ATM-based networks give the possibility to support image codingat variable bit rate(VBR). Two layer coding is one of the very promising methods among many proposed methods to compensate the cell loss, the major drawback in ATM networks. From the experimental data of the 2-layer coded video traffics, it is observed that traffic patterns of base layer and enhanced layer are highly correlate to each other, when constant image quality is kept. With this observation, coded two layered video traffic can be modeled as 2-dimensional Markov chain. The model well fit the real experimental data. The model was used for the analysis of the performance of statistical multiplexer with priorites in ATM networks.
On the Hybrid Prediction Pyramid Compatible Coding Technique
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 33~46
Inthis paper, we investigate the compatible coding technique, which receives much interest ever since the introduction of HDTV. First, attempts have been made to analyze the theoretical transform coding gains for various hierarchical decomposition techniques, namely subband, pyramid and DCT-based decomposition techniques. It is shown that the spatical domain techniques proide higher transform coding gains than the DCT-based coding technique. Secondly, we compare the performance of these spatial domain techniques, in terms of the PSNR versus various rate allocations to each layer. Based on these analyses, it is believed that the pyramid decomposition is more appropriate for the compatible coding. Also in this paper, we propose a hybrid prediction pyramid coding technique, by combining the spatio-temporal prediction in MPEG-2 and the adaptive MC(Motion Compensation). In the proposed coding technigue, we also employ an adaptive DCT coefficient scanning technique to exploit the direction information of the 2nd-layer signal. Through computer simulations, the proposed hybrid prediction with adaptive scanning technuque shows the PSNR improvement, by about 0.46-1.78dB at low 1st-layer rate(about 0.1bpp) over the adaptive MC, and by about 0.33-0.63dB at high 1st-layer rate (about 0.32-0.43bpp) over the spatio-temporal prediction.
The Color Enhancement of TV Picture by the Color Measurement of Illumination
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 47~58
An object color can be seen differently under the various outer illuminants. However, human visual system has color constnacy that the object color can be seen constantly under the different outer illuminants. When the viewer watches TV under specific that the object color can be seen constantly under the different outer illuminants. When the viewer bathes TV under specific outer illuminants, he perceives distortes color due to the emitting specturm of outer illuminants as well as the radiation of CPT itself. Namely, when the outer illuminants such as fluorescent and incandescent lamps incident on CPT, brightness, saturation, hue, itself. Namely, when the outer iluminants such as fluorescent and incandescent lamps incident on CPT, brightness, saturation, hue, and contrast on color pictures are changend, he perceives distortedcolr fromthe original color. In this paper color enhancement algorithm based on light intensity and outer light decision funtion using RGB sensor was proposed. The implemented TV of proposed algorithm has higher visual quality at the view point of human visual system and more vivid than that ofcoventional color TV.
A Compensation Algorithm for Generalized Sidelobe Canceller in the Presence of Faulty Elements
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 59~66
In this paper, we present a new effective algorithm for element failure compensation of Generalized Sidelobe Canceller (GSC). While the GSC is well formulated, little works have been done on array element compensation in the presence of faulty elements. Element failure changes the problem of a linearly equally spaced array into that of an unequally spaced array. Typical research approaches have been directed at using search techniques to optimize unequally spaced arrays. The proposed algorithm matches the linear constraint conditions and the general shape of the desired beam pattern at the expense of an increase of beam-width in the overall main lobe. Numerical results are included to demonstrate the capability of compensation for various situations.
Design of a digital filter with variable characteristics for a luminance signal processing of digirtal TV
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 67~79
This paper presents a composite luminance signal processing system for NTSC, PAL and SECAM standards. Eaxh of the three standards employs its own specifications of subcarmier bandwidth and luminance signal waveform. The proposed system, compatible to the specifications of the three standard and B/W TV, implements variable freqneucy characteristics by controlling filter coefficients. The major features of the system are a luminance/chroma separation unit and an aperture compensation unit. The luminance/chroma separation unit employes a notch filter selection a trap freqneyc to atenuate unwanted color signals in luminance signal bands. The aperture compensation unit comprises two subunits, to provide clear color definition for each of the three standards: a primary compensation circuit and a variable compensation circuits. The proposed system yields a 40 dB gain from the chroma/luminance separation and a 10 dB gain from the aperture compensation unit.
The structure of ATM Switch with the Shared Buffer Memory and The Construction of Switching Network for Large Capacity ATM
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 80~90
The efficienty of ATM is based on the statical multiplexing of fixed-length packets, which are called cells. The most important technical point for realizing ATM switching network is an arrangement of the buffers and switches. Current most ATM switching networks are being achieved by using the switching modules based on the unit switch of
150Mb/s, the unit switch of
150Mb/s for a large scale system is under study in many countries. In this paper, we proposed a new
(4.9Gb/s throughput) ATM switch using Shared buffer memory switch which provides superior traffic characteristics in the cell loss, delay and throughput performance and easy LSI(Large Scale Integrated circuit). We analytically estimated and simulated by computer the buffer size into it. We also proposed the configuration of the large capacity ATM switching network(
.M>1,000) consisting of multistage to improve the link speed by non-blocking.
Multicast Routing Algorithm for Multimedia Transmission in an ATM Network
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 91~102
The multicast routing algorithm is necessary to transmit multimedia traffic efficiently in ATM (asynchronous transfer mode) networks. In this paper, we propose the multicast routing algorithm which is based on VP/VC characteristic. The proposed algorithm is based on VP tree concept and using cost function which is based on VP/VC switching. The cost funication is composed of link cost, delay and weighting factor on delay and the weighting factor is calculated by delay sensitivity of the traffic. The proposed algorithm can choose delay bounded path which satisfies delay constraint, moreover it can choose optimal path among VPs which has the same link cost and satisfying delay constraint. With controlling weighting factor, proposed algorithm can set-up efficient path. When the weighting factor sets to be between 0.8 and 1, experimental results show that the perforance of proposed scheme is approximated to that of cost optimal algorithm and strongly delay optimized algorithm.
A Traffic Distribution Scheme for Connectionless Data Service using Multi-Path in ATM Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 103~118
With the advent of B-ISDN based on ATM technonlogy, ther are increasing needs for the interconnection of existing LAN/MAN's through ATM networks. ATM networks, therefore, must provide connectionless service. In this paper, the traffic distributio scheme using multi-path is proposed to support efficient connectionless service in ATM networks. Because the proposed scheme distributed the bursty traffic arrived in the interworking unit (IWU) and the connectionless server (CLS) from LAN-terminals, it alleviates the packet loss ratio caused by buffer overflow at IWU/CLS and is able to use nettowrk resources efficiently according to the network conditions and the amount of the traffic arrived at IWU/CLS. This paper presents the distribution algorithm and the IWU/CLS, CLS-CLS closed-loop rate control scheme.
The Structure and The Implementation of Fully Interconnected ATM Switch (Part I : About The Structure and The Performance Evaluation)
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 119~130
This paper is the part I of the full study about improved structure of fully interconnected ATM switch to develop the small sized switch element and practical implemention of switch network. This part I paper describes about proposed switch structure, performance evaluations and some of considerations to practical implementation. The proposed structure is constructed of two step buffering scheme in a filtered multiplexer. First step buffering is carried out by small sized dedicated buffers located at each input port. And second step buffering is provided by a large sized common buffer at the output port. To control bursty traffic, we use speed up factor in multiplexing and priority polling according to the levels of buffer occupancy. Proposed structure was evaluated by computer simulation with two evaluation points. One is comparision of multiplexing discipline between hub polling and priority polling. The ogher is overall which should be considered to improve the practical implementation.
Structure and Implementation of Fully Interconnected ATM Switch (Part II : About the implementation of ASIC for Switching Element and Interconnected Network of Switch)
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 131~143
In this paper, we propose the improved structure of fully interconnected ATM Switch to develop the small sized switch element and represent practical implementation of switch network. As the part II of the full study about structure and implementation of fully interconnected ATM Switch, this paper especially describes the implementation of an ATM switching element with 8 input port and 8 output port at 155 Mbits/sec each. The single board switching element is used as a basic switching block in a small sized ATm switch for ATM LAN Hub and customer access node. This switch has dedicated bus in 12 bit width(8 bit data + 4 bit control signal) at each input and output port, bit addressing and cell filtering scheme. In this paper, we propose a practical switch architecture with fully interconnected buses to implement a small-sized switch and to provide multicast function withoutany difficulty. The design of switching element has become feasible using advanced CMOS technology and Embedded Gate Array technology. And, we also represent Application Specific Integrated Circuit(ASIC) of Switch Output Multiplexing Unit(SOMU) and 12 layered Printed Circuit Board for interconnection network of switch.
VLSI-Implementation of the Virtual Scheduling Algorithm
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 144~154
Proposed numerous algorithms for the policing function have mainly focused on their performances. Besides their performance evaluation, however, the VLSI-implementation of these algorithms is worth consideration as well. Although, no algorithms for the policing function have been standardized up to now, ITU-T I.371 suggests two examples of algorithms, the Virtual Scheduling Algorithm (VSA) and the Continuous State Leaky Bucket algorithm. In this paper, we suggest the architecture of a policing device implementing the VSA among various algorithms for the peak cell rate policing and discuss some issues on the implementation. We also present how to select the policing modes of the two devices used to realize various policing schemes and show the experimental results obtained under four different peak cell rate values to confirm that the device performs the policing function satisfactorily. We exploit the priority encoder to run the algorithm in parallel instead of sequentially, which reduces the operation time to a great extent.
Performance Characteristics of Some Signal Detectors in Weakly Dependent Noise
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 155~160
In this paper, we consider the discrete-time known signal detection problem under the presence of additive noise exhibiting weak dependence. We derive the locally optimum, memoryless, and one-memory detector test statistics under a seakly dependent noise model. The performance characteristics of the one-memory detector can achieve almost optimum performance at the expense of only one memory unit under the weakly dependent noise model.
Performance Analysis of Maximum-Likelihood Code Acquisition Technique for Preamble Search in CDMA Reverse Link
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 161~174
Addressed in this paper is performance analysis of the maximum-likelihood code acquisition technique for slotted-mode preamble search in the CDMA reverse link. The probabilities of detection, miss, and false alarm are derived analytically for a multiple
cell case in a frequency-selective Rayleigh fading channel, based on the statics of the CDMA noncoherent demodulator output. the probability density function of the decision variable consisting of successive demodulator outputs is also derived by considering the fading characteristics of the received signal for both single and dual antenna cases. The performance of the code acquisition technique is evaluated numerically with an emphasis on investigating the effects of post-detection integration, fading rate, and antenna diversity on the detection performance.
Channel Input-Traffic Control of FH/SSMA Systems with a Centralized Controller
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 175~186
An optimal channel input-traffic control (OCIC) policy is proposed for slotted frequency-hopped spread-spectrum multiple access communication systems. When the number of channel input packets is set to the optimal number, the conditional throughput for the OCIC policy is analyzed. The state transition probability is derived, the steady state performance is analyzed, and the mean pracket delay is obtained. It is shown that the mean packet delay decreases considerably when the priority of transmission is given to backlogged users. The smaller is the number of requency slots, the larger are the differences between the preformance of the OCIC policy and that of the other policies.
Supersate Transition Matrix for the Generalized Transfer Function Method
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 187~195
The purpose of this paper is to provide an algorithm in which the procedure of constructing a superstate transition matrix for trellis codes is reduced and, as a result, make it easier to evaluate the performance of a TCM scheme when the generalized transfer function method is used. In this paper, an algorithm for constructing a superstate transition matrix and an algorithm for reducing the matrix easily are addressed and applied to an MTCM scheme as an example. It is shown that the algorithm is very useflul for trellis codes with a large number of states and/or parallel transitions.
A New Cost Calculation Scheme for the Service Allocation to Transponders in the Satellite Communication Systems
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 196~205
Severice allocation to satellite transponders under consideration of interference caused by inter-satellite and intra-satellite systems is one of the most important issue in terms of optimal usage of satellite network resource. In this paper, we present a new and show several simulation results to verify the proposed method. Especially, our concerns are concentrated on the cost (interference) matrix which is believed to be optimal in obtaining the service allocation plan. The method and concepts presented in this paper may be well applicable to making a plan for service assignment of the satellite communication systems.
Analysis of Microstrip Line on Anisotropic Substrate in the Spectral Domain
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 206~213
The spectral-domain methos has been applied to an analysis of a open microstrip line on a dielectrically biaxial anisotropic substrate which takes into account both weak and tight anisotropy effect, which are very important in high-requency applications such as optical modulator, MMIC, etc.. Numerical results of propagation characteristics are validated against the data previously published for special dielectrically weak anisotropic cases(sapphire, Epsilam-10) and New data are calculated for dielectrically tight anisotropic case(LiNb
). Data are for these anisotropic substrates presented to illustrate the effect of three different orientations of the principle dielectric axes. It can be derived from the calculated data in this paper that component of dielectric tensor(.epsilon.
) in y-axis which is normal to microstrip-laid plane is important factor in propagation characteristics.
A Spectral Inverse Scattering Technique by Using the Moment Method with Series-Expanded Basis Function : Noise Effect
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 214~223
Noise effects on image profiles reconstructed by the spectral inverse scattering technique is studied based on moment method with series-expanded basis function. It is found that the Fourier series expansion to the field distribution and the averaging of the reconstructed profile in each enlarged cell provides an effective tool for the reduction of noise effects.
The Effects of Cache Memory on the System Bus Traffic
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 224~240
It is common sense for at least one or more levels of cache memory to be used in these day's computer systems. In this paper, the impact of the internal cache memory organization on the performance of the computer is investigated by using a simulator program, which is wirtten by authors and run on SUN SPARC workstation, with several real execution, with several real execution trace files. 280 cache organizations have been simulated using n-way set associative mapping and LRU(Least Recently Used) replacement algorithm with write allocation policy. As a result, 16-way setassociative cache is the best configuration, and when we select 256KB cache memory and 64 byte line size, the bus traffic ratio was decreased compared to that of the noncache system so that a single bus could support almost 7 processors without any delay and degradationof high ratio(hit ratio was 99.21%). The smaller the line size we choose, the little lower hit ratio we can get, but the more processors can be supported by a single bus(maximum 18 processors). Therefore, using a proper cache memory organization can make a single bus structure be able to support multiple processors without any performance degradation.
A Single-Chip Design of Two-Dimensional Digital Riler with CSD Coefficients
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 241~250
In this work, an improved architecture of two-dimensional digital filter(2D DF) is suggested, and then the filter is simulated by C, VHDL language and related layouts are designed by Berkeley CAD tools. The 2D DF consists of one-dimensional digital filters and delay lines. For one-dimensional digital filter(1D DF) case, once filter coefficients are represented by canonical signed digit formats, multiplications are exected by hardwired-shifting methods. The related bit numbers are handled to prevent picture quality degradation and pipelined adder architectures are adopted in each tap and output stage to speed up the filter. For delay line case, line-sharing DRAM is adopted to improve power dissipation and speed. The filter layout is designed by semi/full custom methods considering regularity and speed improvement, and normal operation is confirmed by simulation.
Nonlinear Function Approximation Using Efficient Higher-order Feedforward Neural Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 251~268
In this paper, a higher-order feedforward neural network called ridge polynomial network (RPN) which shows good approximation capability for nonlnear continuous functions defined on compact subsets in multi-dimensional Euclidean spaces, is presented. This network provides more efficient and regular structure as compared to ordinary higher-order feedforward networks based on Gabor-Kolmogrov polynomial expansions, while maintating their fast learning property. the ridge polynomial network is a generalization of the pi-sigma network (PSN) and uses a specialform of ridge polynomials. It is shown that any multivariate polynomial can be exactly represented in this form, and thus realized by a RPN. The approximation capability of the RPNs for arbitrary continuous functions is shown by this representation theorem and the classical weierstrass polynomial approximation theorem. The RPN provides a natural mechanism for incremental function approximation based on learning algorithm of the PSN. Simulation results on several applications such as multivariate function approximation and pattern classification assert nonlinear approximation capability of the RPN.
Symbolic Substitution Based on Optical Correlator for Optical Parallel Addition with Redundant Binary Number
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 269~280
We proposed a symbolic substitution method based on an optical correlator for an optical parallel addition. In the proposed symbolic substitution method, we used redundant binary number of the symbolic substitution rules as a number system and chose MAC3E filter which had very low sidelobes and good correlation peak compared with SDF filter as the optical correlation filter. We encoeded input numbers property to increase the discrimination capability and divided inpt patterns into 5 groups of the same addition results to minimize the number of symbolic substitution rules. Through the computer simulation, we confirmed the proposed method was suitable to implement the optical parallel adder.
OFDM Star Network Based on Carrier Distribution
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 281~290
In this paper we suggest an OFDM star network based on carrier distribution and homodyne detection in which all optical carriers generated and stabilized in a specific node are distributed to each node. We studied ASK and PSK modulation schemes and calculated rspective SNRs and BERs for this network. We also discussed on the optical power requirement on the light sources for 200 Mb/s transmission speed. As a result, we found tht ASK and PSK respectively require 13 dBm and 10 dBm for 32 nodes and the nmber of nodes can be expanded to 73 with only 0 dBm of power and minimum insertion losses of components. The proposed network is more reliable than the conventional ones due to the centralized carrier maintenance andthe network is suitable for the adverse environment of the nodes.
Neural Identifier of a Two Joint Robot Manipulator
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 1, 1996, Pages 291~299
A new identification method using a higher order multilayer neural network is proposed for identifying a complex dynamic system such as a robotic manipulator. The input torque data for learning of the neural identifier are generated for producing effective output trajectories by a minimization process of a specific performance index function which indicates the difference between the reference points and the present joint positions and their velocities of the robotic manipulator. Computer simulation results show that the proposed identification method is very effective for identifying the systems with complex dynamics and large moment of inertia.