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 19, Issue 12 - Dec 1994
Volume 19, Issue 11 - Nov 1994
Volume 19, Issue 10 - Oct 1994
Volume 19, Issue 9 - Sep 1994
Volume 19, Issue 8 - Aug 1994
Volume 19, Issue 7 - Jul 1994
Volume 19, Issue 6 - Jun 1994
Volume 19, Issue 5 - May 1994
Volume 19, Issue 4 - Apr 1994
Volume 19, Issue 3 - Mar 1994
Volume 19, Issue 2 - Feb 1994
Volume 19, Issue 1 - Jan 1994
Selecting the target year
Digital Filter Design using the Symbol Pulse Invariant Transformation
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 1~9
In general, when IIR digital filter are designed from analog filters, the bilinera transformation and the impluse invariant tramsformation are commonly used. It is known, however, that high frequency response of digital filters designed by these transformations can not be well approximated to the sampled analog signals. In this paper, the symbol pulse invariant transformation is analyzed theoretically so that the symbol pulse invariant transformation which was originally application to a rectangular pulse is newly applied to double rate pulse signals and generic shape pulse signals. Also, the relation of spectra between a transfer function of digital filter and one of analog filter is considered. Further, we apply to design the digital high pass filters using the symbol pulse invariant transformation method.
A Study on the Concatenation System of Compression Coding and Secrecy Coding for Digital Signature in On-Line Transmission
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 10~23
To transmit information efficiently and securely in On-line transmission, data compression, secrecy and authentication are required. In this paper, we propose LZWH4 which creates two compression strings with applying Hnageul to LZW. design HDES1 by extending S-box (S1-S16) which satsfies SAC and correlation coefficient as a partial countermeasure of Differential Cryptanalysis and implement LZWHDES1 which concatenates efficiently these for digital signature in On-line transmission. Also HDES1 is more in U.D.(Unicity Distance) than DES and HDES. We show that the proposed LZWHDES1 reduces processing times than LZWHDES which LZW is directly concatnated to DES and LZWHDES which LZWH1 is directly concatenated to HDES. LZWHDES1 can be used to digital signature system as conventional key cryptosystem.
A Reliable Distributed Shortest Path Routing Algorithm for Computer Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 24~34
In most computer networks, each node needs to have correct routing information for finding shortest paths to forward data packets. In a distributed environment, however, it is very difficult to keep consistent routing information throughout the whole network at all times. The presence of out-dated routing information can cause loop-forming which in turn causes the significant degradation of network performance. In this paper, a new class of routing algorithm for loop detection and resolution is discussed. The proposed algorithm is based on the distributed Bellman-Ford algorithm which is popularly adopted for routing in computer network. The proposed algorithm detects and resolves all kinds( two-node and multi-node) of loop in a distributed environment within finite time while maintaining the simplicity of the distributed Bellman-Ford algorithm.
The Performance analysis of DS/SS Acquisition System over Rician Fading Channels
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 35~46
In this paper, the performance of DS/SS acquisition system over frequency nonselective Rician fading channel is analyzed by means of packet loss probability. The power ratio of the fading component to the specular compnent. seccessive constant fadong chips k. and correlation coefficient among k chipe are taken for channel parameters. The false alarm probabilities and detection probabilities are derived, and packet loss probability is evaluated in terms of these probablities in the stats transition diagram. From the results of the performance test, these exists the region of packet loss probability in crease because of autocorrelation sidelobe. As k increases, the packet loss probabolotoes decrease.
Performance Analysis of the Packet DS/SS Receiver using the BSP Methods
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 47~55
This paper investigates the performance analysis of the packet DS/SS receiver with a PJED(phase-jump error detector) using the block signal processing(BSP) methods. The conventional packet DS/SS block receiver has a high probability of mistaking the phase-jump detection, which causes the frequency estimation error. The conventional receiver uses a Matched-Pulse Timing Extractor which has a complicated structure. The proposed packet DS/SS block receiver with the PJED which uses libearity of the phase has little probability of mistaking the phase-jump detection. The proposed Matched Pulse Timing Extractor gas the more simple structure but obtains the same performance on the exact matched-pluse timing as the conventional one does. The simulation results show that the proposed receiver gives about 2dB improvement in the BER compared with the conventional receiver.
A Study on PBS Mechanism with Two-Threshold in ATM Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 56~65
As a method to control the congestion, priority mechanism which gives two-level priority to various traffics using CLP bit in cell haeder is carried in ATM network. In this paper, we proposed PBS(partial buffer sharing) mechanism with two threshold for provide three-level priority using CLP bit and Res. bit. By performance analysis proposed mechanism, we knew that provides flexibility to satisfy requirements of various quality of service, compare to existing mechanism with two-level priority.
A Routing Algorithm for Minimizing Packet Loss Rate in High-Speed Packet-Switched Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 66~74
Gradient projection (GP) technique is applied for solving the optical routing problem (ORP) in high speed packet switched networks. The ORP minimizing average network packet loss probability is non-convex due to packet losses at intermediate switching nodes and its routing solution cannot be directly sought by the GP algorithm. Thus the non-convex ORP is transformed into a convex problem called the reduced-ORP (R-ORP) for which the GP algorithm can be used to obtain a routing solution. Through simulations, the routing solution of the R-ORP is shown to be a good approximation to that of the original ORP. Theoretical upper bound of difference between two (ORP and R-ORP) routing solutions is also derived.
A Study on the Design of Contunous-Time GYRATOR Filter for VLSI
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 83~90
In this paper, the GYRATOR circuit is designed by the highly linear MOS transconductor with the gain factor controllable by offset voltage, and the floating inductor, the floating resistor and the grounded resistor are simulated by the GYTATOR for VLSI. And for the design exmple, Butterworth filter is designed using this GYRATOR, and is conpensated by the frequency transformation for the frequency shift that due to non-ideal output impedance of transconductor.
Regularized Iterative Image Restoration with Relaxation Parameter
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 91~99
We proposed the regularized iterative restoration method considering relaxation parameter and regularization paramenter in order to restore the noisy motion-blurred images. We used (i-H) as a regularization operator and these two kinds of constraints were applied while conventional regularization iterative restoration method proposed by Jan Biemond et al used the 2-D Laplacian filter and a predetermined regularization parameter value and relaxation parameter to 1. Through the experimental results, we showed better results compared with those by a conventional method and or regularized iterative restoration method just considering only a regularization parameter. These two kinds of constratints have good effects when applied into the regularized iterative restoration method for noisy motion-blurred images.
A Study on the Characteristics of Monolithic Laser-Waveguide Coupler by BPM
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 100~110
In this paper, we present a new analysis of monolithic laser-waveguide coupling structure employing the beam propagation method. Monolithic laser-waveguide coupler has both passive and active components It has too many parameters to consider for an analysis. So we present proper model of coupler by use of directional coupler. We employ the beam propagation method th analyze the proposed structure, we could employ the coupled mode theory but we thought in the case of this paper the beam propagation method is more appropriate than coupler mode theorybecause a number of variables which to consider is too many for the coupled mode theory. Also we use finite difference method to calcurate trial field which is a starting point of beam propagation analysis. Through this approach, we can consider more parameters. And we propose a new structure of monolothic laser-waveguide coupler which has taper structure between the distance in which coupling is taking place and passive waveguide. We can obtain 79% high coupling efficiency from our structure.
Reversible Image Coding with Progressive Build-up
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 111~119
In this paper we propose a reversible image coding methods with progressive build-up function by bit-plane of multi-lavel image. Firstly, the differencial conversion is applied to reduce the entropy of source images. Then the bit-plane sequences of converted images are coded by means of the newly designed VFRL(Variable to Fixed Run-Llength) code and the RDHC(Run-length Dynamic Huffman Coding). We aim to the simple construction to reduce the complexity. The computer simulated results show that the proposed methods are very effective to the multi-level digital images. For "GIRL" and "COUPLE" of 1EEE monochromatic standard images, the compressibility are superior to the results obtained by the well-known universal codes.own universal codes.
A Technique of Measuring Leadwire-Site for Automatic Leadwire Cutting Machines
;Seiichi Noguchi;Koei Igarashi;
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 120~130
The leadwire cutting machine that has been used recently cuts leadwires by putting one-side force with the same priciple as a saw, and applies a stress at soldered part of PCB. Because the stress becomes one cause of contact-defect, a leadwire cutting robot that cuts leadwire-site with nipper and does not apply stress is considered, In this paper a technique of detecting leadwire-site is studied for the purpose of using on automatic leadwire cutting robots. A technique deriving 2-dimensional site-information with many I-dimensional binary data of perspective front-view of PCB taken from various direction was proposed. Simulation and experiments were done under the same condition each other and a small universal PCB was choosen as an experimental object. As a result of simulations and experiments, the proposed technique turns out to be very useful for automatic leadwire cutting robots.
Analysis of Quadratically Filtered Gradient Algorithm with Application to Channel Equalization
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 131~142
This paper analyzes the properties of such algorithm that corresponds to the nonlinear adaptive algorithm with additional update terns, parameterized by the scalar factors
. The analysis of concergence leads to eigenvalues of the transition matrix for the mean filter coefficient vector. Regions in which the algorithm becomes stable are demonstrated. The time constant is derived and the computational complexity of the QFG algorithm is compared with those of the conventional LMS. sign, and LFG algorithm. The properties of convergence in the mean square error is derived and the neccessary condition for the CFG algorithm to be stable is attaned. In the computer simulation a channel equalization is utilized to demonstrate the performance feature of the QFG algorithm. The QFG algorithm has the more computational complexities but the faster convergence speed than LMS and LFG algorithm. Since the QFG algorithm has smoother convergence, it may be useful in case where error bursting is a problem.
A Design Methodology of the MSIB(Message Store Information Base) for EDI-MS(EDI-Message Store) Using Object-Relation Mapping Function
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 143~158
X.435 is the EDI communication protocol published by CCITT and ISO/IEC in 1990. The message types and abstract services of EDI-MS are specified in X.435 recommendation. In this paper, the design methodology on implementation of MSIB in the case that MHS-MS is required to be extended into EDI-MS has been studied. The design methodology presented in this paper is the one using the mapping function of the object relation. This methodology considers the EDI message types and characterictics. The proposed design methodology han an advantage that is able to design the component tables of MSIB satisfying the third normal form and it does not require the normalization processing. The MSIB constructed by the proposed method can store and retrieve multi-values efficiently.
A WDM Based Multichannel All-Optical Ring Network
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 159~169
A multichannel optical slotted ring network is designed using a wavelength division multiplexing(WDM) technique and photonic packet switching devices. The electronics speed bottleneck is removed out of the ring, which allows utilization of the full bandwidth for the optical fiber transmission medium. The ring channel adopts a slotted ring concept with a destination cell remove strategy for the eing access mechanism. The slot size in the ring is selected as the same as that of ATM based cell in order to be used as B-ISDN Access Networks. In this paper, we devised a mathematical method to measure the average transfer delay characteristics of the network. The analytical method turned out to yield accurate results over a broad range of parameters in comparison to simulation results. From the study, we observed the average transfer delay of the network as the network parameters vary.
A Study on the Design of Network Management Architecture based on TMN Concept
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 170~182
With the evolution of telecommunications network, the operational enviroments of a morden telecommunication network are becoming more complex and diverse. Therefore. the design of NMA( Network Management Aechitecture) that pursues standardization and openness in order to accommodatae them actively will be required. In such a network environment which composes various and heterogeneous network elements, it is not easy to surpport efficiently TMN MSs(Management Services) because it has lack of interoperability among them. This paper proposes a top-down approach being taken to design a network management architecture with establishing the hierarchical relationships of management services based on ITU-TS(Telecommunication Standardization in Europe) TMN concept, and allocating MSC(Management Service Component) by TMN management layer, and analyzing the information flow between FAs(Functional Areas).
control of a Flexible Robot Manipulator
The Journal of Korean Institute of Communications and Information Sciences, volume 19, issue 1, 1994, Pages 183~193
The dynamic equation of a flexible robot manipulator is formulated by the assumed-mode method and the Lagrange equation. The controller is designed for a flexible robot manipulator including a joint actuator. The controller consists of a parmaeter estimator and the adaptive controller. A parameter estimator evaluates ARMA model`s parameter using RLS algorithm. An adaptive controller is designed based on a reference model and a minimum prediction error controller.