• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.109-112
• /
• 2001

This paper proposes an efficient algorithm of extracting anchor blocks for a semantic structure of a news video. We define the FRFD to calculate the frame difference of anchor face position rather than simply uses the general frame difference. Since, The FRFD value is sensitive to existing face in frame, anchor block can be efficiently extracted. In this paper, an algorithm to extract a face position using partial decoded MPEG data is also proposed. In this way a news video can be structured semantically using the extracted anchor blocks.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.109-112
• /
• 2000

Bitstrems corrupted by channel errors are not only difficult to be decoded but also propagate error to other part of the bitstreams when highly compressed video is transmitted over channels with noise such as mobile communication channels. In this paper, error concealment algorithm performed in decoder is proposed when errors occur for transmission. Proposed algorithm searches moving area with homogeneous movement in neighbored blocks when motion vectors are damaged, then recovers motion vectors of missing blocks considering where missing blocks are belong to. Experiment result shows that proposed algorithm exhibits better performance in PSNR than existing error concealment method.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.7
• /
• pp.12-18
• /
• 1993

We have proposed a soft-decision decoding method for block codes. With careful examinations of the first hard-decision decoded results, The candidate codewords are efficiently searched for. Thus, we can reduce the decoding complexity (the number of hard-decision decodings) and lower the block error probability. Computer simulation results are presented for the (23,12) Golay code. They show that the decoding complexity is considerably reduced and the block error probability is close to that of the maximum likelihood decoder.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.5
• /
• pp.24-30
• /
• 1995

A new class of DC-error correcting codes based on convolutional codes is proposed with its performance analysis. The proposed codes can be encoded and decoded using the conventional convolutional encoders and decoders with slight modifications. And the codes have null point at DC and capable of correcting errors. The DC-free error correcting codes are especially well suited for applications in high-speed channels.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1984.04a
• /
• pp.22-24
• /
• 1984

In this paper, the (15,7) cylic codesused EG(2,2) were decoded by one step majority logic decoding. This decoding algorithm is based on the properties of finite geometries and can be simply implemented for moderate length n. especially one step majority logic decoding is attractive because the complexity and the cost of the majority logic decoder increase very rapidly with L, the number of decoding steps. The theorectical and experimental results show that the majority logic decoding presented in this paper is a relatively effective decoding scheme.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.3157-3159
• /
• 2000

Soft Output Viterbi Algorithm is modification of Viterbi algorithm to deliver not only the decoded codewords but also a posteriori probability for each bit. This paper presents SOVA decoder which can be used for component decoder of turbo decoder. We used two-step SMU architectures combined with systolic array traceback methods to reduce the complexity of the design. We followed the specification of CDMA2000 system for SOVA decoder design.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.69-70
• /
• 2007

The code division multiple access (CDMA) system capacity is limited by the amount of interference of the system. To reduce the unnecessary interference, this paper proposes optimized cell identification (ID) codes for site selection diversity transmission (SSDT) power control in wideband code division multiple access system of third generation partnership project (3GPP). The proposed SSDT cell ID codes are designed to minimize the problem and to be easily decoded using simple fast Hadamard transformation (FHT) decoder.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.565-574
• /
• 2002

We propose an algorithm for the robust transmission of video in error prone environment based on multiple description (MD) scheme and simple rate-distortion operators. The redundancy rate-distortion (RRD) criteria is used to split a one-layer compressed video stream into two correlated descriptions. The proposed algorithm can find more candidate points on the RRD curve than the conventional RRD based methods. A new distortion measure is also defined in this paper, which considers more realistic error environments. Since the proposed MD video coder is based on the standard H.263 coder, each description can be decoded independently by the standard H.263 decoder. Also, several descriptions can be decoded into a single stream by additional merge stage and the H.263 decoder. Simulation results show that the proposed MD video coder yields better performance than the conventional MD splitting algorithm at all bitrates both in single and two description cases.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.7
• /
• pp.387-396
• /
• 2004

In this paper, we propose an algorithm that distributes processor time to the tasks decoding encoded frames with a goal maximizing total QoS (quality of services) of video conference system. An encoded frame has such a characteristic that the QoS of recovered frame image also increases as the processor time given for decoding the frame gets to increase. Thus, the quality of decoded image for each frame can be represented as a QoS function of the amount of service time given to decode. In addition, every stream of video conference has close time-dependency between continuous frames belonging to the same stream. Based on the time-dependency and QoS functions, we propose an on-line frame scheduling algorithm which does not schedule all frames in the system but just a few frames while maximizing total QoS of video streams in the conference. The simulation results show that, as the system load gets to increase, the proposed algorithm compared to the existing EDF algorithm can reduce the quality of decoded frame images more smoothly and show the movements of conference attendees more naturally without short cutting.

• Journal of Broadcast Engineering
• /
• v.11 no.2 s.31
• /
• pp.164-173
• /
• 2006

The data structure of the concentric mosaic can be regarded as a video sequence with a slowly panning camera. We take a concentric mosaic with match or alignment of video sequences. Also the concentric mosaic required for huge memory. Thus, compressing is essential in order to use the concentric mosaic. Therefore we need the algorithm that compressed data structure was maintained and the scene was decoded. In this paper, we used 3D lifting transform to compress concentric mosaic. Lifting transform has a merit of wavelet transform and reduces computation quantities and memory. Because each frame has high correlation, the complexity which a scene is detected form 3D transformed bitstream is increased. Thus, in order to have higher performance and decrease the complexity of detecting of a scene we executed 3D lifting and then transformed data set was sequently compressed with each frame unit. Each frame has a flexible bit rate. Also, we proposed the algorithm that compressed data structure was maintained and the scene was decoded by using property of lifting structure.