• ETRI Journal
• /
• v.32 no.4
• /
• pp.577-587
• /
• 2010

The layered coding structure of scalable video coding (SVC) with adaptive inter-layer prediction causes noticeable computational complexity increments when compared to existing video coding standards. To lighten the computational complexity of SVC, we present a fast algorithm to speed up the inter-mode decision process. The proposed algorithm terminates inter-mode decision early in the enhancement layers by estimating the rate-distortion (RD) cost from the macroblocks of the base layer and the enhancement layer in temporal, spatial, and inter-layer directions. Moreover, a search range decision algorithm is also proposed in this paper to further increase the motion estimation speed by using the motion vector information from temporal, spatial, or inter-layer domains. Simulation results show that the proposed algorithm can determine the best mode and provide more efficient total coding time saving with very slight RD performance degradation for spatial and quality scalabilities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7A
• /
• pp.711-723
• /
• 2002

A finer granular scalable (FGS) version of ISO/IEC MPEG-4 video streaming is investigated in this work with the prioritized stream delivery over loss-rate differentiated networks. Our proposed system is focused on the seamless integration of rate adaptation, prioritized packetization, and simplified differentiation for the MPEG-4 FGS video streaming. The proposed system consists of three key components: 1) rate adaptation with scalable source encoding, 2) content-aware prioritized packetization, and 3) loss-based differential forwarding. More specifically, a constant-quality rate adaptation is first achieved by optimally truncating the over-coded FGS stream based on the embedding rate-distortion (R-D) information (obtained from a piecewise linear R-D model). The rate-controlled video stream is then packetized and prioritized according to the loss impact of each packet. Prioritized packets are transmitted over the underlying network, where packets are subject to differentiated dropping and forwarding. By focusing on the end-to-end quality, we establish an effective working conditions for the proposed video streaming and the superior performance is verified by simulated MPEG-4 FGS video streaming.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.100-108
• /
• 2018

This paper describes a design of scalable RSA public-key cryptography processor supporting four key lengths of 512/1,024/2,048/3,072 bits. The modular multiplier that is a core arithmetic block for RSA crypto-system was designed with 32-bit datapath, which is based on the CIOS (Coarsely Integrated Operand Scanning) Montgomery modular multiplication algorithm. The modular exponentiation was implemented by using L-R binary exponentiation algorithm. The scalable RSA crypto-processor was verified by FPGA implementation using Virtex-5 device, and it takes 456,051/3,496347/26,011,947/88,112,770 clock cycles for RSA computation for the key lengths of 512/1,024/2,048/3,072 bits. The RSA crypto-processor synthesized with a $0.18{\mu}m$ CMOS cell library occupies 10,672 gate equivalent (GE) and a memory bank of $6{\times}3,072$ bits. The estimated maximum clock frequency is 147 MHz, and the RSA decryption takes 3.1/23.8/177/599.4 msec for key lengths of 512/1,024/2,048/3,072 bits.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.368-376
• /
• 2009

Over recent years, the development of multimedia devices has meant that a wider multimedia streaming service can be supported, and there are now many ways in which TV channels can communicate with different terminals. Generally, scalable video streaming is known to provide more efficient channel capacity than simulcast video streaming. Simulcast video streaming requires a large network bandwidth for all resolutions, but scalable video streaming needs only one flow for all resolutions. On the contrary, to preserve the same video quality, SVC(Sealable Video Coding) needs a higher bit-rate than AVC(non-layered Video Coding) due to the coding penalty($10%{\sim}30%$). In previous research, scalable video streaming has been compared with simulcast video streaming for network channel capacity, in two-user simulation environments. The simulation results show that the channel capacity of SVC is $16{\sim}20%$ smaller than AVC, but scalable video streaming is not efficient because of the limit of the present network framework. In this paper, we propose a new network framework with a new router using EDE(Extraction Decision Engine) and SVC Extractor to improve network performance. In addition, we compare the SVC environment in the proposed framework with previous research on the same way subject. The proposed network framework shows a channel capacity 50%(maximum) lower than that found in previous research studies.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.60-61
• /
• 2010

• Journal of information and communication convergence engineering
• /
• v.3 no.1
• /
• pp.5-8
• /
• 2005

