• 제목/요약/키워드: Scalable information

검색결과 959건 처리시간 0.026초

DRAM을 사용한 가변 사이즈 영상 저장/재생 시스템 구현에 관한 연구 (A study on the implementation of scalable image capture processor using DRAM)

  • 이호준;이주석;박노경;차균현
    • 한국통신학회논문지
    • /
    • 제22권6호
    • /
    • pp.1185-1194
    • /
    • 1997
  • It is necessary to control the frame memory to capture, edit and display images. This paper presents the free-scale image capture processor size of which is user-defined, compared to the conventional image capture processor size of which is fixed 1/2, 1/4 and full size. User-defined scale data is fed into this system, which generates the gating pulses and gates the inputted image data. This system also controls the 4M DRAM instead of frame meamory. And stored gated image data are displayed on the TV monitor. We designed the scalable image capture parts and DRAM controller with ACTEL FPGAs, simulated the circuits with Viewlogic and fusing ACTEL A1020B chips. We confirmed the whole operation with beadboard which composed of "Philips TV Chipset" and designed FPGA chips.PGA chips.

  • PDF

파라메터 직접 추출법을 이용한 스케일 가능한 HBT의 모델링 (Scalable HBT Modeling using Direct Extraction Method of Model Parameters)

  • 서영석
    • 한국정보통신학회논문지
    • /
    • 제9권2호
    • /
    • pp.316-321
    • /
    • 2005
  • 새로운 전류원 모델과 이 전류원 모델에 대응하는 파라메터의 직접추출 방법을 제안하였다. 전류원 모델파라메터를 위한 정확하고 해석적인 계산방법을 유도하였다. 이러한 해석적 모델링 방법을 기반으로 스케일 가능한 H8T 모델을 만드는 방법에 적용되었다. 단조함수적 스케일링이 가능하도록 하도록 하기 위해, 모델링 과정에서, 몇몇 파라메터들의 증복성(redunduncy)을 제거하는 방법을 개발하였다. 이러한 방법에 기반을 둔 모델을 실제 소자에 적용 했을때, 소자의 온도, 바이어스 및 크기변화를 잘 예측할 수 있었다.

An Automatic and Scalable Application Crawler for Large-Scale Mobile Internet Content Retrieval

  • Huang, Mingyi;Lyu, Yongqiang;Yin, Hao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권10호
    • /
    • pp.4856-4872
    • /
    • 2018
  • The mobile internet has grown ubiquitous across the globe with the widespread use of smart devices. However, the designs of modern mobile operating systems and their applications limit content retrieval with mobile applications. The mobile internet is not as accessible as the traditional web, having more man-made restrictions and lacking a unified approach for crawling and content retrieval. In this study, we propose an automatic and scalable mobile application content crawler, which can recognize the interaction paths of mobile applications, representing them as interaction graphs and automatically collecting content according to the graphs in a parallel manner. The crawler was verified by retrieving content from 50 non-game applications from the Google Play Store using the Android platform. The experiment showed the efficiency and scalability potential of our crawler for large-scale mobile internet content retrieval.

Fast Enhancement Layer Encoding Method using CU Depth Correlation between Adjacent Layers for SHVC

  • Kim, Kyeonghye;Lee, Seonoh;Ahn, Yongjo;Sim, Donggyu
    • 전자공학회논문지
    • /
    • 제50권6호
    • /
    • pp.260-264
    • /
    • 2013
  • This paper proposes a fast enhancement layer coding method to reduce computational complexity for Scalable HEVC (SHVC) which is based on High Efficiency Video Coding (HEVC). The proposed method decreases encoding time by simplifying Rate Distortion Optimization (RDO)for enhancement layers (EL). The simplification is achieved by restricting CU depths based on the correlation of coding unit (CU) depths between adjacent layers and scalability (spatial or quality) of EL. Comparing with the performance of SHM 1.0 software encoder, the proposed method reduces the encoding time by up to 31.5%.

Highly Scalable NAND Flash Memory Cell Design Embracing Backside Charge Storage

  • Kwon, Wookhyun;Park, In Jun;Shin, Changhwan
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제15권2호
    • /
    • pp.286-291
    • /
    • 2015
  • For highly scalable NAND flash memory applications, a compact ($4F^2/cell$) nonvolatile memory architecture is proposed and investigated via three-dimensional device simulations. The back-channel program/erase is conducted independently from the front-channel read operation as information is stored in the form of charge at the backside of the channel, and hence, read disturbance is avoided. The memory cell structure is essentially equivalent to that of the fully-depleted transistor, which allows a high cell read current and a steep subthreshold slope, to enable lower voltage operation in comparison with conventional NAND flash devices. To minimize memory cell disturbance during programming, a charge depletion method using appropriate biasing of a buried back-gate line that runs parallel to the bit line is introduced. This design is a new candidate for scaling NAND flash memory to sub-20 nm lateral dimensions.

