• The KIPS Transactions:PartA
• /
• v.15A no.5
• /
• pp.269-274
• /
• 2008

Recently, lots of embedded processors which can run streaming multimedia with high resolution display are introduced. Among the applications running on these embedded processors, real-time audio streaming is one of the applications that suffer from the lack of energy and memory space. In this paper, we propose a novel data compression method on scratch-pad memory, which saves both useful space on the scratch-pad memory and energy. We have implemented the data compression scheme on the GDM1202 real-time audio streaming processor, and the performance results show that we obtained 13.3% energy saving while maintaining comparable application performance to that of the non-compression case.

• The KIPS Transactions:PartA
• /
• v.18A no.3
• /
• pp.93-98
• /
• 2011

While the use of battery-powered embedded systems has been rapidly increasing, the current level of battery technology has not kept up with the drastic increase in power consumption by the system. In order to prolong system usage time, the battery size needs to be increased. The amounts of power consumption by embedded systems are determined by their hardware configuration and software for manipulating hardware resources. In spite of that, the hardware provides features for lowering power consumption, if those cannot be utilized efficiently by software including operating system, reduction in power consumption is not optimized. In this paper, we propose a BET(Break Even Time)-based scheduling method using task partition to reduce power consumption of multimedia applications in a mobile embedded system environment.

• Journal of Advanced Navigation Technology
• /
• v.11 no.3
• /
• pp.259-265
• /
• 2007

Systematic components for implementing ubiquitous computing, for example, electronic devices, electric home appliances, and controllers, etc, are consist of not only circuits but also softwares expected to do some special system-controlling functions, and these softwares used to be called like as embedded software. Because embedded software is a core component controlling systems, the codes or control flows should be protected from being opened to the public or modified. Embedded software security can be divided into 2 parts: first is the unauthorized access to development site and embedded software, second is the unauthorized disclosure or modification. And this research is related to the first aspect of them.This paper proposes some security check requirements related to embedded software development site by analyzing the ALC_DVS.1 of the ISO/IEC 15408 and Base Practices (BPs) of the ISO/IEC 21827. By applying this research, we expect to protect unauthorized modification of embedded software indirectly.

• Journal of Korea Multimedia Society
• /
• v.4 no.3
• /
• pp.247-256
• /
• 2001

Digital watermarking is a copyright protection technique for digital images which embed a code into the digital data so the data is marked. Watermarking techniques previously deal with on-line digital data and have been developed to withstand digital attacks such image processing, compression and geometric transformation. In this paper we propose a novel method of embedding watermarks in printed images. In the proposed algorithm, watermark is embedded in a dithered binary image by comparing the $2\times{2}$ blocks of the counting array is the number of 1 (WHITE) in the $16\times{16}$ blocks of the dithered binary image with predefined reference block pattern, which is generated by watermark values. The proposed algorithm is able to provide more information at a watermark because the proposed algorithm use both '1'and '0' as watermark values. The watermark information is detected by comparing the watermark which is reconstructed from the image which is embedded watermark with the original watermark which is embedded in a binary image. The performance of the proposed algorithm is compared with that of the conventional watermark embedding algorithm for printed images by detecting watermark for scan images.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.556-564
• /
• 2003

A Star and Pancake graph also have such a good property of a hypercube and have a low network cost than the hypercube. A Macro-star graph which has the star graph as a basic module has the node symmetry, the maximum fault tolerance, and the hierarchical decomposition property. And, it is an interconnection network which improves the network cost against the Star graph. In this paper, we propose a method to embed between Star graph, Pancake graph, and Macro-star graph using the edge definition of graphs. We prove that the Star graph $S_n$ can be embedded into Pancake graph $P_n$ with dilation 4, and Macro-star graph MS(2,n) can be embedded into Pancake graph $P_{2n＋1}$ with dilation 4. Also, we have a result that the embedding cost, a Pancake graph can be embedded into Star and Macro-star graph, is O(n).

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.436-443
• /
• 2003

