In this paper, we develop enhanced hypercube architectures and routing algorithms to realize arbitrary permutations in circuit switching. We prove that a hypercube is rearrangeable if one additional pair of links (one full-duplex communication line) is provided in only one dimesion of connections. We also prove that if each connection between two neighboring nodes consists of two pairs of links, the hypercube can handle two independent permutations simultaneously.

This paper suggests a new addition algorithm. A circuit to implement the algorithm and the result of its performance evaluation are presented. The basic idea of the algorithm is that to obtain the sum of two operands, two operands bits are exclusive-ORed and then the result is inverted by the carry from the previous stage. An unique carry prediction method minimizes carry propagation. The proposed circuit has a very simple and regular structure compared with CLA (carry lookahead adder). It also requires less gates for the implementation about 50% and operates faster.

This paper presents the design method for two-dimensional FIR digital filter using optimization scheme. The proposed design method is to extend the optimal one-dimensional filter design algorithm proposed by Parks and McClellan to two-dimensional case. When extending one-dimensional design scheme to two-dimensional one, some problems occur. In this paper we solved the problems by using the least square error model, the two-dimensional Lagrange interpolation, and the modified alternation theory. As a result, the equi-ripple FIR filter is obtained that is more optimal and more specific than the conventional methods.

This paper describes the hardware implementation of 2-D FIR digital filter for a real-time image processing. Generally, the most time-consuming operation in signal processing is the multiplication operation. To avoid it in digital filter. Pelid and Liu proposed the distributed arithmetic method for the one-dimensional case. The implementation method proposed in this paper is to extend Pelid's method to two-dimensional FIR filter using simple ROM lookup table and to use the technique of pipe lining two main operations of memory access and arithmetic. As a result, the speed of our proposed hardware implementation is two times faster than that of conventional methods and can be close to the real time speed.

Due to the low loss, broadband and accurate short time delay properties of optical fiber, it has attracted as a delay medium for high speed and broad-band signal processing. In this paper, we consider the coherent optical fiber filter of lattice structure, which uses coherent light sources and consists of directional couplers and optical fiber delay elements.The differences between the optical fiber filter and the ordinary digital filter are 1) the coupling coefficients of directional couplers are restricted between 0 and 1. 2) the optical signal is divided into ${j\sqrt{a}}and\;{j\sqrt{1-a}}$ at the directional coupler. Considering these restrictions, the design formulae and condition of realibility for optical fiber filter of lattice structure which makes the optimal use of optical signal energy are derived.

A new Hangul code called Truecode is developed for accomodating to the future computing environments of graphical user interface and multimedia as well as for corresponding with the invention principle of Hangul. Truecode is not a forced two-byte code of syllable unit, as completion-type of combination-type, currently used, but a one byte code of phoneme unit, which can represent initial consonant, vowel, and final consonant each. It is quite different from three-byte code of syllable unit and also does not require the fill code used for three-byte code. We expect great contribution to the Hangul culture from Truecode's some important following features. It can express all the Korean characters we may imagine and does not cause any problem in communication. As well as we may use direct connection font, we can assign ont-to-one correspondence between Truecode and a keyboard with three sets. Truecode has a good advantage in developing application softwares of Hangul and it can nicely be applied to the fields of speech recognition and artificial intelligence using natural language.

This paper deals with adaptive control method of a robot manipulator with one-flexible link. ARMA model is used as a prediction and estimation model, and adaptive control scheme consists of parameter estimation part and adaptive controller. Parameter estimation part estimates ARMA model's coefficients by using recursive least-squares(RLS) algorithm and generates the predicted output. Variable forgetting factor (VFF) is introduced to achieve an efficient estimation, and adaptive controller consists of reference model, error dynamics model and minimum prediction error controller. An optimal input is obtained by minimizing input torque, it's successive input change and the error between the predicted output and the reference output.

The phased array antenna has the ability to perform adaptive sampling by directing the radar beam without inertia in any direction. The adaptive sampling capability of the phased array antenna allows each sampling time interval to be varied for each target, depending on the acceleration of each target at any time. In this paper we design a three dimensional adaptive target tracking algorithm for the phased array radar system with a given set of measurement parameters. The tracking algorithm avoids taking unnecessarily frequent samples, while keeping the angular prediction error within a fraction of antenna beamwidth so that the probability of detection will not be degraded during a track updata illuminations. In our algorithm, the target model and the sampling rate are selected depending on the target range and the target maneuver status which is determined by a maneuver level detector. A detailed simulation is conducted to test the validity of our tracking algorithm for target trajectories under various conditions of maneuver.

