• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.859-862
• /
• 1998

Many playback methods of MPEG-1 video were developed and are have beendeveloped now. But nomal playback method demands great time. In this paper we designed and implemented the scene transition playback method of the MPEG-1 video data. The previous studies of scene transition playback have used to the DC or edge information after decoding process of picture. In this paper, scene transition is detected by macroblock information from MPEG-1 compressed area, then decodes and playbacks the only scene transition picture. This MPEG-1 video player was implemented by decoding control. So it is possible to add special playback method to MPEG-1 video player. As the result, which is proposed in this paper the scene transition method can minimize to decoding calculation and decrease to playback time of the MPEG-1 video data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2479-2496
• /
• 2013

Increasing demand for Full High-Definition (FHD) video and Ultra High-Definition (UHD) video services has led to active research on high speed video processing. Widespread deployment of multi-core systems has accelerated studies on high resolution video processing based on parallelization of multimedia software. Even if parallelization of a specific decoding step may improve decoding performance partially, such partial parallelization may not result in sufficient performance improvement. Particularly, entropy decoding has often been considered separately from other decoding steps since the entropy decoding step could not be parallelized easily. In this paper, we propose a parallelization technique called Integrated Multi-Threaded Parallelization (IMTP) which takes parallelization of the entropy decoding step, with other decoding steps, into consideration in an integrated fashion. We used the Simultaneous Multi-Threading (SMT) technique with appropriate thread scheduling techniques to achieve the best performance for the entire decoding step. The speedup of the proposed IMTP method is up to 3.35 times faster with respect to the entire decoding time over a conventional decoding technique for H.264/AVC videos.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.873-879
• /
• 2010

In this paper, MPEG2(Moving Picture Expert Group 2) image data video decoding technique is presented, it is Huffman decoding method and fractal image method which is very complexive algorithm and have too much times to implement this method. This have defect of overlap decoding and transport work because of impossible to represent objective value of resemblance. The proposed method was calculated the mathematical absolute image resemblance and simplify the moving picture process to reducing the step of moving picture codefying. The results show that smoothed moving picture compared recent methods.

• ETRI Journal
• /
• v.31 no.3
• /
• pp.336-338
• /
• 2009

This letter proposes a complexity reduction method to speed up the noiseless decoding of a bit-sliced arithmetic coding (BSAC) decoder. This scheme fully utilizes the group of consecutive arithmetic-coded symbols known as the decoding band and the significance tree structure sorted in order of significance at every decoding band. With the same audio quality, the proposed method reduces the number of calculations that are performed during the noiseless decoding in BSAC to about 22% of the amount of calculations with the conventional full-search method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10A
• /
• pp.976-981
• /
• 2006

In this paper, we describe a hybrid ZF-SD method. The method is based on dimensionality reduction via predecoding and cancellation of those symbols that can be quickly and reliably detected by a linear decoder. The proposed method shows BER performance similar to SD but with much lower computational complexity than SD.

• Journal of IKEEE
• /
• v.19 no.3
• /
• pp.455-459
• /
• 2015

This paper proposes a dispatch unit of GP-GPU with SIMT architecture to support the acceleration of general-purpose operation as well as graphics processing. If all the information of an operand used instructions issued from the warp scheduler is decoded, an unnecessary operand load occurs, resulting in register loads. To resolve this problem, this paper proposes a method that can reduce the operand load and the load on the resister by decoding only the information of the operand using a pre-decoding method. The operand information from the dispatch unit is passed to the operand selection unit with preventing register bank collisions. Thus the overall performance are improved. In the simulation test, the total clock cycles required by processing 10,000 arbitrary instructions issued from the wrap scheduler using ModelSim SE 10.0b are measured. It shows that the application of the dispatch unit equipped with the pre-decoding function proposed in this paper can make an improvement of about 12% in processing performance compared to the conventional method.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.8
• /
• pp.816-822
• /
• 2003

In this paper, we propose an efficient iteration control method with low complexity for Turbo TCM(Turbo Trellis Coded Modulation) decoding which will be used fur power-limited environment. As the decoding approaches the performance limit of a given turbo code, any further iteration results in very little improvement. Therefore, it is important to devise an efficient criterion to stop the iteration process and prevent unnecessary computations and decoding delay. This paper presents an efficient algorithm for turbo TCM decoding that can greatly reduce the delay and iteration number. The proposed method use adaptive iteration number according to the criterion using the extrinsic information variance parameter in turbo TCM decoding process. The simulation results show that the proposed technique effectively can reduce the decoding delay and computation with very little performance degradation.

• ETRI Journal
• /
• v.25 no.2
• /
• pp.144-147
• /
• 2003

We propose a new serial concatenation scheme for space-time and recursive convolutional codes, in which a space-time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner code. Simulation results for a communication system with two transmit and one receive antennas in a quasi-static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.59 no.1
• /
• pp.53-57
• /
• 2010

Low-density parity-check (LDPC) codes with belief-propagation (BP) algorithm achieve a remarkable performance close to the Shannon limit at reasonable decoding complexity. Conventionally, each iteration in decoding process contains two steps, the horizontal step and the vertical step. In this paper, an efficient implementation of the adaptive offset min-sum (AOMS) algorithm for decoding LDPC codes using the single-step method is proposed. Furthermore, the performances of the AOMS algorithm compared with belief-propagation (BP) algorithm are investigated. The algorithms using the single-step method reduce the implementation complexity, speed up the decoding process and have better efficiency in terms of memory requirements.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.353-360
• /
• 2004

In this Paper, We propose an efficient iteration decoding control method with variable iteration decoding of iteration codes decoding using Cyclic Redundancy Check. As the number of iterations increases, the bit error rate and frame error rate of the decoder decrease and the incremental improvement gradually diminishes. However, when the iteration decoding number is increased, it require much delay and amount of processing time for decoding. Also, It can be observed the error nor that the performance cannot be improved even though increasing of the number of iterations and SNR. So, Suitable number of iterations for stopping criterion is required. we propose variable iteration control method to adapt variation of channel using Frame Error-Check indicator. Therefore, the amount of computation and the number of iterations required for iteration decoding with CRC method can be reduced without sacrificing performance.