• Korean Journal of Optics and Photonics
• /
• v.15 no.2
• /
• pp.123-129
• /
• 2004

This paper concerns auto vergence control of a parallel stereoscopic camera through geometrical analysis. In the construction of a parallel stereoscopic camera, we experimentally demonstrated linear relationship between the key object distance and the amount of vergence control. And we proposed a vergence control system for the stereoscopic camera using binocular disparity information. For the real-time calculation of disparity information, the Hybrid Cepstral filter algorithm, with input data acquired from the vertical projection data and from the down sampling data from the source images, was proposed for precision and high speed processing. With the disparity information algorithm and the vergence control of the parallel stereoscopic camera system, the stereoscopic images become more like those of the human eye.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1991.10a
• /
• pp.6-22
• /
• 1991

This thesis presents a parallel implementation of an iterative method for large scale, sparse linear system and gives result of computational experiments performed on both single transputer and multi transputer parallel computers. To solve linear system, we use conjugate gradient method and develope data storage techinique, data communication scheme. In addition to the explanation of conjugate gradient method, the result of computational experiment is summarized.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.6 no.1
• /
• pp.67-74
• /
• 1988

Absorption rates of oxygen in water soluble inks on the printing rollers were measured. As a results of experiments, could be obtained the data of rates of absorption of oxygen in 4 kinds of water soluble inks, and found the difference of absorption rate of oxygen on the parallel plates and rotating rolles.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1105-1108
• /
• 2005

Media service model is divided into 3 models that are Client Pull, Server Push, and IPP(Interleaving Pull & Push) model. In most single VOD(Video On Demand) environment, Client Pull model was sufficient to play the movie Because most media contents has a low bitrate and resolution. But according to an increment of the demand of the high definition media, Client Pull model is not sufficient. Parallel VOD environment is made of several of VOD servers and provides the parallel media stream simultaneously for one client. We compared and analyzed the performance of service models with respect to network delay and data size in buffer in the single and parallel VOD environment and we found that IPP service model keeps the least network delay and stable client buffer state in the parallel VOD environment.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.3
• /
• pp.210-219
• /
• 2017

This paper proposes a modified min-max algorithm (MMMA) for nonbinary quasi-cyclic low-density parity-check (NB-QC-LDPC) codes and an efficient parallel block-layered decoder architecture corresponding to the algorithm on a graphics processing unit (GPU) platform. The algorithm removes multiplications over the Galois field (GF) in the merger step to reduce decoding latency without any performance loss. The decoding implementation on a GPU for NB-QC-LDPC codes achieves improvements in both flexibility and scalability. To perform the decoding on the GPU, data and memory structures suitable for parallel computing are designed. The implementation results for NB-QC-LDPC codes over GF(32) and GF(64) demonstrate that the parallel block-layered decoding on a GPU accelerates the decoding process to provide a faster decoding runtime, and obtains a higher coding gain under a low $10^{-10}$ bit error rate and low $10^{-7}$ frame error rate, compared to existing methods.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2544-2552
• /
• 1997

This paper presents three multiprocess models for parallel protocol implementation, that is, (1)channel communication model, (2)fork-join model, and (3)event polling model. For the specification of parallelism for each model, a parallel programming language, Par. C System, is used. to measure the performance of multiprocess models, we implemented the Internet Protocol Suite(IPS) Internet Protocol (IP) for each model by writing the parallel language on the Transputer. After decomposing the IP functions into two parts, that is, the sending side and the receiving side, the parallelism in both sides is exploited in the form of Multiple Instruction Single Data (MISD). Three models are evaluated and compared on the basis of various run-time overheads, such as an event sending via channels in the parallel channel communication model, process creating in the fork-join model and context switching in the event polling model, at the sending side and the receiving side. The event polling model has lower processing delays as about 77% and 9% in comparison with the channel communication model and the fork-join model at the sending side, respectively. At the receiving side, the fork-join model has lower processing delays as about 55% and 107% in comparison with the channel communication model and the event polling model, respectively.

• Journal of IKEEE
• /
• v.10 no.2 s.19
• /
• pp.128-133
• /
• 2006

This paper describes a high speed interface circuit using redundant multi-valued logic for high speed communication ICs. This circuit is composed of encoding circuit that serial binary data are received and converted into parallel redundant multi-valued data, and decoding circuit that converts redundant multi-valued data to parallel binary data. Because of the multi-valued data conversion, this circuit makes it possible to achieve higher operating speeds than that of a conventional binary logic. Using this logic, the proposed 1:4 DEMUX (demultiplexer, serial-parallel converter), was designed using a 0.35um standard CMOS technology. Proposed DEMUX is achieved an operating speed of 4.5Gb/s with a supply voltage of 3.3V and with power consumption of 53mW. The operating speed of this circuit is limited by the maximum frequency which the 0.35um process has. Therefore, this circuit is to achieve CMOS communication ICs with an operating speed greater than 10Gb/s in submicron process of high operating frequency.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.197-206
• /
• 2002

Many researchers have been interested in the optimization of parallel programs through the latency hiding by overlapping the communication with the computation. We ana1yzed overlapping effects in the circular shift communication which is one of the collective communications being frequently used In many data parallel programs. We measured the time which can be possibly overlapped and the time which cannot be overlapped in over all circular shift communication period on an Ethernet switch-based clustered system. The result from each platform nay be used for the input of optimizing compilers. The previous performance models usually have two kinds of drawbacks one is only based on point-to-point communication, so it is not appropriate for analyzing the overall effects of collective communications. The other provides the performance of collective communication, but no overlapping effect. In this paper we extended the previous models and analyzed the experimental results of the extended model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.9
• /
• pp.1778-1784
• /
• 2016

we improved the performance by parallelizing lane detection algorithms. Lane detection, as a intellectual assisting system, helps drivers make an alarm sound or revise the handle in response of lane departure. Four kinds of algorithms are implemented in order as following, Gaussian filtering algorithm so as to remove the interferences, gray conversion algorithm to simplify images, sobel edge detection algorithm to find out the regions of lanes, and hough transform algorithm to detect straight lines. Among parallelized methods, the data level parallelism algorithm is easy to design, yet still problem with the bottleneck. The high-speed data level parallelism is suggested to reduce this bottleneck, which resulted in noticeable performance improvement. In the result of applying actual road video of black-box on our parallel algorithm, the measurement, in the case of single-core, is approximately 30 Frames/sec. Furthermore, in the case of octa-core parallelism, the data level performance is approximately 100 Frames/sec and the highest performance comes close to 150 Frames/sec.

• Journal of IKEEE
• /
• v.3 no.1 s.4
• /
• pp.141-149
• /
• 1999

If signal time duration of MC-CDMA method which has studied for next-generation high-speed data transmission is not sufficiently large compared to delay spread of channel, the performance is degraded by generation of intersymbol interference. In this paper, this problem will solve through serial to parallel convertor and make large sufficiently time duration of signal compared to delay spread of channel and rise variable spectral efficiency through the number of serial to parallel convertor subchannel we will add to parallel frequency diversity block for improve the performance in mobile Communication. Spectral efficiency of the proposed system is counted and compared to spectral efficiency of MC-CDMA and investigated through computer simulations by using multipath Rayleigh fading channel.