• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1379-1382
• /
• 1997

We introduce a fast implementation of the adaptive transversal filter which uses least-mean-square(LMS) algorithm. The fast Hadamard transform(FHT) is used for the implementation of the filter. By using the proposed filter we can get the significant time reduction in computatioin over the conventional time domain LMS filter at the cost of a little performance. By computer simulation, we show the comparison of the propsed Hadamard-domain filter and the time domain filter in the view of multiplication time, mean-square error and robustness for noise.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1649-1657
• /
• 2005

In this paper, a fast implementation of JPEG is discussed and its application to multimedia service is presented for mobile wireless internet. A fast JPEG player is developed based on several fast algorithms for mobile handset. In the color transformation, RCT is adopted instead of ICT for JPEG source. For the most time-consuming DCT part, the binDCT can reduce the decoding time. In upsampling and RGB conversion, the transformation from YCbCr to RGB 16 bit is made at one time. In some parts, assembly language is applied for high-speed. Also, an implementation of multimedia in mobile handset is described using MJPEG (Motion JPEG) and QCELP(Qualcomm Code Excited Linear Prediction Coding). MJPEG and QCELP are used for video and sound, which are synchronized in handset. For the play of MJPEG, the decoder is implemented as a S/W upon the MSM 5500 baseband chip using the fast JPEG decoder. For the play of QCELP, the embedded QCELP player in handset is used. The implemented multimedia player has a fast speed preserving the image quality.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.4
• /
• pp.800-807
• /
• 2007

Web services came true a services integration, but the XML document decreases the efficiency or the whole application program with connects frequently in relatively slow communication media like network environment embedded system or use the resource limited small-sized instrument like mobile. Thereupon, ITU-T and ISO/IEC suggested encoding standard of binary XML. In this paper, implementation, of Fast XML encoding system through introduction Fast Infoset algorithm and Fast Schema algorithm for web services increase performance. And, offered of test bed that build of Fast Web Services system through Fast XML Encoder.

• The Journal of Korea Robotics Society
• /
• v.4 no.4
• /
• pp.305-311
• /
• 2009

FastSLAM is a factored solution to SLAM problem using a Rao-Blackwellized particle filter. In this paper, we propose a practical FastSLAM implementation method using an infrared camera for indoor environments. The infrared camera is equipped on a Pioneer3 robot and looks upward direction to the ceiling which has infrared tags with the same height. The infrared tags are detected with theinfrared camera as measurements, and the Nearest Neighbor method is used to solve the unknown data association problem. The global map is successfully built and the robot pose is predicted in real time by the FastSLAM2.0 algorithm. The experiment result shows the accuracy and robustness of the proposed method in practical indoor environment.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.3
• /
• pp.39-52
• /
• 2009

Scale Invariant Feature Transform (SIFT) is an effective algorithm in object recognition, panorama stitching, and image matching, however, due to its complexity, real time processing is difficult to achieve with software approaches. This paper proposes using a reconfigurable hardware processor with integer half kernel. The integer half kernel Gaussian reduces the Gaussian pyramid complexity in about half [] and the reconfigurable processor carries out a parallel implementation of a full search Fast SIFT algorithm. We use a low memory, fine grain single instruction stream multiple data stream (SIMD) pixel processor that is currently being developed. This implementation fully exposes the available parallelism of the SIFT algorithm process and exploits the processing and I/O capabilities of the processor which results in a system that can perform real time image and video compression. We apply this novel implementation to images and measure the effectiveness. Experimental simulation results indicate that the proposed implementation is capable of real time applications.

• Proceedings of the KIPE Conference
• /
• 1998.10a
• /
• pp.1-6
• /
• 1998

To achieve fast control action, direct control methods should be used. "Direct Mean Torque Control" (DMTC) combines the good dynamic performance of Direct Torque Control (DTC) with the advantages of inherently constant switching frequency and time equidistant control for implementation in a digital signal processor. Since DMTC is a predictive control algorithm, the model and its correction deserves special investigations. This paper proposes a steady-state Kalman filter which is well suited for fast computation.mputation.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.4
• /
• pp.79-85
• /
• 2018

This paper presents an implementation method of Long Term Evolution-Advanced (LTE-A) Physical Downlink Shared Channel (PDSCH) decoder using a general-purpose multicore Digital Signal Processor (DSP), TMS320C6670. Although the DSP provides some useful coprocessors such as turbo decoder, fast Fourier transformer, Viterbi Coprocessor, Bit Rate Coprocessor etc., it is specific to the base station platform implementation not the mobile terminal platform implementation. This paper shows an implementation method of the LTE-A PDSCH decoder using programmable DSP cores as well as the coprocessors of Fast Fourier Transformer and turbo decoder. First, it uses the coprocessor supported by the TMS320C6670, which can be used for PDSCH implementation. Second, we propose a core programming method using DSP optimization method for block diagram of PDSCH that can not use coprocessor. Through the implementation, we have verified a real-time decoding feasibility for the LTE-A downlink physical channel using test vectors which have been generated from LTE-A Reference Measurement Channel (RMC) Waveform R.6.

• Korean Management Science Review
• /
• v.17 no.2
• /
• pp.1-12
• /
• 2000

In this study, we deals with the implementation of an optimal basis identification procedure for interior point methods. Our implementation is based on Megiddo’s strongly polynomial algorithm applied to Andersen and Ye’s approximate LP construction. Several techniques are explained such as the use of effective indicator for obtaining optimal partition when constructing the approximate LP, the efficient implementation of the problem reduction technique proposed by Andersen, the crashing procedure needed for fast dual phase of Megiddo’s algorithm and the construction of the stable initial basis. By experimental comparison, we show that our implementation is superior to the crossover scheme implementation.

• Journal of IKEEE
• /
• v.17 no.3
• /
• pp.371-377
• /
• 2013

This thesis propose an efficient parallel structure method for implementing a FAST and BRIEF algorithm based Augmented Reality. SURF algorithm that is well known in the object recognition algorithms is robust in object recognition. However, there is a disadvantage for real time operation because, SURF implementation requires a lot of computation. Therefore, we used a FAST and BRIEF algorithm for object recognition, and we improved Conventional Parallel Structure based on OpenMP Library. As a result, it achieves a 70%~100% improvement in execution time on the embedded system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6C
• /
• pp.637-644
• /
• 2006

This paper presents performance and implementation comparisons of standard and fast DCT algorithms that are commonly used for subband filter bank in MPEG audio coders. The comparison is made according to the architectural difference of the implementation hardware. Fast DCT algorithms are known to have much less computational complexity than the standard method that involves computing a vector dot product of cosine coefficient. But, due to structural irregularity, fast DCT algorithms require extra cycles to generate the addresses for operands and to realign interim data. When algorithms are implemented using DSP processors that provide special operations such as single-cycle MAC (multiply-accumulate), zero-overhead nested loop, the standard algorithm is more advantageous than the fast algorithms. Also, in case of the finite-precision processing, the error performance of the standard method is far superior to that of the fast algorithms. In this paper, truncation errors and algorithmic suitability are analyzed and implementation results are provided to support the analysis.