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
A variable block-size transform coding by high-frequency energy
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1089~1095
We propowe a variable block-size transform coding. The size of transform block is adapted by the activity of the block, If the activity is lower than the given threshold, then the block-size is enlarged. In this paper, we use the energy of the transformed cofficients with high frrequency instead of the block variance as the block activity. The computer simulation results show that the reconstruction image by the proposed activeity measure gives superior picture quality to that by the block variance and the mean absolute difference.
Temporal adaptive 3D subband image sequence coding technique
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1096~1108
In this paper, we propose a temporal adaptive tranform 3D SBC coder with motion compensation, exploiting redundancy in the temporal domain. We propose a temporal adaptivity measure, by which the R-D optimal temporal transform can be chaosen. The base temporal subband frame is coded using H.261-like MC-DCT coder, while the higher temporal subband frames are coded using the 2D adaptive wavelet packet bases, considering the various energy distribution which results from the temporal variation. In encoding the subbands, we employ adaptive scanning methods, uniform step-size quantization with VLC, and coded/not-coded flag reduction technique using the quadtree structure. From the simulation results, the proposed adaptive 3D subband coder shows about 0.29~3.14 dB gain over the H.261 and the fixed 3D subband coder techniques.
Adaptive motion estimation based on spatio-temporal correlations
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1109~1122
Generally, moving images contain the various components in motions, which reange from a static object and background to a fast moving object. To extract the accurate motion parameters, we must consider the various motions. That requires a wide search egion in motion estimation. The wide search, however, causes a high computational complexity. If we have a few knowledge about the motion direction and magnitude before motion estimation, we can determine the search location and search window size using the already-known information about the motion. In this paper, we present a local adaptive motion estimation approach that predicts a block motion based on spatio-temporal neighborhood blocks and adaptively defines the search location and search window size. This paper presents a technique for reducing computational complexity, while having high accuracy in motion estimation. The proposed algorithm is introduced the forward and backward projection techniques. The search windeo size for a block is adaptively determined by previous motion vectors and prediction errors. Simulations show significant improvements in the qualities of the motion compensated images and in the reduction of the computational complexity.
Estimation of the frequency component and the orientational angle in texture image based on the QPS filter
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1123~1131
Several improved quadrature polar separable (QPS) filters have been proposed and applied in texture processing since Knutsson proposed the QPS filter. They include a Knutsson's cosine function or oan exponential attenuation function, as the orientational function, and a Knutsson's exponential function or a finite prolate spheroidal sequence (FPSS) or an asymptotic FPSS, as the radial weighting functions. They represent different properties in terms of the generation of texture images, the orientational estimation, and the segmentation of synthetic texture image. In this paper, we have constructed several kernal functions for the 2-D QPS filter and analyzed their properties. A series of experiments have been carried out in order to estimate the frequency components and orientational angles of a local texture in Fourier domain. finally some problems encountered in applying QPS filters to feature description and segmentation are considered. Experimental results show that the improved Knutsson's filter and the asymptotic FPSS filter are useful in terms of the orientational estimation and the sementation of synthetic texture image.
Adaptive rate control scheme for very low bit rate video coding
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1132~1140
In video coding systems, an effective rate control method is one of the most improtant issues for the good video quality. This paper presents an adaptive rate control scheme based on the buffer fullness, quantization, and buffer utilization for very low bit rate communication lines, such as 16kbit/s, 24bit/s, and so on. The strategy is implemented on H.263, whichis a vide coding algorithm for narrow band telecommunication channels up to 64kbit/s recommended by ITU-T SG15, to show the effectiveness. The simulation result shows that the suggested rate control scheme has better SNR performance and buffer utilization of source coder than those of linear and non-linear buffer control strategies.
Design and performance analysis of the linear phase para-unitary M bandfilter bank with application to image coding
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1141~1154
The para-unitary (PU) M band filter bank, which can beused for M band decomposition, has many useful properties. In this ppaer, attempts have been made to design and and analyze the linear phase para-unitary (LPPU) M band filter bank, which is appropriate to the image coding application. First, we derive a unified coding gain in terms of the correlation in the band, as well as the energy compaction. And M band filter bank has been designed, maximizing the new coding gain. Then, we analyze the image coding performance of the LPPU M band filter bank, such as the energy compaction, the correlation in the band and the entropy. From the analysis, it is shown that the coding gain for LPPU M band filter bank improves, and the coding gain for the LPPU 4 band filter bank approaches very closely to that for LPPU 8 band filter bank, as the length of the filter increases. This fact is also verified by the coding results on the real images.
The characteristics of pseudomedian filter for De-interlacing scan conversion
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1155~1171
In this paper, we have analized the characteristics of pseudomedian filter based on the preceding study. The proposed pseudomedian filter methods consist of two types, that are H-shaped and Asterisk-shaped window types. At first, the definition of pseudomedian filter and its algorithm for de-interlacing scan conversion have been descibed, especially its charateristics, this, is the edge preserving characteristics and the required computation have been compared with the conventional algorithms. And PSNR has been introduced to evaluate the pseudomedian filter methods and the conventional algorithms. Finally, it has been discussed on the features and trade off of the pseudomedian filter methods. And the merit and application fields of the pseudomedian filter methods have been discussed.
Adaptive noise cancellation algorithm reducing path misadjustment due to speech signal
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1172~1179
General adaptive noise canceller(ANC) suffers from the misadjustment of adaptive filter weights, because of the gradient-estimate noise at steady state. In this paper, an adaptive noise cancellation algorithm with speech detector which is distinguishing speech from silence and adaptation-transient region is proposed. The speech detector uses property of adaptive prediction-error filter which can filter the highly correlated speech. To detect speech region, estimation error which is the output of the adaptive filter is applied to the adaptive prediction-error filter. When speech signal apears at the input of the adaptive prediction-error filter. The ratio of input and output energy of adaptive prediction-error filter becomes relatively lower. The ratio becomes large when the white noise appears at the input. So the region of speech is detected by the ratio. Sign algorithm is applied at speech region to prevent the weights from perturbing by output speech of ANC. As results of computer simulation, the proposed algorithm improves segmental SNR and SNR up to about 4 dBand 11 dB, respectively.
An implementation of hypercube with routing algorithm in bisectional interconnection network
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1180~1192
On demand of many users, basic networks of a parallel computer system are required to have a property that can embed various topologies. Bisectional interconnection network is known to satisfy this property, and it can embed various topologies optimally. Nowadays one is very interested in the hypercube as a message pssing multicomputer system, so it is very important to implement a hypercube in bisectional network. In this paper, a hypercube is implemented in a versatile bisecional netork, and its routing and broadcasting algorithm are proposed. Conventional bisectional network can accomodata linear array, complete binary tree and mesh structure as its topology. Now hypercube is implemented to be utilized as a general purpose supercomputercommunication architecture. The proposed routing and broadcasting algorithm embedded in bisectional network are general purpose algorithms which satisfy property of conventional hypercube.
Test sequence generation using MUIO and shortest paths
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1193~1199
This paper introduces an algorithm which uses MUIO and the shortest paths to minimize the length of test sequence. The length of test sequence is equal to the total number of the edges in a symmetric test graph
. Therefore, it is important to make a
with the least number of the edges. This algorithm is based on the one proposed Shen. It needs the complexity to make shortest paths but reduces the thest sequence by 1.0~9.8% over the Shen's algorithm. and this technique, directly, derives a symmetric test graph from an FMS.
Performance of burst-level bandwidth reservation protocols for multiple hop ATM LANs
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1200~1207
The paper presents and analyzes two efficient burst-level bandwidth reservation protocols for multi-hop ATM Local Area Networks. With the tell-and-wait (TNW) protocol and the tell-and-go (TNG) protocol, a negative acknowledgmen(NACK) message representing the bandwidth starvation on a switch on the source-destnation path can be always sent by a destination. We note that the protocols waste more bandwidth as the round-trip delay increases, since the switches on the path must reserve the bandwidth until the NACK will arrive. Based on this pitfall, the proposed protocols allow and ATM node, rather than a destination node to send a NACK. This allowance can save the needless bandwidth wastage. Using the thinned load approximation method, we show the proposed protocols have good performance and practical simplicity. Thus, the proposed protocols may be candidates for the ABR service in multi-hop ATM LANs and ATM WANs.
performance analysis of the CSMA/CA protocol using stop-and-wait ARQ method in iwreless LANs
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1208~1220
In this paper, the performance of a Carrier Sense Multiple Access/Collision avoidance (CSMA/CA) protocol using stop-and-Wait automatic Repeat reQuest, which is adapted as a draft standard in IEEE 802.11, is analyzed using a mathematical method based on a renewal theory, and simulation checks are performed, which confirm the goodness of our anlysis. In order to anlayze of CSMA/CA, we model that network is composed of finite populationand channel is slotted. And, we consider the CSMA/CA protocol as a hybrid protocol of 1-persistent CSMA and p-persistent CSMA protocol. As resuls of analysis, we have found that the throughput is degraded and packet delay is increased as the number of stations, Acknowledgement (ACK) length and Distributed coordination function Inter Frame Space (DIFS) length are increased.
An efficient algorithm for the design of combinational circuits with low power consumption
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1221~1229
This paper proposes a heuristic algorithm for low power implementation of combinational circuits. Selecting an input variable for a given function, the proposed algorithm performs Shannon exansion with respect to the variable to reduce the number of gates in the subcircuit realizing the coffactor function, reducting the power dissipation of the implemented circuit. experimental results for the MCNC benchmarks show that the proposed algorithm is effective by generating the circuits consuming the power 48.9% less on the average, when compared to the previous algorithm based on precomputation logic.
Acquisition performance of a direct-sequence spread-specturm multiple-access system in a multipath fading channel
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1230~1239
This paper analyzes matched-filter acquistion performance of a direct-sequence spread-specturm multiple-access system in a Rayleigh fading channel. For an application of multiple access system, multiple access interference is considered in the performance analysis. A signal flow graph technique is used to derive mean acquisition time in terms of detection and false alarm probabilities. As aresult of performance analysis, it is shown that mean acquisition time increases as fading rate becomes faster andthe numbre of users increases, and it decreases as a matched-filter length becomes logner. The variation of parameter values hs much influence on acquisition performance as SNR/chip becomes smaller.
Optimization of input carrier powers considering satellite link environment in the multi-level SCPC systems
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1240~1255
This paper suggests power optimization technique in multi-level SCPC system as a method for efficient utilization of limited satellite power. The power optimization is realized by optimal assignment of satellite input carrier powers considering interference and noise generated in up-link and down-link. The Fletcher-Powell algorithm searching minimum(or maximum) point using gradient information is used to detemine the optimal input carrier powers. To apply Flectcher-Powell algorithm mathematical descriptions and their partial derivatives to interference and nose are presented. Because a target, which should be optimized, is satellite input carrier power, amplitude of each carrier group will be assumed to be an independent variable. The performance criterion for optimal power assignmentis classified into 4 categories with respect to CNR of destination receiver earth station to meet the requirement for various satellite link environment. Simulation results for two-level, four-level and six-level SCPC system are presented.
Hybrid-ARQ protocols based on first-order reed-muller codes with soft decision detectors
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1256~1265
Soft-decision detectors are used in many FEC and ARQ schemes to enhance the bit-error-probability and system throughput. Also, the hybrid-ARQ protocol is a very efficient schemeto achieve overall performance improvement. In this paper, we propose a new hybrid-ARQ protocol based on the first-order Reed-Muller codes employing soft-decision detectors. The Reed-Muller codes have the virtue of being able to use the fast Green machine decoder that is simple to implement. As the performance measures, the bit-error-probability and system throughput are evaluted for the proposed hybrid-ARQ procol, and compared with those of other hybrid-ARQ schemes. It is shown that the use of the proposed hybrid-ARQ protocol results in significant performance improvement without causing much loss in view of system complexity.
An integrated system of nominative signatures and undeniable signatures
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1266~1273
The nice concept of undeniable signatures was presented by Chaum and van Antwerpen. Briefly, an undeniable signature is signature which cannot be verified withoug the help of the signer. They are therefore less personal than ordinary signatures in the sense that a signature cannot be related to the signer without his help. On the other hand, the signer can only repudiate an alleged signature by proving that it is incorrect. Boyar, Chaum, damgard and Pedersen introduce convertible undeniable signatures. In this schemes, release of a single bit string by the signer turns all of his signatures, which were originally undeniable signatures, into ordinary digital signatures. And, S.J.Kim, S.J.Park and D.H.Won propose a new kind of signature scheme, called "nominative signatures:, that is the dual scheme of undeniable signatures. nominative signatures acheieve theses objectives:Only nominee can verify the nominator(signer)' signature and if necessary, only nominee can prove to the third party that the signature is issued to him(her) and is valid. In this paper we present an efficient integrated system of nominative signatures and (convertible) undeniable signatures. i.e. we show how nominative signature scheme can be changed into a (convertible) undeniable signatures.ures.
A study on the iverse modeling of communication channel by HOS
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1274~1282
This paper deals with an inverse modeling of nonminimum phase communication channel utilizing the HOS (High Order Statistics) of the received signal. After the communication channel is separated into the minimum phase and maximum phase components, the inverse modeling is performed independently. The performance superiority is confirmed by monte-carlo computer simulation in comparison with the traditional CMA (Constant Modulus Algorithm) method. By utilizing the proposed algorithm employing the HOS of the received signal, the inverse frequency characteristics of the channel can be obtained withoug transmitted signal in digital communication. This algorithm is required in preprocessing or postprocessing in order to remove the channel effect, and effective in the self adaptive equalizer which can minimize the bit error rate or symbol error rate in the recovry of received signal.
A desing of personal communication system based on wideband CDMA
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1283~1293
This paper descries design concepts, structure and charracteristics of personal communications system based on wideband CDMA under developing for general low-tier mobile telecommunications services as the first step of the next generation mobile telecommunications systems that provide timely exchange of various types of information with anyone, from anywhere, at anytime. Also, wedesign a reverse linktransmitter/receiver structure for personal communications system based on wideband CDMA and validata the performance of the designed structure and establish the each parameter via computer simulation. Simulaation results on the effects of reverse link synchronous transmission and the effects of power control and control and channel coding in pedestrian environment for low-tier services are presented.
Design of wideband microstrip antennas using parasitic element
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1294~1303
In this paper, the microstrip anntenna with broad bandwidth is designed using parasitic element. In the designed cofiguration, parasitic element of the same resonating length but different width which is coupled to the nonradiating edge of a rectangular patch antenna. The driven element aloe is fed and the other part is operated as parasitic element. So the different patchs are resonating at differnt frequencies and this multiple resonance increase the bandwidth. The overall size of the antenna is not increased by adding parasitic element to a driven patch. Compared to the available wideband microstrip antennas, the designed antenna structure is bery compact. A theoretical explanation of the rectangular patch antenna coupled with prarsitic is analyzed by extending the theory of coupled microstrip lines. The theoretical and experimental results for a patch coupled with a single parasitic are presented.
A design of voltage controlled hair-pin resonator oscillator for the use of clock precovery/data regeneration circuit in 10 Gbps SDH fiber optic systems
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1304~1316
In this paper, A VCO(Voltage Controlled Oscillator) in use of clock recovery/data regeneration circuit for 10 Gbps fiber optic receivers was developed. The improved hair-pin resonator with a parallel coupled lines, which has been applied to microstrip filters, was used as a resonance part. As a frequcncy tuning device by substituting 3-terminalMESFET vaaractor for varactor diode, an MMIC manufacturing process will be simplified. Since a hair-pin resonator is planar type compared to the dielectric resonator and has a relatively flat reactance verus frequency, it will be favorable to apply a hair-pin resonator to an MMIC, in addition wideband frequency tuning range is able to be obtained.
An angular spectral inverse scattering technique with series-expanded field in dielectric object
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1317~1324
An angular spectral inverse technique, applying the moment method procedure with a series expansion for the induced field in each enlarged cell, is suggested to reconstruct permittivity profiles of inhomogeneous dielectric objects and to reduce the ill-posedness inherent to inverse scattering problems. The angular spectral inverse scattering using the pulse basis function in enlarging the scatterer has the ill-posedness due to the input data of higher spectra. To reduce the number of higher spectra, enlarging the cell size and averaging over the cell with a suitable weighting function are found to play improtant roles for the reduction of ill-posedness of the angular spectral inverse scattering problems.
A study on the CFT error reduction of switched-current system
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1325~1331
In this paper, a new current-memory circuit is proposed that reduces the clock feedthrough(CFT) error voltage causing total harmonic distortion(THD) increment in switched-current(SI) systems. Using PMOS transistor in CMOS complementary, the proposed one reduces output distortion current due to the CFT errorvoltage. A proposed current-memory is designed using a 1.2.mu.m CMOS process anda 1MHz sinusoidal signal having a 68.mu.A amplitude current is applied as input (sampling frequency:20MHz). It hasbeen shown from the simulation that the output distortion current effected by the CFT error voltage is reduced by approximately 10 times the error voltage of conventional one, THD is -57dB in case ofappling 1kHz frequency input signalwith 0.5 peak signal-to-bias current ratio.
A design of floating-point multiplier for superscalar microprocessor
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1332~1344
This paper presents a pipelined floating point multiplier(FMUL) for superscalar microprocessors that conbines radix-16 recoding scheme based on signed-digit(SD) number system and new rouding and normalization scheme. The new rounding and normalization scheme enable the FMUL to compute sticky bit in parallel with multiple operation and elminate timing delay due to post-normalization. By expoliting SD radix-16 recoding scheme, we can achieves further reduction of silicon area and computation time. The FMUL can execute signle-precision or double-precision floating-point multiply operation through three-stage pipelined datapath and support IEEE standard 754. The algorithm andstructure of the designed multiplier have been successfully verified through Verilog HOL modeling and simulation.
A design of floating-point arithmetic unit for superscalar microprocessor
The Journal of Korean Institute of Communications and Information Sciences, volume 21, issue 5, 1996, Pages 1345~1359
This paper presents a floating point arithmetic unit (FPAU) for supescalar microprocessor that executes fifteen operations such as addition, subtraction, data format converting, and compare operation using two pipelined arithmetic paths and new rounding and normalization scheme. By using two pipelined arithmetic paths, each aritchmetic operation can be assigned into appropriate arithmetic path which high speed operation is possible. The proposed normalization an rouding scheme enables the FPAU to execute roundig operation in parallel with normalization and to reduce timing delay of post-normalization. And by predicting leading one position of results using input operands, leading one detection(LOD) operation to normalize results in the conventional arithmetic unit can be eliminated. Because the FPAU can execuate fifteen single-precision or double-precision floating-point arithmetic operations through three-stage pipelined datapath and support IEEE standard 754, it has appropriate structure which can be ingegrated into superscalar microprocessor.