A digital video watermarking algorithm is proposed that uses HVS and DWT. In this algorithm, each video frame is decomposed into four-level by DWT which reveals the characteristics of the human eyes and watermark is embedded into DWT coefficients using HVS. For robustness, the lowest level subbands which represent the highest frequency component are excluded in watermark embedding step and watermark is embedded into the perceptually significant coefficients (PSCs) of the rest subbands. PSCs of the baseband are selected according to the amplitude of the coefficients and PSCs of the high frequency subbands are selected by successive subband quantization (SSQ). Watermark is embedded into the PSCs of the baseband and high frequency subbands by Weber's law and spatial masking effect, respectively, for the invisibility and robustness. We tested the performance of the proposed algorithm compared with the conventional watermarking algorithm by computer simulation. Experimental results show that the proposed watermarking algorithm produces a better invisibility and robustness than the conventional algorithm.

• Journal of Korea Multimedia Society
• /
• v.12 no.2
• /
• pp.200-208
• /
• 2009

JBIG2, as the next generation standard for binary image compression, must be designed in hardware modules for the JBIG2 FAX to be implemented in an embedded equipment. This paper proposes a hardware module of the high-speed Huffman coder for JBIG2. The Huffman coder of JBIG2 uses selectively 15 Huffman tables. As the Huffman coder is designed to use minimal data and have an efficient memory usage, high speed processing is possible. The designed Huffman coder is ported to Virtex-4 FPGA and co-operating with a software modules on the embedded development board using Microblaze core. The designed IP was successfully verified using the simulation function test and hardware-software co-operating test. Experimental results shows the processing time is 10 times faster than that of software only on embedded system, because of hardware design using an efficient memory usage.

• Journal of Korea Multimedia Society
• /
• v.14 no.3
• /
• pp.440-448
• /
• 2011

The needs for the OpenGL-family of the rendering library standards are highly increasing, especially for the graphical human-machine Interface on the various systems including smart phones and personal information devices. Additionally, in the case of safety-critical market for avionics, military, medical and automotive applications, OpenGL SC, the safety critical profile of the OpenGL library plays the major role for the graphical interfaces. In this paper, we represent our OpenGL SC emulation library on the OpenGL 1.x rendering pipeline which is widely available on the existing embedded systems, to provide the features of OpenGL SC standard cost-effectively. Our method can provide the OpenGL SC features at the low development cost on the embedded systems, and its implementation is also one of the fundamental elements for the emulation of embedded systems in the PC environment. Our final result now works on both of Linux-based and VxWORKS systems, showing correct execution results at the reasonable speed.

• Journal of Korea Multimedia Society
• /
• v.9 no.9
• /
• pp.1173-1183
• /
• 2006

Matrix-star, Pancake, and RFM graphs have such a good property of Star graph and a lower network cost than Hypercube. Matrix-star graph has Star graph as a basic module and the node symmetry, the maximum fault tolerance, and the hierarchical decomposition property. Also it is an interconnection network that improves the network cost against Star graph. In this paper, we propose a method to embed among Matrix-star Pancake, and RFM graphs using the edge definition of graphs. We prove that Matrix-star $MS_{2,n}$ can be embedded into Pancake $P_{2n}$ with dilation 4, expansion 1, and $RFM_{n}$ graphs can be embedded into Pancake $P_{n}$ with dilation 2. Also, we show that Matrix-star $MS_{2,n}$ can be embedded into the $RFM_{2n}$ with average dilation 3.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.301-304
• /
• 2013

In this paper, to improve the fast boot and soft real-time for the responsiveness in Qplus with relative evaluation rather than an absolute evaluation using validated to perform the services actually used. Qplus is included soft real-time, fast booting, and file system technology. There is a development board that mounted on an embedded Linux and Qplus. AV (Audio / Video) group communications is ported on the development board for soft real-time multimedia streaming services and to evaluate the performance of communication. We performed three major evaluation such as booting time measurement experiment, own performance measurement experiments for soft real-time measurement experiment, and performance measurement experiments for via the network communication performance evaluation. They are a practical Qplus performance evaluation and analysis.