ATM was adopted as the switching and multiplexing technique for BISDN which aims at transmitting traffics with various characteristics in a unified network. To construct these ATM networks, the most important aspect is the design of the switching system with high performance and different service capabilities. In this paepr, we analyze the performance of an input and output queueing switch with preemptive priority which is considered to be most suitable for ATM networks. For the analysis of an input queue, we model each input queue as two separate virtual input queues for each priority class and we approximage them asindependent Geom/Geom/1 queues. And we model a virtual HOL queue which consists of HOL cells of all virtual input queues which have the same output address to obtain the mean service time at each virtual input queue. For the analysis of an output quque, we obtain approximately the arrival process into the output queue from the state of the virtual HOL queue. We use a Markov chain method to analyze these two models and obtain the maximum throughput of the switch and the mean queueing delay of cells. and analysis results are compared with simulation to verify that out model yields accurate results.

In this paper, we analyze the anynchrous cellular hybrid DS/FH spread spectrum system with diversity on nonselective Nakagami fading channel. Binary Psk scheme is considered and random spreading code sequences and random hopping patterns are used. We compare the performance of system using hard-limiting correlation receiver with diversity and linear corrleation receiver in Nakagami fading channel. We compute the average bit error probabilities with/without diversity according to spreading code sequence and the number of hop-ping frequencies under the same handwith espansion, and analyze near-far effect. The results show that hard-limiting correlation receiver with diversity gives a good performance over severe fading channel.

In this paper, we analyze CDMA systems using M-orthogonal spreading codes. We assume that each user one set of M-orthogonal spreading codes allocated randomaly. The effect of multiple access interference from the reference and adjacent cells is considered slowly frequency selective rayleigh fading channels. and the adjacent cells interference is considered toanalyze the system performance. We calculate bit error rate and the maximum number of users whoe can communicate simulaneously within a cell by suing Rake receiver. By comparing CDMA systemwhich transmits 1 bit/spreding code, our system shows bit error rate decreases as M increases under the same bandwidth and infromation rate.

In this paper, we have presented a quantitative performance effect of CCP(Call Control Processor) when SAAL(Signalling ATM Adaptation Layer) function is distributed from CCP to SIMs(Subscriber Interface Modules) in an ATM switching system with distributed architecutre. For the performance analysis, SLAM II simulation language is used and subscriber signalling messageand inter-processor communication messages according to Q.2931 based local call processing procedure are taken into consideration in the proposed queuing network model. The results of simulation are compared with in case of processing SAAL function on CCP. It is observed that the processing utilization of CCP reach 24,000 BHCA and 25,700 BHCAwhen SAAL function load amounts to 10% and 20% of the processing time of the total message, respectively. These values shows that the processing utilization of CCP is alleviated about 7% in comparison with 2,000 BHCA in case that SAAL function is carried out on CCP. Consquently, it is shown that we have to consider seriously how to distribute the functions concerning call processing in a large cale ATM switching system architecture accomodating a number of SIMs.

In this paper, we propose an efficient per-Trunk interworking mechanism between PSTN and ATM network assuming the situation ATM network interworks with PSTN during the evolution period. The proposed mechanism improves the cell payload utilization by mapping only the active charnnels of PSTN frame into ATM cell payload. Also, we propose the frame recovery mechanism to guarantee the frame sequence integrity. The proposed mechanism is compared with other possible ones in terms of cell payload utilization, cell packetization delay. We present the implementation structure of the interworking unit. the correctness of the mechanism and the feasibility of the implementation are verifid through the CAD simulation.

In this paper, we propoe a log N-stage ATM concentator. ATM concentrator is used in the ATM access network to concentrate the traffic offered at UNI, so that high utilization of the newtork rewources is achieved. The concetrator may be used as a construction block in the design of ATM switch. We define abasic element, named equalizer, and decribe its function and theory to construct an efficient concentrator using the element. In addition, a control scheme to enhance the concentrator to a superconcentrator is presented, which enables the concentration to start from an arbitrary output. This scheme makes it possible to construct an efficient ditributior or a barrel shifter which are often used in ATM switch and other application. The proposed concentrator has a low hardware complexity of O(N log N), thus it is economical to implement. Also, the time complexity of proposed concentrator for determining the rouging is O(N log N), which is faster than that of the existing ones.

