• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.5
• /
• pp.35-42
• /
• 2008

In this paper, we propose a fast coeff_token decoding method based on the re-constructed VLCT. Since the conventional decoding method is still based on large memory accesses, it is not suitable for the multimedia services such as PMP, PMB, DVH-H where fast decoding and low power consumption are required. Based on the analysis for the codeword structure, new structure of the codeword and the corresponding memory architecture are developed in this paper. The simulation results show that the proposed algorithm achieves memory access saving from 10% to 57%, compared to the conventional decoding method. This meant that the issues of tow power consumption and high speed decoding can be resolved without video-quality and coding efficiency degradation.

• The KIPS Transactions:PartB
• /
• v.12B no.2 s.98
• /
• pp.173-180
• /
• 2005

In this paper, we propose an efficient real-time scheduling method of multimedia tasks for decoding frames of MPEG-2 video streams. In our task model, each frame is decoded by a separate multimedia task. The decoding task for each frame is assigned to the priority according to the precedence and importance of frames in a video stream. We use a priority-based scheduling policy in order to effectively allocate the CPU bandwidth to multimedia tasks for MPEG-2 decoding. We show how to dynamically control the fraction of the CPU bandwidth allocated to each multimedia task according to the priority. The primary purpose of our scheduling method is to enhance the real-time performance of the multimedia system by minimizing the number of decoding tasks that have missed their deadlines while reducing the decoding times of these multimedia tasks. The performance of this scheduling method is compared with that of similar mechanisms through simulation experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.434-441
• /
• 2005

For LDPC decoding, received symbols are splitted bit by bit based using the received in-phase and quadrature components. The method of bit-splitting is affected on decoding performance because its method depend on distance over symbol constellation. Therefore this paper propose the bit split method using the sector information with sacrifice a little performance loss compared to Euclidean distance method. Futhermore DVB-S2 specification supports BC(Backward Compactible) mode which using the hierarchical modulation method, this paper also analyze the decoding performance according to deviation angle of 8PSK constellation for various LDPC coding rates.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.187-194
• /
• 2011

In this paper, JPEG(Joint Photographic Experts Group) image data video decoding technique is presented, it is Huffman decoding method and fractal image method which is very complexive algorithm and the time required much it to implement this method and the first image is decoded to video frame image. 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.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.2
• /
• pp.45-52
• /
• 2020

This paper is focused on the modulation scheme detection of the IEEE 802.11 standard. In the IEEE 802.11ac standard, the information of the modulation scheme is indicated by the modulation coding scheme (MCS) included in the VHT-SIG-A of the preamble field. Transmitting end determines the MCS index suitable for the low signal to noise ratio (SNR) situation and transmits the data accordingly. Since data field decoding can take place only when the receiving end acquires the MCS index information of the frame. Therefore, accurate MCS detection must be guaranteed before data field decoding. However, since the MCS index information is the information obtained through preamble field decoding, the detection rate can be affected significantly in a low SNR situation. In this paper, we propose a relatively robust modulation classification method based on deep learning to solve the low detection rate problem with a conventional method caused by a low SNR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.564-575
• /
• 1996

Conventional decoding procedures have some problems in order to obtain reconstructed images with high speed. In this paper, the solutions of these are studied and a new fast decoding algorithm is proposed. The proposed algorithm uses a convergence criterion that is used to reduce the redundant iteration in the conventional method and to determine continuation of decoding. The initical image similar to roiginal image is estimated firstly in this algorithm. From the simulation resuls, the proposed algorithm is able to achieve the reconstructed image within 3-4 iteration under the objective criterion. Without any increment of the memory, the quality of the image reconstructed by the proposed algorithm has same quality asthe conventional method.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.8
• /
• pp.74-83
• /
• 1997

In this paper, we propose a new fractal image decoding algorithm with fast convergence speed by using the data dependence and the improved initial image estimation. Conventional method for fractal image decoding requires high-degrdd computational complexity in decoding process, because of iterated contractive transformations applied to whole range blocks. On proposed method, Range of reconstruction imagte is divided into referenced range and data dependence region. And computational complexity is reduced by application of iterated contractive transformations for the referenced range only. Data dependence region can be decoded by one transformations when the referenced range is converged. In addition, more exact initial image is estimated by using bound () function in case of all, and an initial image more nearer to a fixed point is estimated by using range block division estimation. Consequently, the convergence speed of reconstruction iamge is improved with 40% reduction of computational complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.485-499
• /
• 2021

Although non-binary low-density parity-check (NB-LDPC) codes have better error-correction capability than that of binary LDPC codes, their decoding complexity is significantly higher. Therefore, it is crucial to reduce the decoding complexity of NB-LDPC while maintaining their error-correction capability to adopt them for various applications. The extended min-sum (EMS) algorithm is widely used for decoding NB-LDPC codes, and it reduces the complexity of check node (CN) operations via message truncation. Herein, we propose a low-cost CN processing method to reduce the complexity of CN operations, which take most of the decoding time. Unlike existing studies on low complexity CN operations, the proposed method employs quick selection algorithm, thereby reducing the hardware complexity and CN operation time. The experimental results show that the proposed selection-based CN operation is more than three times faster and achieves better error-correction performance than the conventional EMS algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1892-1897
• /
• 2012

In this paper, efficient CNU(Check Node Update) algorithms are analyzed for high speed LDPC decoding in DVB-S2 standard. In aspect to CNU methods, there are some kinds of CNU methods. Among of them, MP (Min Product) method is quite often used in LDPC decoding. However MP needs LUT (Look Up Table) that is critical path in LDPC decoding speed. A new SC-NMS (Self-Corrected Normalized Min-Sum) method is proposed in the paper. NMS needs only normalized scaling factor instead of LUT and compensates the overestimation of MP approximation. In addition, SC method is proposed. It gives a faster convergence toward a decoded codeword. If a message change its sign between two iterations, it is not reliable and to avoid to propagate noisy information, its module is set to 0. The performance of SC-NMS has a little degrade compare to MP by 0.1 dB, however considering computational complexity and decoding speed, SC-NMS algorithm is optimal method for CNU algorithm.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.9
• /
• pp.1088-1095
• /
• 1999

This paper presents short-term hydro scheduling method for hydrothermal coordination by genetic algorithms. Hydro scheduling problem has many constraints with fixed final reservoir volume. In this paper, the difficult water balance constraints caused by hydraulic coupling satisfied throughout dynamic decoding method. Adaptive penalizing method was also proposed to handle the infeasible solutions that violate various constraints. In this paper, we proposed GA to solve hydrothermal scheduling with appropriate decoding method and dynamic penalty method. The effectiveness of the proposed method is demonstrated in the case study.