• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.92-103
• /
• 2012

In this paper, we discuss and propose a new algorithm of coding technique for scalably servicing holographic video in various decoding environment. The proposed algorithm consists of the hologram-based resolution scalable coding (HRS) and the light source-based SNR scalable coding (LSS). They are classified by the method generating and capturing hologram. HRS is a scalable coding technique for the optically captured hologram and LSS is one for the light source before generating hologram. HRS can provide the scalable service of 8 steps with the compression ratio from 1:1 to 100:1 for a $1,024{\times}1,024$ hologram. LSS can also provide the various service depending on the number of the light source division using lossless compression. The proposed techniques showed the scalable holographic video service according to the display with the various resolutions, computational power of the receiving equipment, and the network bandwidth.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.31-40
• /
• 2008

Various coding styles for C language have been proposed so far but there has been a lack of synthetic review about them. In this paper, I propose a new C coding style by analyzing coding rules that are included in the representative C coding styles and by adding new coding rules besides them. In addition, I designed an automated C coding style checker named CStyler which was implemented using Lex and Yacc. It is designed to be able to verify unpreprocessed source code as well as preprocessed source code. And I improved its flexibility by being able to add a new coding rule by end user. I think that the new C coding style and coding style checker, CStyler, can be utilized for education and for future research to develop and extend a static analysis tool.

• International Journal of Advanced Culture Technology
• /
• v.9 no.1
• /
• pp.203-209
• /
• 2021

When carrying out computer programming, the process of checking and correcting errors in the source code is essential work for the completion of the program. Non-computer majors who are learning programming for the first time receive feedback from instructors to correct errors that occur when writing the source code. However, in a learning environment where the time for the learner to practice alone is long, such as an online learning environment, the learner starts to feel many difficulties in solving program errors by himself/herself. Therefore, training on how to check and correct errors after writing the program source code is necessary. In this paper, various types of errors that can occur in a Python program were described, the errors were classified into simple errors and complex errors according to the characteristics of the errors, and the distributions of errors by Python grammar category were analyzed. In addition, a coding learning process to refer error lists was designed to present a coding learning method that enables learners to solve program errors by themselves.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.3
• /
• pp.50-55
• /
• 2001

We review error resilience techniques for real-time video transport over unreliable networks. For error control on the source coding level, each decoder has to make provisions for error detection, resynchronization. and error concealment. and we review techniques suitable for that purpose. Further, techniques are discussed for intelligent processing of acknowledgment information by the coding control to adapt the source coder to the channel. We review and compare error tracking, error confinement. and reference picture selection techniques for channel-adaptive source coding. We review how feedback-based source codings are related with the precompressed video stored on a media server

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.686-710
• /
• 2019

This work proposes a model to solve the problem of Network Coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.3-10
• /
• 2015

Application of polar codes to rate-adaptive asymmetric Slepian-Wolf coding is considered. We propose a method of constructing polar codes which supports rate adaptivity. The proposed polar distributed source coding with successive cancellation list decoding performs closer to the Slepian-Wolf bound than the low density parity check accumulate (LDPCA) codes in the same framework.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2074-2079
• /
• 1997

Much recent work has been done in the two related areas of source coding for data compression, and channel coding for data storage, respectively. We propose two (0, k) run-lengh limited(RLL) data compression codes for the storage that combine source and channel coding. It was shown that the propsoed codes approach the maximum code rate of (0, k) code as k increase. Thus, the overall code rate of storage system can be increased by using the combined source/channel coding as compared to the conventional 8/9 code which is popular in hard drive systems Functhermore, one can also reduce the complexity of modulation coding procedure by using already RLL constrained data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.329-336
• /
• 2010

Distributed source coding (DSC) system moves computational burden from encoder to decoder, so it takes higher decoding complexity. This paper explores the problem of reducing the decoding complexity of practical Slepian-Wolf coding using low-density parity check accumulate (LDPCA) codes. It is shown that the convergence of mean magnitude (CMM) stopping criteria for LDPC codes help reduce the 85% of decoding complexity under the 2% of compression rate loss, and marginal initial rate request reduces complexity below complexity minimum bound. Moreover, inter-rate stopping criterion, modified for rate-adaptable characteristic, is proposed for LDPCA codes, and it makes decoder perform less iterative decoding than normal stopping criterion does when channel characteristic is unknown.

• ETRI Journal
• /
• v.33 no.2
• /
• pp.155-162
• /
• 2011

The scalable extension of the H.264/AVC video coding standard (SVC) demonstrates superb adaptability in video communications. Joint source and channel coding (JSCC) has been shown to be very effective for such scalable video consisting of parts of different significance. In this paper, a new JSCC scheme for SVC transmission over packet loss channels is proposed which performs two-dimensional optimization on the quality layers of each frame in a rate-distortion (R-D) sense as well as on the temporal hierarchical structure of frames under dependency constraints. To compute the end-to-end R-D points of a frame, a novel reduced trellis algorithm is developed with a significant reduction of complexity from the existing Viterbi-based algorithm. The R-D points of frames are sorted under the hierarchical dependency constraints and optimal JSCC solution is obtained in terms of the best R-D performance. Experimental results show that our scheme outperforms the existing scheme of [13] with average quality gains of 0.26 dB and 0.22 dB for progressive and non-progressive modes respectively.

• MALSORI
• /
• no.53
• /
• pp.157-169
• /
• 2005

This paper proposes an efficiently representing method of spatial cues on multichannel spatial audio coding. The Binaural Cue Coding (BCC) method introduced recently represents multichannel audio signals by means of Inter Channel Level Difference (ICLD) or Source Index (SI). We tried to express more efficiently ICLD and SI information based on Inter Channel Correlation in this paper. We adopt different spatial cues according to ICC and propose a compensation method of empty spectrums created by using SI. We performed a MOS test and measuring spectral distortion. The results show that the proposed method can reduce the bitrate of side information without large degradation of the audio quality.