A contrp; suste, fpr SCARA robot is designed for implememting a robust dynamic control algorithm. this study forcuses on the use of DSPs in the design of joint controllers and interfaces in between the host cotroller and four joint controllers and in between the joint controllers and four servo drives. The mechanical body of SCARA robot and the servo drives are selected from the commercially available ones. The four joint controllers, assigned to each joint one by one, are combined into a common system through a mother board hardwarewise and through the global memeory softwarewise. The mother board is designed to connect joint controllers onto the board through the slots adopting PC/104 bus structures. And, the global memory stores the common data which can be shared by joint controllers and the host computer directly, which virtually combines the whole system into one. To demonstrate the performance and efficienty of the sytem, a robust inverse dynamic algorithm is proposed and implemented for a faster and more precise control. The robust inverse dynamic algorithm is basically derived from an inverse dynamci algorithm and a PID compensator. Based upon the derived dynamic equitions of SCARA robot, the inverse dynamic algorithm is intitially implemented within 0.3 msec of the control cycle in this system. The algoithm is found to be not accurate enough for the high speed and precision tasks due to inherent modelling errors and time-varying factors. Therefore, a variable PID algorithm is combined with the inverse dynamic algorithm to support robustness of control performance. Experimental datfor the proposed algorithm are presented and compared with the result obtained from PID and inverse dynamic algorithm.

Spike detection in long-term EEG monitoring forepilepsy by wavelet transform(WT), artificial neural network(ANN) and the expert system is presented. First, a small set of wavelet coefficients is used to represent the characteristics of a singlechannel epileptic spikes and normal activities. In this stage, two parameters are also extracted from the relation between EEG activities before the spike event and EEG activities with the spike. then, three-layer feed-forward network employing the error back propagation algorithm is trained and tested using parameters obtained from the first stage. Spikes are identified in individual EEG channels by 16 identical neural networks. Finally, 16-channel expert system based on the context information of adjacent channels is introducedto yield more reliable results and reject artifacts. In this study, epileptic spikes and normal activities are selected from 32 patient's EEG in consensus among experts. The result showed that the WT reduced data input size and the preprocessed ANN had more accuracy than that of ANN with the same input size of raw data. Ina clinical test, our expert rule system was capable of rejecting artifacts commonly found in EEG recodings.

We developed a method for the solid angle estimation of acetabular coverage of the femoral head in 3D space. The superior half of the femoral head is modeled as part of a sphere. And the tangent lines connecting from a set of points of the acetabular outline to the center of the fitted sphere are obtained. The lines passthrough the unit sphere whose center is the same as that of the femoral head. The interesecting points form a boundary on the unit sphere. With the points on the unit sphere, we calculate the covered area of the femoral headand estimate the solid angle. Solid angle is defined asthe suface area within the boundary on the unit sphere. In this measurements, the solid angle of normal subjects is on an average 4.3(rad) and the corresponding acetabular coverage is 68%. Unlinke the conventional methods, this solid angle estimation shows real 3D acetabular coverage.

Conventional block-based video coders induce annoying blocking artifacts in very low bitarte coding. We propose a delocking filter which is appropriate for real time operation in a conventional video decoder. The proposed algorithm uses on dimensional filtering across block boundaries horizontally and vertiaclly with two separate filtering modes. The mode decision is quite simple but is fully based on the characteristics of human visual system and video sequences. In flat regions, a strong smoothing filter is appliced; and in the other regions, a moew sophisticated smoothing filter, which is based on the frequency information around block boundaries, is used to reduce blocking artifacts without introuducing undesired blur. Eeven though the proposed deblocking filter is quite simple, simulation results show that it improves both subjective and objective image quality for various image features.