QoS를 고려한 SpatioTemporal Layered Coding and Scalable Transmission에 관한 연구 (Study on the SpatioTemporal Layered Coding and Scalable Transmission in considering QoS)

  • 김태영;손호신;유우종;김형철;유관종
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 1999년도 가을 학술발표논문집 Vol.26 No.2 (3)
    • /
    • pp.614-616
    • /
    • 1999
  • 이질적인 환경(Heterogoneous Environments)에서 실시간 멀티미디어 서비스가 확산됨에 따라 비디오 데이터로 인한 트래픽이 통신망을 오가는 트래픽의 대부분을 차지하게 되었다. 이에 통신망 지원의 효율화를 위해서 사용자의 통신망 환경을 고려한, 비디오 데이터의 Layered coding과 스케러블 전송이 필요하다. 즉, 낮은 QoS 환경인 경우 일부분만을 전송하고, 높은 QoS 환경인 경우에 모두 전송하는 것이다. 이를 위해 본 논문에서는 MPEG 비디오 데이터 스케일러블 전송에 맞게 초당 디스플레이하는 프레임 수를 동적으로 조정하는 기법과 화질을 조정할 수 있는 SpatioTemporal Layered Coding 기법을 제안한다. 본 기법을 이용하면 사용자는 자신의 통신망 환경과 단말기 성능에 맞는 비디오 데이터를 수신 받아 재생할 수 있다.

  • PDF

A Scalable Recovery Tree Construction Scheme Considering Spatial Locality of Packet Loss

  • Baek, Jin-Suk;Paris, Jehan-Francois
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제2권2호
    • /
    • pp.82-102
    • /
    • 2008
  • Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss among the receiver nodes in a multicast session. To recover packet transmission errors at the transport layer, tree-based protocols construct a logical tree for error recovery before data transmission is started. The current tree construction scheme does not scale well because it overloads the sender node. We propose a scalable recovery tree construction scheme considering these properties. Unlike the existing tree construction schemes, our scheme distributes some tasks normally handled by the sender node to specific nodes acting as repair node distributors. It also allows receiver nodes to adaptively re-select their repair node when they experience unacceptable error recovery delay. Simulation results show that our scheme constructs the logical tree with reduced message and time overhead. Our analysis also indicates that it provides fast error recovery, since it can reduce the number of additional retransmissions from its upstream repair nodes or sender node.

Implementation of outgoing packet processor for ATM based MPLS LER System

  • Park, Wan-Ki;Kwak, Dong-Yong;Kim, Dae-Yong
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -3
    • /
    • pp.1851-1854
    • /
    • 2002
  • The Internet with conventional routing scheme cannot meet user demands driven from drastic growth in the Internet user and various service and traffic type. MPLS(Multi Protocol Label Switching) was introduced to the Internet fur solution to resolve this problem. MPLS is a paradigm to integrate higher layer’s software routing functions including layer-3 routing with layer-2 switching. But, the exponential growth of Internet traffic brings out of label space. One scalable solution to cope with this problem is to introduce flow merge technique, i. e. a group of flows is forwarded using the same label. Specially, IETF(Internet Engineering Task Force) recommends that ATM based MPLS system may include VC merge function, so it is scalable to increase of internet traffic. We implemented the MPLS LER system that includes the look-up and forwarding function in incoming path and VC merging function and limited traffic management function in outgoing path. This paper describes the implementation of the LER’s outgoing parts.

  • PDF

FGS를 이용한 계층적 코딩기법에 관한 연구 (A Study on Sealable Video Coding Technique with Fine Granularity Scalability)

  • 김종욱;이배호
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2002년도 춘계학술발표논문집 (상)
    • /
    • pp.795-798
    • /
    • 2002
  • 본 논문에서는 MPEG-4 표준에서 채택된 FGS(Fine Granualrity Scalability)를 이용한 계층적 비디오 부호화 방법을 적용하였다. MPEG-4 FGS는 인터넷에서 이용되는 다양한 특성의 단말기들과 대역폭 변통에서 유연성 있는 기술이다. 적용된 MPEG-4 FGS 기술은 DCT 기반 비트 평면 부호화를 이용한다. 실험에서는 일반적인 SNR 계층 비디오 코딩(Multi-layered SNR scalable video coding)과의 비교를 통해 FGS의 효율성을 평가한다. 비교는 두 부호화 기술의 PSNR 값의 분석을 가지고 이루어졌고 MPEG-4 FGS 기술이 이전의 다층 SNR계층 비디오 부호화 방법보다 평균 $1\sim2dB$ 정도의 높은 값으로 나타났다. 이를 동해 MPEG-4 FGS가 효율성면에서 다층 SNR계층 비디오 부호화 방법보다 우수함을 알 수 있지만, 단일 계층부호화(Single-layered scalable video coding)에 비해서는 효율성이 낮게 나타났다.

  • PDF

확장형 컴퓨팅 구조를 위한 범용 컴파일러 설계 (Designing a Generic Compiler for Scalable Computing Fabric)

  • 타로파 에마뉴엘;이원종;바슨 스리니;한탁돈
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (B)
    • /
    • pp.394-396
    • /
    • 2006
  • A blooming area of processor design is represented by scalable computing fabric. As the structure of the processors developed using seal-able computing fabric evolved from simple programmable units to processors supporting change of flow instructions and function calls, an increasing interest is in developing the compiling technology that will allow us to harness not only the full power of their hardware but also to target multiple architectures. In this paper we present the front-end of a generic compiler, able to accept a various source languages and transform them in a common intermediate representation.

  • PDF