• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9A
• /
• pp.749-757
• /
• 2011

In this paper, we propose a robust And-Or tree-based Luby transform encoded symbol packetization algorithm to minimize the quality degradation of video streaming service caused by packet losses over wireless network. To achieve this goal, the relationship among Luby transform encoded symbols are analyzed by using And-Or tree, and the proposed packetization algorithm is designed to minimize packet loss effects by reducing the dependency among packets conveying Luby transform encoded symbols. Finally, experimental results are provided to show the performance of the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6C
• /
• pp.471-479
• /
• 2008

In this paper, we propose a novel algorithm to automatically generate an RTP timestamp value that is required for the RTP packetization in order to transmit SVC video over various If networks such as Internet. Unlike the conventional single layer coding algorithms such as H.263, MPEG-4 and H.264, SVC generates a multi-layered single bitstream which is composed of a base layer and one or more enhancement layers in order to simultaneously provide temporal, spatial, and SNR scalability. Especially, in order to provide temporal scalability based on hierarchical B-picture prediction structure, the encoding (or transmission) and display order of pictures in SVC coding is completely decoupled. Thus, the timestamp value to be specified at the header of each RTP packet in video transmission does not increase monotonically according to the display time instant of each picture. Until now, no method for automatically generating an RTP timestamp when SVC video is loaded in a RTP packet has teen introduced. In this paper, a novel automatic RTP timestamp generation method exploiting the TID (temporal ID) field of the SVC NAL unit header is proposed to accommodate the SVC video transmission.

• The KIPS Transactions:PartB
• /
• v.10B no.5
• /
• pp.575-578
• /
• 2003

SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of zero-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZP-DFS, which needs no additional memory when running SPIHT algorithm. It traverses a spatial-tree according to DFS and eliminates additional memory as it uses test-functions for encoding and LSB bits of coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in hardware implementation because no additional memory is required. Moreover. it exploits parallelism to process each spatial-tree that it can be applied well in real-time image compression.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.321-327
• /
• 2004

SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of toro-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZC-BFS, which needs no additional memory when running SPIHT algorithm. It explicitly performs a breadth first search of the spatial-tree using peano-code and eliminates additional memory as it uses pre-status significant test for encoding and LSB bits of some coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in fast and simple hardware implementation and reduces the cost of production because no lists and additional memory are required.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.603-611
• /
• 2013

In this paper, we propose a new method which estimates and encrypts significant component of digital image such as digital cinema using discrete wavelet packet transform (DWPT). After analyzing the characteristics of images in spatial and frequency domain, the required information for ciphering an image was extracted. Based on this information an ciphering method was proposed with wavelet transform and packetization of subbands. The proposed algorithm can encrypt images in various robust from selecting transform-level and energy threshold. From analyzing the encryption effect numerically and visually, the optimized parameter for encryption is presented. Without additional analyzing process, one can encrypt efficiently digital image using the proposed parameter. Although only 0.18% among total data is encrypted, the reconstructed image dose not identified. The paketization information of subbands and the cipher key can be used for the entire secret key.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.905-916
• /
• 2008

In this paper, we propose a new method which estimates and encrypts significant component of digital hologram using discrete wavelet packet transform (DWPT). After analyzing the characteristics of digital hologram in spatial and frequency domain, the required information for ciphering digital hologram was extracted. Based on this information an ciphering method was proposed with wavelet transform and packetization of subbands. The proposed algorithm can encrypt digital hologram in various robust from selecting transform-level and energy threshold. From analyzing the encryption effect numerically and visually, the optimized parameter for encryption is presented. Without additional analyzing process, one can encrypt efficiently digital hologram using the proposed parameter. Although only 0.032% among total data is encrypted, the reconstructed object dose not identified. The paketization information of subbands and the cipher key can be used for the entire secret key.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.1
• /
• pp.20-33
• /
• 2002

Usage of ATM AAL2 packets becomes dominant to increase transmission efficiency of voice traffic in the backbone network. In case of voice service that uses AAL2 mechanism, if resources of network are enough, connection of new call is accepted. However, due to packets generated by the new call, transmission delay of packets from old calls can increase sharply. To control this behavior, in this paper we present an AAL2 buffer management scheme that allocates a virtual buffer to each call and after calculating its propagation delay variation(PDV), decides to drop packets coming from each call according to the PDV value. We show that this packet dropping algorithm can effectively prevent abrupt QoS degradation of old calls. To do this, we analyze AAL2 packet composition process to find a critical factor in the process that influences the end-to-end delay behavior and model the process by K-policy M/D/1 queueing system and MIN(K, Tc)-policy M/D/1 queueing system. From the mathematical model, we derive the probability generating function of AAL2 packets in the buffer and mean waiting time of packets in the AAL2 buffer. Analytical results show that the AAL2 packet dropping algorithm can provide stable AAL2 packetization delay and ATM cell generation time even if the number of voice sources increases dramatically. Finally we compare the analytical result to simulation data obtained by using the COMNET Ⅲ package.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.8
• /
• pp.80-88
• /
• 2007

High adaptability and scalability are two critical issues in implementing a very complex system in a single chip. To obtain high adaptability and scalability, novel system design methodology known as communication-based system design has gained large attention from SoC designers. NoC (Network-on-Chip) is such an on-chip communication-based design approach for the next generation SoC design. To provide high adaptability and scalability, NoCs employ network interfaces and routers as their main communication structures and transmit and receive packetized data over such structures. However, data packetization, and routing overhead in terms of run time and area may cost too much compared with conventional SoC communication structure. Therefore, in this research, we propose a novel methodology which automatically generates a hybrid communication structure. In this work, we map traditional pin-to-pin wiring structure for frequent and timing critical communication, and map flexible and scalable structure for infrequent, or highly variable communication patterns. Even though, we simplify the communication structure significantly through our algorithm the connectivity or the scalability of the communication modules are almost maintained as the original NoC design. Using this method, we could improve the timing performance by 49.19%, and the area taken by the communication structure has been reduced by 24.03%.