Subband/DCT coding has been introduced in order to transmit images of various resultions using one given image-codec, for nowadays there are various grades of quality in visual communication services. However, subband/DCT results in the increawse of multiplication number and memory size. In order to resolve this problem, we propose block-based subband/DCT coding in this paper. In block-based subband/DCT, the number of multiplications is not only reduced because we combine subband decomposistion with DCT, but the size of memory is also reduced because images can be parallel-processed block by block. We show that the number of multiplications is reduced, by analyzing the property ofblock-based subband/DCT matrix mathematically, and examine the performance of proposed coder, which adopts JPEG as backhand-coder after block-based subband/DCT.

Quantizer with bit rate control performs lossy compressionin moving image coding. Efficient quantizer can improve subjective quality of reconstructed image at the same bit rate because most of errors are occured at this stage. Although quantization matix of current compression stantards reflects human visual system, the performance of their quantization matrixes is not always optimal because they are not considering each image characteristics. We proposed a new adaptive optimal quantization matrix obtained by considering complexity of each image subblocks. It resulted in improvments of image quality about 0.05-0.82 dB and good subject quality at edge regions when we simulated the quantization method in various coding statndards.

In this study, for the first time, we propose the ADI(Adaptive De-Interlacing) algorithm, which improves visually and subjectively, horizontal and vertical edges on the image processed by the ELA (Edge Based Line Average) method. The proposed ADI algorithm enlargesthe window size to 5*3 in order to utilize the feature of the continuity of edges, and the adaptive interpolator is employed to decide adaptiely horizontal, diagonal, and vertical edges. Based on the results of the compter simulation, it is confimed that the new ADI algorithm improve the PSNR by 0.5dB in the Lena image with 512*512 size and by 0.4dB in the sequence image of a salesman, respectively. For the horizontal and vertial edges on the still and salesman sequence images, the proposed ADI algorithm has better visulal improvement than the conventional ELA algorithm.

One of the central problems in sereo matching is the selectionof the optimal window sizes for comparing image regions. The window size must be large enough to include enough variation for reliable matching, but small enough to avoid the effect of projection distortion. This paper discusses these problems with some novel algorithm based on iterativediffusion process at different disparity hypotheses. Also this paper proposes four kinds of diffusion algorithms to preseve discontinuity in stereo matching. We present and discuss extensive empirical results of algorithms based on various sets of synthetic and real image.

In this paper, we propose a tube-hole center detection vision algorithm verifying the position of a tele-controlled robot and providing visual information for increasing reliability and efficiency in the diagnosis of steam generator (SG) tubes in nuclear power plant. A tele-controlled robot plays a role in carrying the probe used in inspecting the integrity of SG tubes. Thus accurately locating a tele-controlled robot on the desired tube-hole center is important issue for reliability of inspection. To do this work, we have to find the tube-hole center locations from the input image. At first, we apply the three-class segmentation method modified for this application. WE extract minimum bounding rectangles (MBRs) in the theresholded binary image. Second, for discriminating between MBR by tube and MBR by noise, we introduce the MBR rejection rules as knowledge-based rule set. MBRs are divided into the very dark region MBRs and the very bright region MBRs. In order to describe the region of complete tube-hole, the MBRs need a process of pairing each other. We then can find the tube-hole center from the paired MBR. For more accurately finding the tube-hole center in several sequential images, the centers of some frames need to be averaged. We tested the performance of our method using hundreds of real images.

Thispapr proposes hybrid navigation parameter estimation using sequential aerial images. The proposed navigation parameter estimation system is composed of two parts: relative position estimation and absolute position estimation. the relative position estimation recursively computes the current velocity and absolute position estimation. The relative position estimation recursively computes the current velocity and position of an aircraft by accumulating navigation parameters extracted from two succesive aerial images. Simple accumulation of parameter values decreases reliability of the extracted parameters as an aircraft goes on navigating. therefore absolute position estimation is required to compensate for position error generated in the relative position step. The absolute position estimation algorithm combining image matching and digital elevation model(DEM) matching is presented. Computer simulation with real aerial image sequences shows the efficiency of the proposed hybrial algorithm.