• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.625-633
• /
• 2021

This paper describes a scalable architecture for flexible hardware implementation of Montgomery modular multiplication. Our scalable modular multiplier architecture, which is based on a one-dimensional array of processing elements (PEs), performs word parallel operation and allows us to adjust computational performance and hardware complexity depending on the number of PEs used, N_PE. Based on the proposed architecture, we designed a scalable Montgomery modular multiplier (sMM) core supporting eight field sizes defined in SEC2. Synthesized with 180-nm CMOS cell library, our sMM core was implemented with 38,317 gate equivalents (GEs) and 139,390 GEs for N_PE=1 and N_PE=8, respectively. When operating with a 100 MHz clock, it was evaluated that 256-bit modular multiplications of 0.57 million times/sec for N_PE=1 and 3.5 million times/sec for N_PE=8 can be computed. Our sMM core has the advantage of enabling an optimized implementation by determining the number of PEs to be used in consideration of computational performance and hardware resources required in application fields, and it can be used as an IP (intellectual property) in scalable hardware design of elliptic curve cryptography (ECC).

• 한국정보디스플레이학회:학술대회논문집
• /
• 2004.08a
• /
• pp.383-388
• /
• 2004

In this paper an alternative Active Matrix LCD technology is described with scalable, low cost processing. The Dual Select Diode AMLCD requires 60% lower capital investment in the array process than a-Si TFT arrays and results in 20% lower cost LCD modules. Development at several AMLCD manufacturers is in progress.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2013.05a
• /
• pp.731-732
• /
• 2013

• Proceedings of the Optical Society of Korea Conference
• /
• 2008.07a
• /
• pp.167-168
• /
• 2008

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.307-319
• /
• 2015

Current ontology studies use the Hadoop distributed storage framework to perform map-reduce algorithm-based reasoning for scalable ontologies. In this paper, however, we propose a novel approach for scalable Web Ontology Language (OWL) Horst Lite ontology reasoning, based on distributed cluster memories. Rule-based reasoning, which is frequently used for scalable ontologies, iteratively executes triple-format ontology rules, until the inferred data no longer exists. Therefore, when the scalable ontology reasoning is performed on computer hard drives, the ontology reasoner suffers from performance limitations. In order to overcome this drawback, we propose an approach that loads the ontologies into distributed cluster memories, using Spark (a memory-based distributed computing framework), which executes the ontology reasoning. In order to implement an appropriate OWL Horst Lite ontology reasoning system on Spark, our method divides the scalable ontologies into blocks, loads each block into the cluster nodes, and subsequently handles the data in the distributed memories. We used the Lehigh University Benchmark, which is used to evaluate ontology inference and search speed, to experimentally evaluate the methods suggested in this paper, which we applied to LUBM8000 (1.1 billion triples, 155 gigabytes). When compared with WebPIE, a representative mapreduce algorithm-based scalable ontology reasoner, the proposed approach showed a throughput improvement of 320% (62k/s) over WebPIE (19k/s).

• ETRI Journal
• /
• v.32 no.2
• /
• pp.281-291
• /
• 2010

Scalable video coding (SVC) has been standardized as an extension of the H.264/AVC standard. This paper proposes a practical real-time transport protocol (RTP) packetization scheme to transport SVC video over IP networks. In combined scalability of SVC, a coded picture of a base or scalable enhancement layer is produced as one or more video layers consisting of network abstraction layer (NAL) units. The SVC NAL unit header contains a (DID, TID, QID) field to identify the association of each SVC NAL unit with its scalable enhancement layer without parsing the payload part of the SVC NAL unit. In this paper, we utilize the (DID, TID, QID) information to derive hierarchical spatio-temporal relationship of the SVC NAL units. Based on the derivation using the (DID, TID, QID) field, we propose a practical RTP packetization scheme for generating single RTP sessions in unicast and multicast transport of SVC video. The experimental results indicate that the proposed packetization scheme can be efficiently applied to transport SVC video over IP networks with little induced delay, jitter, and computational load.

• Journal of the HCI Society of Korea
• /
• v.2 no.1
• /
• pp.1-12
• /
• 2007

In this paper, we propose a video service system that reflects user interaction in the multimedia contents to increase user satisfaction in the restricted content consumption environment. The proposed system is based on the multiple ROI(Region of Interest) coding in H.264/AVC Scalable Video Coding (SVC). The proposed system provides scalable video quality by adopting SVC. And by bidirectional communication between user and video server, it enables user to select meaningful ROI among multiple ROIs by user interaction. To verify the usefulness of the proposed system, we demonstrate it with a test-bed on which user interactive ROIs are implemented.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.6
• /
• pp.1327-1332
• /
• 2011

In the mobile meteorological information services, an existing sensor system should be expanded to serve precise information. This is because of large cost problem to add the existing sensors. This thesis proposes a system architecture to construct scalable mobile meteorological information services and suggests mobile phone, sensor network, and public traffic vehicle as expended sensors. The proposed scalable sensors are compared each other and analysed the results to evaluated their strength and weakness. In this system, based on the characteristics of the sense data collected at server, a data processing methods are proposed to support efficient query processing. The proposing data processing methods have several benefits. They compress some data volume sensed by various sources on some area at some time to a logical unit. Still it could preserve same services quality.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.6 no.4
• /
• pp.216-223
• /
• 2013

As the fast growth of using Internet, the requests of clients having different types and pressing loads on the server have been increased in World Wide Web. Thus the interesting issue is how to measure the real capacity of a Web Server. There have been much recent studies about measuring the capacity of web server. But the cause of Server response time delay is not just server itself but also network packet loss. To measure the practical capacity of web server, we generate scalable clients using Posix Thread, transport packets which were generated by scalable clients to the server using UDP and receive the packets which were the remain packet from network packet loss using TCP. In this paper, we propose a method to measure the practical capacity of a web server using the Scalable Clients based on Posix Thread and the transport on Application level.

• Journal of Satellite, Information and Communications
• /
• v.2 no.2
• /
• pp.59-63
• /
• 2007

In this paper, we propose an advanced Ka-band satellite HD broadcasting system using scalable video coding technology. As already known, it is not so easy to achieve reasonable link availability on Ka-band because of the rain-attenuation effect, and in case of HD broadcasting service it's more difficult. To overcome that problem, we propose an hierarchical broadcasting system based on H.264 SVC technology. In this paper, we suggest a few types of system scenario to realize the concept. Those scenarios are including DVB-S and DVB-S2 and spatially scalable video stream is the source stream in all cases.