• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9C
• /
• pp.846-852
• /
• 2006

The ${\kappa}$-error linear complexity is a ky measure of the stability of the sequences used in the areas of communication systems, stream ciphers in cryptology and so on. This paper introduces an efficient algorithm to determine the ${\kappa}$-error linear complexity and the corresponding error vectors of $p^m$-periodic binary sequences, where : is a prime and 2 is a primitive root modulo $p^2$. We also give a new sense about the ${\kappa}$-error linear complexity in viewpoint of coding theory instead of cryptographic results. We present an efficient algorithm for decoding binary cyclic codes of length $p^m$ and derive key properties of the minimum distance of these codes.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.132-140
• /
• 2011

Ultra-High Definition Television (U-HDTV) is a promising candidate for the next generation television. Since the U-HDTV video signal requires a huge amount of data, parallel implementation of the U-HDTV compression system is highly demanding. In the conventional parallel video codec, a video is divided into sub-sequences and the sub-sequences are independently encoded. In this paper, for efficient parallel processing, we propose a pipelined encoding structure which exploits cross-correlation among the sub-sequences. The experimental results demonstrate that the proposed technique improves the coding efficiency and provides the sub-sequences of the balanced visual quality.

• Proceedings of the Botanical Society of Korea Conference
• /
• 1987.07a
• /
• pp.261-282
• /
• 1987

Plants store a significant amount of their nitrogen, sulfur and carbon reserves as storage proteins in seed tissues. The major proteins present in rice seeds are the glutelins. Glutelins are initially synthesized at 4-6 days postanthesis and deposited into protein bodies via Golgi apparatus. Based on nucleic acid sequences and Southern blot analysis, the three isolated glutelin genomic clones were representative members of three gene subfamilies each containing 5 to 8 copies. A comparison of DNA sequences displayed by relevant regions of these genomic clones showed that two subfamilies, represented by clones, Gt1 and Gt2, were closely, related and probably evolved by more recent gene duplication events. The 5' flanking and coding sequences of Gt1 and Gt2 displayed at least 87% homolgy. In contrast, Gt3 showed little or no homolgy in the 5' flanking sequences upstream of the putative CAAT boxes and exhibited significant divergence in all other portions of the gene. Conserved sequences in the 5' flanking regions of these genes were identified and discussed in light of their potential regulatory role. The derived primary sequences of all three glutelin genomic clones showed significant homology to the legume 11S storage proteins indicating a common gene origin. A comparison of the derived glutelin primary sequences showed that mutations were clustered in three peptide regions. One peptide region corresponded to the highly rautable hypervariable region of legume peptide region of legume 11S storage proteins, a potential target area for protein modification. Expression studies indicated that glutelin mRNA transcripts are differentially accumulated during endosperm development. Promoterss of Gt2 and Gt3 were functional as they direct transient expression of chloramphenicol acetyltransferase in cultured plant cell.

• Journal of Broadcast Engineering
• /
• v.19 no.2
• /
• pp.257-267
• /
• 2014

Distributed compressive video sensing (DCVS) is a low cost sampling paradigm for video coding based on the compressive sensing and the distributed video coding. In this paper, we propose using a skip-mode coding in DCVS under the assumption that in case of high temporal correlation, temporal interpolation can guarantee sufficiently good quality of nonkey frame, therefore no need to transmit measurement data in such a nonkey frame. Furthermore, we extend it to use a hierarchical structure for better temporal interpolation. Simulation results show that the proposed skip-mode coding can save the average subrate of whole video sequence while the PSNR is reduced only slightly. In addition, by using the proposed scheme, the computational complexity is also highly decreased at decoder on average by 43.75% for video sequences that have strong temporal correlation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.6 s.312
• /
• pp.97-104
• /
• 2006

The state-of-the-art H.264/AVC standard was designed for the lossy video coding so that it could not yield the best performance for lossless video coding. In this paper, we propose two efficient intra lossless coding methods by embedding a pixel-wise prediction into the H.264/AVC. One is based on the pixel-wise prediction for the residual signal of the H.264/AVC intra Prediction and the other suggests a newly additional intra prediction mode for the conventional intra prediction. We found that the proposed lossless coding algorithms could achieve approximately $12%{\sim}25%$ more bit saving compared to the H.264/AVC FRExt high profile for several test sequences in terms of a compression ratio.

• Journal of Broadcast Engineering
• /
• v.16 no.3
• /
• pp.510-519
• /
• 2011

