• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.389-392
• /
• 2017

Previously, PCC and RFCC were proposed for the network coding possibility test of flow-intersecting nodes in a multi-hop wireless network. PCC works correctly only if there is only one intersecting node. RFCC solves this problem by defining the network coding conditions with considering decoding possibility at intermediate nodes. However, this may increase decoding possibility test overhead and coding operations at intermediate nodes. In this paper, we define DCC which can decrease this overhead by allowing decoding only at destinations. We analyze the performance of DCC by simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2325-2332
• /
• 1998

In this paper, the quality scalable coding of selected region is presented. If a region is semantically more important than the others, it is appropriate that the image compression shcem is capable of handling the regional semantic difference because the information loss of the region of interest is more severe. We propose the quality scalable coding with its model by interoducing the quality scale parameter. It is more extended and generalized image compression philosophy than te conventional coding. As an implementation of the proposed quality scalable coding, H.263 based scheme is presented. This scheme can control the temporal and spatial quality efficiently, and improve the reconstructed image quality of the region of interest.

• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.119-127
• /
• 2008

Transmission of video over Internet or wireless network requires coded stream capable of adapting to dynamic network conditions instantly. To meet this requirement, various scalable video coding schemes have been developed, among which the Scalable Video Coding (SVC) extension of the H.264/AVC is the most recent one. In comparison with the scalable profiles of previous video coding standards, the SVC achieves significant improvement on coding efficiency performance. For adapting to dynamic network bandwidth, the SVC employs inter-layer switching between different temporal, spatial or/and fidelity layers, which is currently supported with instantaneous decoding refresh (IDR) access unit. However, for real-time adaptability, the SVC has to frequently employ the IDR picture, which dramatically decreases the coding efficiency. Therefore, an extension of SP picture from the AVC to the SVC for an efficient inter-layer switching is investigated and presented in this paper. Simulations regarding the adaptability to dynamic network bandwidth are implemented. Results of experiment show that the SP picture added SVC provides an average 1.2 dB PSNR enhancement over the current SVC while providing similar adaptive functionality.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1454-1456
• /
• 1987

Space domain image coding with VQ [9, 10, 11] has been very effective at low rates. To achieve quality at lower rates, it is necessary to exploit spaial redundancy over a larger region of pixels than is possible with general VQ. This paper presents a interframe coding algorithm which is capable of obtaining better performance and lower bi t rate than those of the general interframe coding. The performance is evaluated on the basis of SNR (Signal to Noise Ratio), memory requirements and bit rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4389-4410
• /
• 2014

Network coding is a promising technology that increases system throughput by reducing the number of packet transmissions from the source node to the destination node in a saturated traffic scenario. Nevertheless, some packets can suffer from end-to-end delay, because of a queuing delay in an intermediate node waiting for other packets to be encoded with exclusive or (XOR). In this paper, we analyze the delay according to packet arrival rate and propose two network coding schemes, iXOR (Intelligent XOR) and oXOR (Optimal XOR) with Markov Decision Process (MDP). They reduce the average delay, even under an unsaturated traffic load, through the Holding-${\chi}$ strategy. In particular, we are interested in the unsaturated network scenario. The unsaturated network is more practical because, in a real wireless network, nodes do not always have packets waiting to be sent. Through analysis and extensive simulations, we show that iXOR and oXOR are better than the Distributed Coordination Function (DCF) without XOR (the general forwarding scheme) and XOR with DCF with respect to average delay as well as delivery ratio.

• Journal of Advanced Navigation Technology
• /
• v.12 no.2
• /
• pp.115-121
• /
• 2008

In this paper, we analysis the error performance improvement of the FS MC-CDMA, whose information data are spread spectrum with direct sequences(DS), and each subband signal is transmitted using a subcarrier frequency, combining BCH code in Mobile communication channels which is characterized by Nakagami fading. The effect of co-channel interference on the block error performance is also studied in this paper. As a results of study, the coding techniques provides more efficient improvement than non-coding, but the coding techniques are required more band as many coding rate. Our study demonstrates that the system is combined coding techniques, the amount of improvement is capable of efficiently exploiting over the Nakagami fading.