Dynamic cipher has the property that the key-size, the number of round, and the plaintext-size are scalable simultaneously. We present the method for designing secure Dynamic cipher against meet-in-the-middle attack and linear cryptanalysis. Also, we show that the differential cryptanalysis to Dynamic cipher is hard. In this paper we propose a new network called Dynamic network for symmetric block ciphers.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1195-1206
• /
• 2015

For the management of a knowledge system, systems that automatically infer and manage scalable knowledge are required. Most of these systems use ontologies in order to exchange knowledge between machines and infer new knowledge. Therefore, approaches are needed that infer new knowledge for scalable ontology. In this paper, we propose an approach to perform rule based reasoning for scalable SHIF ontologies in a spark framework which works similarly to MapReduce in distributed memories on a cluster. For performing efficient reasoning in distributed memories, we focus on three areas. First, we define a data structure for splitting scalable ontology triples into small sets according to each reasoning rule and loading these triple sets in distributed memories. Second, a rule execution order and iteration conditions based on dependencies and correlations among the SHIF rules are defined. Finally, we explain the operations that are adapted to execute the rules, and these operations are based on reasoning algorithms. In order to evaluate the suggested methods in this paper, we perform an experiment with WebPie, which is a representative ontology reasoner based on a cluster using the LUBM set, which is formal data used to evaluate ontology inference and search speed. Consequently, the proposed approach shows that the throughput is improved by 28,400% (157k/sec) from WebPie(553/sec) with LUBM.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.12
• /
• pp.87-95
• /
• 2009

In this paper, an area-efficient FFT processor is proposed for MIMO-OFDM based SDR systems. The proposed scalable FFT processor can support the variable length of 64, 128, 512, 1024 and 2048. By reducing the required number of non-trivial multipliers with mixed-radix (MR) and multi-path delay commutator (MDC) architecture, the complexity of the proposed FFT processor is dramatically decreased without sacrificing system throughput The proposed FFT processor was designed in hardware description language (HDL) and synthesized to gate4eve1 circuits using 0.18um CMOS standard cell library. With the proposed architecture, the gate count for the processor is 46K and the size of memory is 64Kbits, which are reduced by 59% and 39%, respectively, compared with those of the 4-channel radix-2 single-path delay feedback (R2SDF) FFT processor. Also, compared with 4-channel radix-2 MDC (R2MDC) FFT processor, it is confirmed that the gate count and memory size are reduced by 16.4% and 26.8, respectively.

• Proceedings of the KOSOMBE Conference
• /
• v.1995 no.05
• /
• pp.235-238
• /
• 1995

In this paper, we propose an effective coding method of the angiography by using the scalable structure in the frequency domain for MPACS(Medical Picture Archiving and Communication System). We employed the subband decomposition method and MPEG-2 system which is the international standard coding method of the general moving picture. After the subband decomposition is applied to split an input image into 4 bands in the spatial frequency domain, the motion compensated DPCM coding method of MPEG-2 is carried out for each subband. As a result, an easily controllable coding Structure is accomplished by composing the compound hit stream for each subband group. Follows are the simulation results of the proposed sheme for the angiography. A scalable structure which can be easily controlled for a loss of transmission or the band limit can be accomplisbed in the MPEG-2 stucture by the subband decomposition minimizing the side information. And by reducing the search area of the motion vector between -4 and 3, the processing speed of a codec is enhanced by more than two times without a loss of the picture quality compare with the conventional DCT coefficients decompositon method. And the processing speed is considerably improved in the case of the parallel construction of each subband in the hardware.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.10
• /
• pp.582-588
• /
• 2002

Scalable displays generate large and high resolution images and provide an immersive environment. Recently, scalable displays are built on the networked clusters of PCs, each of which has a fast graphics accelerator, memory, CPU, and storage. However, the distributed rendering on clusters is a network bound work because of limited network bandwidth. In this paper, we present a new algorithm for reducing the network bandwidth and implement it with a conventional distributed rendering system. This paper describes the algorithm called geometry tracking that avoids the redundant geometry transmission by indexing geometry data. The experimental results show that our algorithm reduces the network bandwidth up to 42%.