Intra mode decision is a useful coding tool in Distributed Video Coding (DVC) for improving DVC coding efficiency for video sequences having fast motion. A major limitation associated with the existing intra mode decision methods, however, is that its efficiency highly depends on user-specified thresholds or modeling parameters. This paper proposes an entropy-based method to address this problem. The probabilities of intra and Wyner?Ziv (WZ) modes are determined firstly by examining correlation of pixels in spatial and temporal directions. Based on these probabilities, entropy of the intra and the WZ modes are computed. A comparison based on the entropy values decides a coding mode between intra coding and WZ coding without relying on any user-specified thresholds or modeling parameters. Experimental results show its superior rate-distortion performance of improvements of PSNR up to 2 dB against a conventional Wyner?Ziv coding without intra mode decision. Furthermore, since the proposed method does not require any thresholds or modeling parameters from users, it is very attractive for real life applications.

• Journal of Broadcast Engineering
• /
• v.16 no.3
• /
• pp.448-461
• /
• 2011

H.264/AVC significantly outperforms the previous video coding standards with many new coding tools. Among these tools, several intra-block coding tools can particularly improve coding efficiency. For intra prediction, H.264/AVC supports most probable mode in the entropy coding process to reduce syntax elements indicating intra prediction modes and most probable mode selection ratio is very high. Also, in general, natural images and videos have many homogeneous regions whose high correlation with neighbouring blocks. In this paper, we propose intra prediction mode SKIP mode using decoder-side prediction to improve the coding efficiency. The proposed method is determined the optimal prediction mode using only neighbouring block's information and coded on the basis of the conventional prediction/transform coding. And the prediction modes are not send to decoder at all. Skipped intra prediction mode is determined by decoder. Experimental results show that the proposed method achieves coding gains of 1.40% for common intermediate format(CIF), 3.24% for 720p sequences against the H.264/AVC JM 17.0 reference software.

• The KIPS Transactions:PartB
• /
• v.18B no.5
• /
• pp.249-254
• /
• 2011

FGS (fine granularity scalability) supporting scalability in MPEG-4 Part 2 is a scalable video coding scheme that provides bit-rate adaptation to varying network bandwidth thereby achieving of its optimal video quality. In this paper, we proposed FGS coding scheme which performs one more bit-plane coding for residue signal occured in the enhancement-layer of the basic FGS coding scheme. The experiment evaluated in terms of video quality scalability of the proposed FGS coding scheme by comparing with FGS coding scheme of the MPEG-4 verification model (VM-FGS). The comparison was conducted by analysis of PSNR values of three tested video sequences. The results showed that when using rate control algorithm VM5+, the proposed FGS coding scheme obtained Y, U, V PSNR of 0.4 dB, 9.4 dB, 9 dB averagely higher and when using fixed QP value 17, obtained Y, U, V PSNR of 4.61 dB, 20.21 dB, 16.56 dB averagely higher than the existing VM-FGS. From results, we found that the proposed FGS coding scheme has higher video quality scalability to be able to achieve video quality from minimum to maximum than VM-FGS.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.41-44
• /
• 2001

Variable length coding (VLC) has been used in many well known standard video coding algorithms such as MPEG and H.26x. However, VLC can not be processed parallelly because of its sequentiality. This sequentiality is a big barrier for implementing a real-time software video codec since parallel schemes can not be applied. In this paper, we propose a new fast VLD (Variable Length Decoding) method based on the probabilistic distribution of symbols in VLC tables used in MPEG as well as H.263 standard codecs. Even though MPEG suggests the table partitioning method, they do not show theoretically why the number of partitioned tables is two or three. We suggest the method for deciding the number of partitioned tables. Applying our scheme to several well-known MPEG-2 test sequences, we can reduce the computational time up to about 10% without any sacrificing video quality

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.11a
• /
• pp.249-251
• /
• 2019

In the ongoing standardization of Versatile Video Coding (VVC), DCT-2, DST-7 and DCT-8 are designated as the vital primary transform kernels. Due to the effectiveness of DST-4 and DCT-4 in smaller resolution sequences, DST-4 and DCT-4 transform kernel can also be used as the replacement of the DST-7 and DCT-8 transform kernel respectively. While storing all of those transform kernels, ROM memory storage is considered as the major issue. So, to deal with this scenario, a unified DST-3 based transform kernel derivation method is proposed in this paper. The transform kernels used in this paper is DCT-2, DST-4 and DCT-4 transform kernels. The proposed ROM memory required to store the matrix elements is 1368 bytes each of 8-bit precision.