• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.771-774
• /
• 1998

In this paper proposes a new bit-parallel structure for a multiplier over GF((Pn)m), with k-nm. Mastrovito Multiplier, Karatsuba-ofman algorithm are applied to the multiplication of polynomials over GF(2n). This operation has a complexity of order O(k log p3) under certain constrains regardig k. A complete set of primitive field polynomials for composite fields is provided which perform modulo reduction with low complexity. As a result, multiplier for fields GF(Pk) with low gate counts and low delays are constructed. The architectures are highly modular and thus well suited for VLSI implementation.

• Proceedings of the KIEE Conference
• /
• 1992.07b
• /
• pp.1250-1254
• /
• 1992

This paper describes the designed and fabricated thermal imaging system with the SPRITE(Signal PRocessing in The Element) detector, operating in the 3-12 micron band. This system consists of an afocal telescope, a scan unit containing the SPRITE detector, an electronic processor unit and a cooler. The optical scan system utilizing rotating polygon and oscillating mirror, is 2-dimensional serial/parallel scan type using five elements of the detector. And the electronic processor unit performs digital scan conversion to reform the parallel data stream into serial analog data compatable with conventional RS-170 video. The scan field of view is 40 ${\times}$ 26.7 and the MRTD(Minium Resolvable Temperature Difference) is 0.6 K at 7.5 cycles/mm. The acquired thermal image indicates that this system has a satisfactory performance.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.9 no.3
• /
• pp.20-24
• /
• 2006

In this paper, our research efforts and activities for displaying flight simulation graphics on multi-monitors connected to a Linux cluster is introduced. In this pilot system graphics rendering as well as view calculation including LOD implementation for each monitor is peformed on each sub-node computer connected to the monitor rather than using an expensive main server. The Linux cluster is constructed by combining general-purpose desktop computers, and MPI library Is used for communication between sub-nodes. It could be concluded from our experience that it is possible to construct a massive multi-monitor display system by adding to the cluster as many sub-node computers and monitors as possible with economic efficiency.

• International Journal of Contents
• /
• v.14 no.3
• /
• pp.1-6
• /
• 2018

For 3D display applications, auto-stereoscopic display methods that can provide 3D images without glasses have been actively developed. This paper is concerned with developing a display system for elemental images of real space using integral imaging. Unlike the conventional method, which reduces a color image to the level as much as a generated depth image does, we have minimized original color image data loss by generating an enlarged depth image with interpolation methods. Our method was efficiently implemented by applying a GPU parallel processing technique with OpenCL to rapidly generate a large amount of elemental image data. We also obtained experimental results for displaying higher quality integral imaging rather than one generated by previous methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.16-21
• /
• 2005

This paper considers the problem of state estimation in linear continuous-time systems with multi-sensor environment and observation uncertainties. We propose two suboptimal filtering algorithms for these types of systems. The filtering algorithms consist of two steps: The local optimal Kalman estimates are computed at the first step. And, these local estimates are lineally fused at the second step. The implementation of the two-step filtering algorithms needs a lower memory demand than the optimal Kalman and adaptive Lainiotis-Kalman filters. In consequence of parallel structure of the proposed filters, the parallel computers can be used for their design. The examples exhibit the effect of common noise on the performance of fusion of the local Kalman estimates based on observations from different sensors and in the presence of uncertainties.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.871-872
• /
• 2008

The method and results of the software implementation of a echo processor for medical ultrasound imaging using a GPU (NVIDIA G80) is presented. The echo signal processing functions are modified in a SIMD manner suitable for the GPU's massively parallel processing architecture so that the GPU's 128 ALUs are utilized nearly 100%. The preliminary result for a frame of image composed of 128 scan lines, each having 10240 16-bit samples, shows that the echo processor can be inplemented at a high rate of 30 frames per second when implemented in C, which is close to the optimized assembly codes running on the TI's TMS320C6416 DSP.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1070-1073
• /
• 2002

This study presents a parallel branch-and-bound (PBAB) method for traveling salesman problem (TSP). The PBAB method adopts intermediate form of central control and distributed control in terms of the lightness of the master process's role. Compared with fully distributed control, the control scheme involves less concentration of communication on the master. Moreover, in order to reduce the influence of communication, the worker is composed of a computation thread and a communication thread. The multithreadness realizes the almost blocking free communications on the master. We implement the proposed PBAB method on a network of PCs, which consists of one master and up to 16 workers. We experiment five TSP instances. The results shows that the efficiency increases with the problem size.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.10
• /
• pp.27-35
• /
• 1997

In this paper, we propose a new scheme for the generation of partial products for VLSI fast parallel multiplier. It adopts a new encoding method which halves the number of partial products using 2x2 submultipliers and rearrangement of primitive partial products. The true 4-input CSA can be achieved with appropriate rearrangement of primitive partial products out of 2x2 submultipliers using the newly proposed theorem on binary number system. A 16bit x 16bit multiplier has been desinged using the proposed method and simulated to prove that the method has comparable speed and area compared to booth's encoding method. Much smaller and faster multiplier could be obtained with far optimization. The proposed scheme can be easily extended to multipliers with inputs of higher resolutions.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.10
• /
• pp.36-42
• /
• 1997

In the whole world, the research about the VLSI implementation of motion estimation algorithm is progressed to actively full (brute force) search algorithm research with the development of systolic array possible to parallel and pipeline processing. But, because of processing time's limit in a field to handle a huge data quantily such as a high definition television, many problems are happened to full search algorithm. In the paper, as a fast processing to using parallel scheme for the serial input image data, motion estimator of systolic array structure verifying that processing time is improved in contrast to the conventional full search algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.6
• /
• pp.56-63
• /
• 1984

This paper proposes a programmed logic realization of sequential logic system with parallel sequences which is described by a GRAFCET. For this purpose, an algorithm is proposed, which decomposes the GRAFCET with parallel sequence into a set of state graph without changing the physical meaning, which is applied to all kinds of GRAFCET, and which divides the system into sub-systems and vice versa. A systematic implementation by microprogrammed logic using ROM is proposed, which expands the number of selection sequence.