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 16, Issue 12 - Dec 1991
Volume 16, Issue 11 - Nov 1991
Volume 16, Issue 10 - Oct 1991
Volume 16, Issue 9 - Sep 1991
Volume 16, Issue 8 - Aug 1991
Volume 16, Issue 7 - Jul 1991
Volume 16, Issue 6 - Jun 1991
Volume 16, Issue 5 - May 1991
Volume 16, Issue 4 - Apr 1991
Volume 16, Issue 3 - Mar 1991
Volume 16, Issue 2 - Feb 1991
Volume 16, Issue 1 - Jan 1991
Selecting the target year
동북아시아에 있어서의 해저 광케이블 구성 전략
The Journal of Korean Institute of Communications and Information Sciences, volume 16, issue 5, 1991, Pages 395~402
Submarine Optical Fiber Cable Link becomes a major transmission madi a in many countries and Continents thanks to development of low attenuation fiber and its capability of carryung broadband data. United States of America and Japan are aggressively planning to construct international submarine optical fiber links in North-East Asia. But the links do not connect Korea and Korea becomes isolated in the international communication network. This paper shows a strategy on submarine optical fibre cable links that make Korea a HUB station in North East As a without heavy investment.
A Study on the Feasibility of Self-Organizing Net for the Pattern Recognition
The Journal of Korean Institute of Communications and Information Sciences, volume 16, issue 5, 1991, Pages 403~412
This paper proposes a type of self organizing neural network which recognizes arbitrary symbols as well as numerical or alphabetic characters. The proposed algorithm autonomically organizes and classifies similar patterns on the basis of the distribution types of characteristics in the input images. Thus it can be appliced for the recognition of arbitrary images when it is difficult to establish a learning rule. It performs a stale recognition process with in the limit of the memory capacity. The cheme was applied and tested to 50 different image patterns with increased noise level up to 44%(SNR 2dB). The implementation results demonstrate that the proposed algorithm successfully recognizes the image patterns changed due to the various noise levels and thus proves excellent antinoise characteristics.
A Study on the Frequency Detection of PRCPM Signals Using the DFE Scheme in Fast Fading Channels
The Journal of Korean Institute of Communications and Information Sciences, volume 16, issue 5, 1991, Pages 413~423
Some digital partical response continuous phase modulation signals such as 3RC, 3SRC, 4SRC, and TFM have cconstant envelope characteristics and compact power spectra. However, their bit error rates in fast fading environments are too high when a simple frequency detection is used. This is due to high inter symbol interference resulting from adjacent bits. The improvement of BER performance by using DFE(Decision Feedback Equalization) to cancel the ISI of one adjacent bit is theoretically investigated in this paper. Numerical resuls are presentes to compare the BER performance of frequency detection with and without decision feedback equalization.
A Study on the Performance of FH/FSK Including Jammer and Code Correlation Effects
The Journal of Korean Institute of Communications and Information Sciences, volume 16, issue 5, 1991, Pages 424~433
In the noncoherent FH/FSK system presence of the multitione jamming and noise, in the case random and 송 structures jamming model, the performance analyzed that random and struetured jamming derived error proability. It is found that error probability and performance when error corecting code used Hamming. BCH, Convolutional code under the worst case partial band jamming interference.
Optimal Design of a 2-D Quadrature Polar Separable Filter
The Journal of Korean Institute of Communications and Information Sciences, volume 16, issue 5, 1991, Pages 434~444
An improved 2-D quadrature polar separable (QPS) filter and its applications to texture processing are discussed in thie paper. The frequency response of the filter consists of two independent parts. The first is a radial weighting function based on the prolate spheridal sequence(PSS). The second is the same orientational function of the angle as in the Knutsson filter. The new filter is suboptimal in the energy loss because we let the polar angle function approximate the radial weighting function as in the 2-D Cartesian filter composed of two PSS's. It is easy to control as it depends only upon the design specification of the bandwidth, the drectional agnle, and the central freqneucy. Also the filter is circularly more symmetric in the frequency domain than the Knutsson filter. In order to estimate the orientation and the frequency component of loca textures in the frequency domain, some applications of the new filter, such as the generation of synthetic textures, the estimation of texture orientations, and texture segementations, are discussed.
Methods of Random Signal Detection with Rank Statistics : Part 2. The Two-Sqample Case
The Journal of Korean Institute of Communications and Information Sciences, volume 16, issue 5, 1991, Pages 445~448
The two-sample locally optimum rank detection scheme is obtained which uses rank and sign statistics for detection of random signals in additive noise. It is shown that the detector is similar in structure to the locally optimum detector for random signals and to the one-sample locally optimum rank detector for random signals. It is also shown that the detector is a generalization of the two-sample locally optimum rank detector for known signals. In addition , the problem of two-sample locally optimum rank detection of random signals in multiple input case is considered briefly.
Calculation of Blocking Probabilities in the Two-dimensional Multi-slot Connection Traffic
The Journal of Korean Institute of Communications and Information Sciences, volume 16, issue 5, 1991, Pages 451~457
Four computational algorithms are discussed and compared in terms of complexity, required memory, and the number of channels which calculate the blocking probabilities in the two-dimensional multi-slot connection traffic. The overflow and underflow problems can be circumvented, and thus blocking probabilities can be calculated even up to 10000 channels, by the proposed last algorithm. This algorithm is utilized in calculating the blocking probabilities for I-slot and 6-slots calls. And the results of the simulation by the SLAM-II are compared with those of the analytic calculation.
Speech Recognition Using Formant Bandwidth Normalization
The Journal of Korean Institute of Communications and Information Sciences, volume 16, issue 5, 1991, Pages 458~467
In this paper, the cause of linear prediction error is analysed and the theoretical basis for nomalizing the format bandwidth to 0is given and its validity is verified. The formant and bandwidth in relation to the position of the poles of AR filter are measured for an alaysis of the relation between the pole position and the formant bandwidth. By changing the glottis reflection coefficient to 1. the pole position and the formant bandwidth. By changing the glottis reflection coefficient to 1. the effect of the glottis is eliminated and as the result a new linear preiction coefficients are obtained by normalizing the formant bandwidth of the signal to 0. since these coefficients are symmetrical, the standard deviation is larger than the coefficients with fixed glottis reflection coefficient. The bit rate for speech coding can be reduced by a factor of 2 without any loss of information. Through computer simulation, recognition rate of 96.7% is botained by using the proposed algorithm in recognizing 5 Korean vowels in noisy environment.
An Algorithm for Construction of Distribution Breadth-First Search Tree Using New Threshold Values
The Journal of Korean Institute of Communications and Information Sciences, volume 16, issue 5, 1991, Pages 468~574
In construction of breadth-frist tree, the communication complexity can be reduced by efficent synchronization schemes based on several threshold values, We determine several new threshold values by considering the graph density represented as lognm, where n and m are the number of nodes and links., repectively. When thesethreshold values are used in the synchroization method for constructing distrbuted bradth-first search tree, we can obtain a more efficient algorithm in sparse graphs, and also, this algorithm has vthe same performance for communication complexity in dense graphs