We have developed a system which can analyze the status of signal sent from/received to a signalling service equipment within the fully electronic switching system such as TDX-10. The system has such functions that acquire PCM signal of the preferred channel from the subhighway of the thirth-two channel by which a Universal Signal Tr ansceiver Unit(USTU) is connected with Time Switch Unit (TSU), and then classify the type of signal such as R2MFC/DTMF/CCT/VOICE, and determine the digit. Up to now, we have analyzed the frequency spec trum using the FFT. This paper describes the developement of PCM acquirer which can analyze the signal characteristics by acquiring the PCM signal in SHW(subhighway), and proposes the CZT(Chirp Z-Transform) algorithm. An algorithm which analyzes the acquired signal and determines the signal frequency and the corresponding power spectrum using the CZT is also discussed here.

In this paper, we proposed the autonomous algorithm of pseudo-exhaustive testing for the multi-level combinational logic circuits. For the processing of shared-circuit that existed in each cone-circuit when it backtracked the path from PO to PI of CUT at the conventional verification testing, the dependent relation of PI-P0 is presented by a dependence matrix so it easily partitioned the sub-circuits for the pseudo-exhaustive testing. The test pattern of sub-circuit's C-inputs is generated using a binary counter and the test pattern of I-inputs is synthesized using a singular cover and consistency operation. Thus, according to the test patterns presented with the recipe cube, the number of test pattrens are reduced and it is possible to test concurrently each other subcircuits. The proposed algorithm treated CUT's net-list to the source file and was batch processed from the sub-circuit partitioning to the test pattern generation. It is shown that the range of reduced ration of generated pseudo-exhaustive test pattern exhibits from 85.4% to 95.8% when the average PI-dependency of ISACS bench mark circuits is 69.4%.

In this paper, we propose a prgressive image transmission technique using hierarchical pyramid data structure which is constructed based on the projection data of an image. To construct hierarchical Gaussian pyramids, we first divide an image into 4$\times$4 subblocks and generate the projection data of each block along the horizontal, vertical, diagonal, and antidiagonal directions. Among images reconstructed by backprojecting the projection data along a single direction, the one giving the minimum distortion is selected. The Gaussian pyramid is recursively generated by the proposed algorithm and the proposed Gaussian images are shown to preserve edge information well. Also, based on the projection concept a new transmission scheme of the lowest Laplacian plane is presented. Computer simulation shows that the quantitative performance of the proposed pyramid coding technique using projection concept is similar to those of the conventional methods with transmission rate reduced by 0.1 ~ 0.2 bpp and its subjective performance is shown to be better due to the edge preserving property of a projection operation.

An image can be largely corrupted by the ambient illuminant, so that the image enhancement to restory natural color without respect to the ambient illuminant is needed. It this paper, a new color image enhancement technique based on color constancy is proposed. To enhance the image quality, higher volues of contrast and saturation are preferred, but their excessive values make an image unnatural. Since the color constancy processing preserves only hue, while reducing the dynamic range of lightness and saturation,the technique is needed in order to compensate this phenomenon. The proposed method transforms and increases lightness and saturation simultaneously to avoid the complexity in the related transformation by analyzing the relationship between the RGB and modified IHS coordinate system.

To improve limitations of fuzzy PI controllers especially when applied to systems of order higher than one, we propose a fuzzy PI controller that takes out appropriate amounts of accumulated control input according to fuzzily described situations in addition to the calculation of incremental control input as in the case of conventional fuzzy PI controllers. The structure of the proposed controller was motivated by the characteristics of fuzzy PI controller that it generally gives inevitable overshoot when one tries to reduce rise time of the response especially when a system of order higher than one is under consideration. Since the undesirable characteristics of the fuzzy PI controller is caused by integrator of the controller, even though the integrator is introduced to overcome steady state error of response, we propose a controller that fuzzily clears out integrated quantities according to situation to give reduced rise time as well as small overshoots. To show the usefulness of the proposed controller, it is applied in simulations to such systems as are difficult to stabilize or difficult to get satisfactory responses by conventional fuzzy PI controllers.

In this paper, an implementation of high-speed parallel processing system for neural network design on the multicomputer network is presented. Linear speedup expandability is increased by reducing the synchronization penalty and the communication overhead. Also, we presented the parallel processing models and their performance evaluation models for each of the parallization methods of the neural network. The results of the experiments for the character recognition of the neural network bases on the proposed system show that the proposed approach has the higher linear speedup expandability than the other systems. The proposed parallel processing models and the performance evaluation models could be used effectively for the design and the performance estimation of the neural network on the multicomputer network.