• Journal of Broadcast Engineering
• /
• v.20 no.6
• /
• pp.963-966
• /
• 2015

This paper introduces a programmable multi-format video decoder(MFD) to support HEVC(High Efficiency Video Coding) standard and for other video coding standards. The goal of the proposed MFD is the high-end FHD(Full High Definition) video decoder needed for a DTV(Digital Tele-Vision) SoC(System on Chip). The proposed platform consists of a hybrid architecture that is comprised of reconfigurable processors and flexible hardware accelerators to support the massive computational load and various kinds of video coding standards. The experimental results show that the proposed architecture is operating at a 300MHz clock that is capable of decoding HEVC bit-stream of FHD 30 frames per second.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.5
• /
• pp.973-983
• /
• 2019

The importance of information security has been increasingly emphasized at the national, organizational, and individual levels due to the widespread adoption of software applications. High-safety software, which includes embedded software, should run without errors, similar to software used in the airline and nuclear energy sectors. Software development techniques in the above sectors are now being used to improve software security in other fields. Secure coding, in particular, is a concept encompassing defensive programming and is capable of improving software security. In this paper, we propose a software security vulnerability detection method using an improved coding standard searching technique. Public static analysis tools were used to assess software security and to classify the commands that induce vulnerability. Software security can be enhanced by detecting Application Programming Interfaces (APIs) and patterns that can induce vulnerability.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.677-690
• /
• 1995

In this paper, we propose the high efficiency data compression capable of error control using block-sorting, move to front(MTF) and arithmetic code with variable length in to fixed out. First, the substring with is parsed into length N is shifted one by one symbol. The cyclic shifted rows are sorted in lexicographical order. Second, the MTF technique is applied to get the reference of locality in the sorted substring. Then the preprocessed sequence is coded using VF(variable to fixed) arithmetic code which can be limited the error propagation in one codeword. The key point is how to split the fixed length codeword in proportion to symbol probabilities in VF arithmetic code. We develop the new VF arithmetic coding that split completely the codeword set for arbitrary source alphabet. In addition to, an extended representation for symbol probability is designed by using recursive Gray conversion. The performance of proposed method is compared with other well-known source coding methods with respect to entropy, compression ratio and coding times.

• Current Optics and Photonics
• /
• v.1 no.5
• /
• pp.456-467
• /
• 2017

The benefits of network coding in all-optical multicast networks have been widely demonstrated. In this paper, we mainly discuss the multicast service efficiently provisioning problem in the network coding enabled elastic optical networks (EONs). Although most research on routing and spectrum allocation (RSA) has been widely studied in the elastic optical networks (EONs), rare research studies RSA for multicast in the network coding enabled EON, especially considering the time delay constraint. We propose an efficient heuristic algorithm, called Network Coding based Multicast Capable-Multipath Routing and Spectrum Allocation (NCMC-MRSA) to solve the multipath RSA for multicast services in the network coding enabled EON. The well-known layered graph approach is utilized for NCMC-MRSA, and two request ordering strategies are utilized for multiple multicast requests. From the simulation results, we observe that the proposed algorithm NCMC-MRSA performs more efficient spectrum utilization compared with the benchmark algorithms. NCMC-MRSA utilizing the spectrum request balancing (SRB) ordering strategy shows the most efficient spectrum utilization performance among other algorithms in most test networks. Note that we also observe that the efficiency of NCMC-MRSA shows more obvious than the benchmark algorithm in large networks. We also conduct the performance comparisons of two request ordering strategies for NCMC-MRSA. Besides, we also evaluate the impact of the number of the linkdisjoint parallel w paths on the spectrum utilization performance of the proposed algorithm NCMC-MRSA. It is interesting to find that the change of the parameter w in a certain range has a significant impact on the performance of NCMC-MRSA. As the parameter w increases to a certain value, the performances of NCMC-MRSA cannot be affected by the change of w any more.