• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1588-1603
• /
• 2014

In space diversity combining, conventional methods such as maximal ratio combining (MRC), equal gain combining (EGC) and selection combining (SC) are commonly used to improve the output signal-to-noise ratio (SNR) provided that the channel is perfectly estimated at the receiver. However, in practice, channel estimation is often imperfect and this indeed deteriorates the system performance. In this paper, diversity combining techniques based on two evolutionary algorithms, namely genetic algorithm (GA) and particle swarm optimization (PSO) are proposed and compared. Numerical results indicate that the proposed methods outperform the conventional MRC, EGC and SC methods when the channel estimation is imperfect while it shows similar performance as that of MRC when the channel is perfectly estimated.

• Journal of the Korea Society for Simulation
• /
• v.7 no.2
• /
• pp.33-43
• /
• 1998

To evaluate the server performance and forecast capacity requirements, we carry out simulation of Multimedia-on-demand(MOD) server. In multimedia service environment, especially for on-demand service, one of the key problems is capacity planning, which requires ensuring that adequate computer resources will be available to meet the future workload demands in a cost-effective manner. In this paper, we design and implement a simulation model for MOD server with failures of components (e.g., processors, disks and networks). By acquisition of utilization and queue length parameters, we can estimate desirable capacity of server components with various arrival rates of customers and failure rates of components. For a given failure probability, we also compute packet delay probability and reliability of the server. It is possible to derive some important design information of the MOD server by using the above parameters.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.1
• /
• pp.135-141
• /
• 2017

This thesis progressed research on the improvements of NCS multimedia utilization for preliminary teachers. A national module has not been developed yet in terms of child education, so this thesis suggests a curriculum according to the courses taught for freshmen and sophomores of K University Child Education majors. To lessen the burden of tremendous work and classes, provide motivation and interest in learning and maximize the effect, this thesis provides NCS based curriculum. It expects to improve task performance of teachers and help them with better skills to make class materials using up-to-date multimedia, regardless of the computer literacy of preliminary teachers. This thesis does prior research on the abilities to make use of computers and understand the level of computer literacy. Then it suggests NCS based curriculum goals and its performance standards to utilize task-suitable software. It aims to enable efficient multimedia usage, and optimize the learning efficiency of education linked to Nuri precesses.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3B
• /
• pp.214-219
• /
• 2011

The IMS (IP Multimedia Subsystem) is used for providing multimedia services to network provider. The IMS is composed of many nodes, depending on their function. According to the status (fault, performance, etc.) of each node, we need to provide dynamic routing algorithm. In this paper, we propose a dynamic routing algorithm for management of the IMS nodes using SNMP based on FCAPS (Fault, Configuration, Accounting, Performance and Security) in the IMS network.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.6 no.6
• /
• pp.345-359
• /
• 2011

In high performance embedded systems, the use of multiple on-chip memories is an essential architectural feature for exploiting inherent parallelism in multimedia applications. This feature allows multiple data accesses to be executed in parallel. However, it remains difficult to effectively exploit of multiple on-chip memories. The successful use of this architecture strongly depends on how to efficiently detect and exploit memory parallelism in target applications. In this paper, we propose a technique based on a linear array access descriptor [1], which is generated from profiled data, to detect and exploit memory parallelism. The proposed technique tackles an array reorganization problem to maximize memory parallelism in multimedia applications. We present preliminary experiments applying the proposed technique onto a representative coarse grained reconfigurable array processor (CGRA) with multimedia kernel codes. Our experimental results demonstrate that our technique optimizes data placement by putting independent data on separate storage. The results exhibit 9.8% higher performance on average compared to the existing method.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.167-173
• /
• 2002

본 논문에서는 동영상 신호에 대한 워터마킹 알고리즘의 관점에서 워터마킹 성능, 부호화성능, 실시간 구현 등의 요구조건 사이의 관계를 살펴보고, 모의실험을 바탕으로 재부호화시의 강인성, 필터링공격에 대한 강인성 등 동영상 워터마킹 방법에 대해 성능을 분석한다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.713-717
• /
• 2001

본 논문에서는 MPEG 비디오에 대한 워터마킹 알고리즘에 대하여 알아보고자 한다. 디지털 워터마크는 저작권 보호를 위하여 개발된 기법으로 디지털 데이터에 보이지 않도록 저작권 정보를 삽입하는 방범이다. 따라서 디지털 동영상에 대해서도 지적 재산권 보호가 가능하며, MPEG의 비트 스트링에 삽입하는 워터마크에 대해서 다양한 방법으로 성능분석을 하고자 한다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.921-924
• /
• 2003

본 논문은 인터넷 상에서 서비스되는 스트리밍 미디어를 캐쉬 서버에서 캐슁할 때 적용할 수 있는 재배치 정책에 관한 것이다. 스트리밍 미디어의 특성에 적합한 재배치 기준을 제시하고, 그에 따라 미디어 데이터를 캐슁하고 재배치하는 방법을 제안한다. 또한, 제안한 재배치 정책과 기존의 알려진 방법들에 대한 성능 비교 분석을 수행 한다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.11a
• /
• pp.279-282
• /
• 2000

무선인터넷을 지원하는 WAP 게이트웨이는 프로토콜 변환과 함께 WML 파일을 바이너리 포맷으로 변환하여 무선 환경에 적합하게 한다. 인코딩에서의 공백제거와 태그변환에 따른 효과는 WML 파일의 크기와 특성에 따라 달라진다. 본 논문에서는 게이트웨이에서의 인코딩에 따른 파일크기 감소 효과를 분석하고 압축의 효용성에 대해 기술한다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.246-251
• /
• 1998

The basic requirement of a distributed multimedia system are intramedia synchronization which asks the strict delay and jitter for the check period of media buffer and the scaling duration with periodic continuous media such as audio and video media, and intermedia synchronization that needs the constraint for relative time relations among them when several media are presented in parallel. In this paper, a distributed multimedia synchronization algorithm based on the fuzzy logic is presented and the performance is evaluated through simulation. Intramedia synchronisation algorithm uses the media scaling techniques and intermedia synchronization algorithm uses variable service rates on the basis of fuzzy logic to solve the multimedia synchronization problem.