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 22, Issue 12 - Dec 1997
Volume 22, Issue 11 - Nov 1997
Volume 22, Issue 10 - Oct 1997
Volume 22, Issue 9 - Sep 1997
Volume 22, Issue 8 - Aug 1997
Volume 22, Issue 7 - Jul 1997
Volume 22, Issue 6 - Jun 1997
Volume 22, Issue 5 - May 1997
Volume 22, Issue 4 - Apr 1997
Volume 22, Issue 3 - Mar 1997
Volume 22, Issue 2 - Feb 1997
Volume 22, Issue 1 - Jan 1997
Selecting the target year
Design of 950~2150MHz tunable bandpass ilter by cascading low and high pass filters
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1385~1393
In this paper, a systematic design method of brjoadband tunable bandpass filter is presented by using user defined varactor diode method. The tunable bandpass filter is constructed as the cascade connection of low pass filter and high pass filter. The designed filter shows the characteristeristics of 2.7.+-.0.2dB insertion loss and 37.1.+-.5.0dB insertion loss and 32.1.+-.2.2dB image rejection. The results of the research can be used fodr the broadband tunable filter of DBS tuner and communication instruments.
Design and implementation of improved march test algorithm for embedded meories
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1394~1402
In this work, an efficient test algorithm and BIST architeture a for embedded memories are presented. The proposed test algorithm can fully detect stuck-at fault, transition fault, coupling fault. Moreover, the proposed test algorithm can detect nighborhood pattern sensitive fault which could not be detected in previous march test algoarithms. The proposed test algorithm perposed test algorithm performs testing for neghborhood pattern sensitive fault using backgroung data which has been used word-oriented memory testing.
ASIC design of high speed CAM for connectionless server of ATM network
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1403~1410
Because streaming mode connection server suitable to wide area ATM networks performs transmission, reception and lookup with time restriction for the transmission time of a cell, it has demerits of large cell loss incase that burst traffic occurs. Therefore, in this paper to decrease cell loss we propose a high speed CAM (Content Addressable Memory) which is capable of processing data of streaming mode connections server at a high speed. the proposed CAM is applied to forwarding table VPC map which performs function to output connection numbers about input VPI(Virtual Path Identifier)/VCI(Virtual Channel Identifier). The designed high speed CAM consist of DBL(Dual Bit Line) CAM structure performed independently write operation and match operation and two-port SRAM structure. Also, its simulation verification and full-custom layout is performed by Hspice and Composs tools in 0.8 .
m design rule.
Statistical analysis of decision threshold for DS-SS parallel acquisition with reference filter in a rician fading channel
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1411~1418
This paper presents a statistical analysis of the decision throeshold for derect-sequence spread-spectrum (DS-SS) prallel Pseudo-Noise (PN) code acquistion with a reference filter. The probabilities of detection and false alarm are derived, and the mean acquistion time is evaluated as a measure of the system performance in both nonfading and Rician fiding channels. From the statistical sresults, it is shown that in the performance analysis of the parallel acquisition system with reference filtering, the statistical evaluaion of the decision threshold seems more appropriate than the approximation of the decision threshold adopted in the other schemes[2,3].
A new syndrome check error estimation algorithm and its concatenated coding for wireless communication
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1419~1426
A new SCEE(Syndrome Check Error Estimation) decoding method for convolutional code and concatenated SCEE/RS (Reed-Solomon) conding scheme are proposed. First, we describe the operation of the decoding steps in the proposed algorithm. Then deterministic values on the decoding operation are drived when some combination of predecoder-reencoder is used. Computer simulation results show that the compuatational complexity of the proposed SCEE decoder is significantly reduced compared to that of conventional Viterbi-decoder without degratation of the
performance. Also, the concatenated SCEE/RS decoder has almost the same complexity of a RS decoder and its coding gain is higher than that of soft decision Viterbi or RS decoder respectively.
A turbo code with reduced decoding delay
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1427~1436
Turbo codes, decoded through an iterative decoding algorithm, habe recently been shown to yidel remarkable coding gains close to theoretical limits in the Gaussian channel environment. This thesis presents the performance of Turbo code through the computer simulation. The performance of modified Turbo code is compared to that of the conventional Turbo codes. The modified Turbo code reduces the time delay in decoding with minimal effect to the performance for voice transmission sytems. To achieve the same performance, random interleaver the size of which is no less than the square root of the original one should be used. Also, the modified Turbo code is applied to MC-CDMA system, and its performance is analyzed under the Rayleigh Fading channel environment. In Rayleigh fading channel environment, due to the amplitude distortion caused by fading, the interleaver of the size twice no less than that in the Gaussian channel enironment was required. In overall, the modified Turbo code maintained the performance of the conventional Turbo code while the time delay in transmission and decoding was reduced at the rate of multiples of two times the squared root of the interleaver size.
Analysis of network architectures and control procedures for distributed personal communication services
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1437~1447
This paper proposes a cluster-based PCS(Personal Communication Services) network architecture to support increased signaling and control traffic. The procedures are presented to serve the mjobility management and the efficient procesing of the call-control functional using distributed servers. Especially when call-setups are made within a cluster, this distributed servers. Especially when call-setup time and the amount of control traffic of H-HLS (High level Home Location Server) in the network as L-HLS(Low lever Home Location Server) serves the call on behalf of H-HLS. Performance and reliability of the architecture have been also cairried out.
Bit error probability and channel capacity in the return link of GLOBALSTAR-A CDMA LEO mobile satellite system
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1448~1458
In this paper the reverse link of the GLOBALSTAR-the representative CDMA LEO satellite system and LEO mobile satellite channel are developed by the SPW software simulation tool. And the performance of the system is evaluated. GLOBALSTAR is designed to give cellular-type service to hand-held user terminals through a constellation of 48 LEO satellites in circular orbites with 1414 Km altitude. Since LEO mobile satellite system communicates with mobile unit, it is suffered from severe multipath fading and shadowing. The fast mobility of LEO satellites makes the channel condition time vering. So, the LEO mobile satellite channel is different from land mobile channels. In this unique LEO satellite channel, it is shown that the performance of the GLOBALSTAR reverse link is varied according to the elevational angle, but this variation is overcome by satellite path diversity.
The radiation pattern calculation of the electromagnetically coupled microstrip dipole array antenna using the FDTD method
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1459~1467
The current on the thin planar structure as an element of the transversely fed electromagnetically coupled(EMC) microstrip dipole array antenna is obtained by using the integral forms of the finite difference time domain(FDTD) method. This method was applied to calculating the optimum current distribution (Doplh-Tchebyscheff distribution) of each dipole element on the feed line as a function of their offset positions for the narrow main beam width and the side beam level below -20 dB. The current on each dipole substitutes for the electric and magnetic current densities on the virtual surface of the FDTD calculation to express the far field intensity, the calculation time and the computer memeory can be reduced to about 80% and 1.3 Mbyte, respectively. The calculated radiation patterns are compared to the measured values and these are in good agreement.
The adaptive reduced state sequence estimation receiver for multipath fading channels
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1468~1476
In mobile communication systems, the Reduced State Sequence Estimation(RSSE) receiver must be able to track changes in the channel. This is carried out by the adaptive channel estimator. However, when the tentative decisions are used in the channel estimator, incorrect decisions can cause error propagation. This paper presents a new channel estimator using the path history in the Viterbi decoder for preventing error propagation. The selection of the path history in the Viterbi decoder for preventing error propagation. The selection of the path history for the channel estimator depends on the path metric as in the decoding of the Viterbi decoder in RSSE. And a discussion on the channel estimator with different adaptation algorithms such as Least Mean Square(LMS) algorithm and Recursive Least Square(RLS) algorithm is provided. Results from computer simulations show that the RSSE receivers using the proposed channel estimator have better performance than the other conventional RSSE receiver, and that the channel estimator with RLS algorithm is adequate for multipath fading channel.
Combined burst synchronization/error detection systems maximizing bit slip correction ranges
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1477~1486
Conventioally the decoding methods and the design of coset codes for burst synchronization and error detection have been based on the concept that slips occuring to the right or to the left with respect to a reference timing are corrected. In this paper we newly approach to the design of coset codes relying on the condition that only a single code word can exists in an observation interval, which provides an extentended view on the conventional approach. A theorem concerning the condition is presented. A combined burst synchronization and error detection system with maximum slip correction capability have been devised based on the theorem and a detection method is falsely accepted in the presented of channel errors. The false acceptance probabilities of the system are derived and its performance is analyzed through computer computation using the derived results.
Two-stage variable block-size multiresolution motion estiation in the wavelet transform domain
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1487~1504
In this paper, the two-stage variable block-size multiresolution motion algorithm is proposed for an interframe coding scheme in the wavelet decomposition. An optimal bit allocagion between motion vectors and the prediction error in sense of minimizing the total bit rate is obtained by the proposed algorithm. The proposed algorithm consists of two stages for motion estimatation and only the first stage can be separated and run on its own. The first stage of the algorithm introduces a new method to give the lower bit rate of the displaced frame difference as well as a smooth motion field. In the second stage of the algorithm, the technique is introduced to have more accurate motion vectors in detailed areas, and to decrease the number of motion vectors in uniform areas. The algorithm aims at minimizin gthe total bit rate which is sum of the motion vectors and the displaced frame difference. The optimal bit allocation between motion vectors and displaced frame difference is accomplished by reducing the number of motion vectors in uniform areas and it is based on a botom-up construction of a quadtree. An entropy criterion aims at the control of merge operation. Simulation resuls show that the algorithm lends itself to the wavelet based image sequence coding and outperforms the conventional scheme by up to the maximum 0.28 bpp.
Temporally adaptive layered image sequence coding technique employing H.261 for ATM networks
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1505~1514
In this paper, a temporally adaptive layered image sequence coding technique employing H.261 is proposed. In the proposed technique, the frame rate of the base layer is adjusted according to the temporal activity measure based on the rate-distortion function. The base layer is encoded using the H.261. Then, the full frame-rate error image is formed by comparing the original image and the interpolated version of the reconstructed base layer image. The enhancement layer is algo encoded using H.261 but with leaky prdiction to provide robust error resilience. The simulation results show that the proposed technique provides better performance than the twin-H.261 with leaky prediction in both the fixed-rate and variable-rate systems.
Multidimensional uniform cubic lattice vector quantization for wavelet transform coding
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1515~1522
Several image coding algorithms have been developed for the telecommunication and multimedia systems with high image quality and high compression ratio. In order to achieve low entropy and distortion, the system should pay great cost of computation time and memory. In this paper, the uniform cubic lattice is chosen for Lattice Vector Quantization (LVQ) because of its generic simplicity. As a transform coding, the Discrete Wavelet Transform (DWT) is applied to the images because of its multiresolution property. The proposed algorithm is basically composed of the biorthogonal DWT and the uniform cubic LVQ. The multiresolution property of the DWT is actively used to optimize the entropy and the distortion on the basis of the distortion-rate function. The vector codebooks are also designed to be optimal at each subimage which is analyzed by the biorthogonal DWT. For compression efficiency, the vector codebook has different dimension depending on the variance of subimage. The simulation results show that the performance of the proposed coding mdthod is superior to the others in terms of the computation complexity and the PSNR in the range of entropy below 0.25 bpp.
Estimation of transformation parameters using shape matching
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1523~1533
Image registration is concerned with the establishment of correspondence between images of the same scene with translational, rotational, and scaling differences. The estimated transformation parameters between images are very important information in the field of many applications. In this paper, we propose a shape matching scheme for finding correspondence points for images with various differences, Tranditional solutions to this area are unreliable for the rotational and schaling changes between images, and the feature extraction of partially occluded scene. To solve those problems, dominant points on digital curves are detected by scale-space filtering, and initial matching is performed by similarity measure of cumulative curvatures for dominant points. For initial matching segments pairs, optimal matching points are calculated using dynamic programming.Finally, transformation parameters are estimated.
A new metchod for estimating array covariance matrix in circular array
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1534~1542
In this paper, we present a performance improvement method for the direction-of-arrival (DOA) estimation algorithm of the narrowband signals incident on a uniform circular array. It is very important to estimate the covariance matrix effectively because the performance of DOA algorithm mainly depends on the exactness of the sampel coveriance matrix which is computed from the received samples of signals. In case of uniform circular array with the even number sensors, the structure of the arrray has a useful geometrical property. Therefore we present the method which can estimate covariance matrix more effectively using this property. The simulation results are shown to demonstrate the superior perfodrmance obtained by the proposed covariance matrix estimation method relative to that of the conventional estimation method.
A nonparametric detection scheme of composite signals in additive noise
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1543~1549
In this paper, rank-based nonparmetric detection of composite signals in additive noise is considered. Based on signs and ranks of observations, the locally optimum detector is deived for weak-signal detection under any specified noise probability density funhction. This detector has similarities to the locally optimum detector for comjposite signals in additive noise. The asymptotic performance of this nonparametric detector is shown to be as good as that of the locally optimum detector.
Performance analysis of CFAR detectors based on order statistics for nonhomogeneous background
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1550~1558
In this paper, we first propose a modified OS CFAR detector called the order statistics cell averaging(OSCA) CFAR detector and anlyze its performance for a Rayleigh target in homogeneous backgrounds, clutter edges, and satistics smallest of(OSSO) CFAR detectors for a Rayleigh target to nonhomogeneous environments. Computer simulation results show that the OSCA CFAR detector has superior performance to OS, OSGO, and OSSO CFAR detectors in homogeneous and multiple target environments. And the proposed detector shows its robustness for fast detection because it requires falf the processing time of the OS CFAR detector.
Multitrack run-length limited codes for intertrack interference channels
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1559~1565
A new multitrack RLL codes with immunity to intertrack interference (ITI) is proposed. This code takes aim at a high density storage channels by reducing the track width and/or guard bands between tracks since it prevents transition in neighboring tracks at the same time epoch. The capacities of the codes are found for each maximum and minimum constraint pair.
Favorite colar correction for color enhancement in color application system
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1566~1573
In this paper, we propose a favorite color correction algorithm for color enhancement in color application system which represent preferred colors for viewer's demands. The proposed algorithm corrects skin color which is widely used as a reference color for color control of color application system, blue color which is directly related to tri-stimulus values, and green color which has higher visual sensitivity. In the proposed algorithm, the vaiation range of phase detector output voltage was minimized for the favorite color saturation changes, thus the favorite from the burst signal for the phase detector characteristic, thus the favorite color was easilty detected from the other color without overlapping of correctionranges.
A compensated algorithm for dirction-of-arrival estimationof the linear array with faulty sensors
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1574~1578
In this paper, some problems that occur from faulty elements in a direction finding system composed of the linear array are studied and the method which improves the performance is proposed. The faulty element means the sensor that has no output or highly reduced gain than other normal sensors. In the presence method, the ocrrecting vector is calculated by maximizing the spatial spectrum subject to a constraint. The compensated spatial spectrum is obtained by this vector. The computer simulations have been performance to study the performance of the proposed method.
A design of high-linearity low-power contiunous-time filter for post-processing of .SIGMA..DELTA. converters
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1579~1589
This paper introduces a monolithic chip 3.3V high-performance continuous-tune filter used in a CDP that can reconstruct the PDM or PWM signal output of a .SIGMA..DELTA. D/A converter. We also mentioned an active RC filter structure and filter order satisfying high-linearity and the design specification. In desigining the OP-AMP, using a structure that accepts some distortion we could reduce the chip area, and reducing the DC path using a new biascircuit gave us better power performance. The designed.SIGMA..DELTA. D/A converter post-processing filter does its smoothering operations and reconstructs the data without reducing the performance of the system.
Potential diversity and chip-spreading orthogonal code division modulation system
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1590~1598
The paper first introduces the new concept of potential diversity and signal decomposability, which establish a foundaton to generalize the existing concepts of path and frequency diversities. Then it presents a new DS/CDMA system called chip-spreading OCDM system, which is an embodiment of the petential diversity concept that combines the path diversity of the DS/CDMA system and the frequency diversity of the OFDM/CDMA system. In the chip-spreading OCDM system the chip sequences in each symbol interval are first converted into aralled streams, which then simultaneously modulate different orthogonal Walsh basis functions. In the receiver, the received signal is matched to each extended basis-function which is the union of the transmitter basis-functions and their delayed replicas, and the matched-filtered chip samples are combined together after individual channel compensation. The conventional DS/CDMA system using the maximal ratio combining. In addition, it effectively resolves the high PAR and high sensitivity to frequency offset problems which are critical in multi-carrier systems.
An efficient caching scheme at replacing a dirty block for softwre RAID filte systems
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1599~1606
The software RAID file system is defined as the system which distributes data redundantly across an aray of disks attached to each workstations connected on a high-speed network. This provides high throughput as well as higher availability. In this paper, we present an efficient caching scheme for the software RAID filte system. The performance of this schmem is compared to two other schemes previously proposed for convnetional file systems and adapted for the software RAID file system. As in hardware RAID systems, small-writes to be the performance bottleneck in softwre RAID filte systems. To tackle this problem, we logically divide the cache into two levels. By keeping old data and parity val7ues in the second-level cache we were able to eliminate much of the extra disk reads and writes necessary for write-back of dirty blocks. Using track driven simulations we show that the proposed scheme improves performance for both the average response time and the average system busy time.
Stabilizationof a sagnac interferometric optical fiber current sensor
The Journal of Korean Institute of Communications and Information Sciences, volume 22, issue 7, 1997, Pages 1607~1612
A new method of stabilizing a Sagnac optical fiber current sensor is presented. This method is characterized by creating aproper amount of circular birefringence the fibersagnac, whose correaponding value of rotation angle is (m+1/2)
, removes the effect of linear birefringence and leads to achieve good stability. Using the technique the stability of the current sensor was improved more than 10 times to within