• Title/Summary/Keyword: Software Buffering

Search Result 13, Processing Time 0.024 seconds

Software Buffering Technique For Real-time Recording of High Speed Satellite Data

  • Shin, Dong-Seok;Choi, Wook-Hyun;Kim, Moon-Gyu;Park, Won-Kyu
    • Korean Journal of Remote Sensing
    • /
    • v.18 no.3
    • /
    • pp.147-153
    • /
    • 2002
  • The real-time reception and recording of down-link mission data from a satellite requires the highest reliability because the data lost in receiving process cannot be recovered. The data receiving and recording system has moved from a set of dedicated hardware and software components to commercial-off-the-shelf (COTS) components in order to reduce the system cost as well as to upgrade the system easily for handling other satellite data. The use of COTS hardware and middleware components prevents the system developer from correcting or modifying the internal operations of the COTS components, and hence, instant performance degradation of the COTS components which affects the reliable data acquisition must be covered by a software algorithm. This paper introduces the instant performance problem of a COTS data recording device which leads to the data loss in the real-time data reception and recording process. As a result, the requirement of the modification of the conventional data read/write technique is issued. In order to overcome the data loss problem due to the use of COTS components and the conventional software technique, a new algorithm called a software buffering technique is proposed. The experiments show that the application of the proposed technique results in reliable real-time reception and recording of high speed serial data.

Design of Smart OTT Platform based on the Analysis of Adaptive Buffering (적응 버퍼링 성능분석 기반의 스마트 OTT 플랫폼 설계☆)

  • Kim, Inki;Kang, Mingoo
    • Journal of Internet Computing and Services
    • /
    • v.17 no.4
    • /
    • pp.19-26
    • /
    • 2016
  • In this paper, the dynamic buffering based smart OTT platform was proposed, and analyzed for adaptive bit-rate video delivery with the optimization of HLS (HTTP Live Streaming). This platform consists of the software platform between sever and client which detects the bandwidth capacity, and adjusts the quality of the streaming for multiple bit-rates resolutions. In order to apply adaptive buffering, two buffers are added to the basic HLS player, and each buffer is responsible for constantly buffering a previous and the next channels relative to the current channel. This adaptive transmitting with smart OTT platform is superior to delivering a static video file at a single buffering, because the video stream of adaptive double buffers can be switched streaming according to client's available network speed. As a result, this proposed smart OTT can be cooperated to the application of HLS server with segmented H.265 MPEG-2 TS video & m3u8 files with its information based on the optimized transmission channel state of live and VOD, and applied to PLC transmission, too.

A Study on the Evaluation of MPEG-4 Video Decoding Complexity for HDTV (HDTV를 위한 MPEG-4 비디오 디코딩 복잡도의 평가에 관한 연구)

  • Ahn, Seong-Yeol;Park, Won-Woo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.595-598
    • /
    • 2005
  • MPEG-4 Visual is, and international standard for the object-based video compression, designed for supporting a wide range of applications from multimedia communication to HDTV. To control the minimum decoding complexity required at the decoder, the MPEG-4 Visual standard defines the co-called video buffering mechanism, which includes three video buffer models. Among them, the VCV(Video Complexity Verifier) defines the control of the processing speed for decoding of a macroblock, there are two models: VCV and B-VCV distinguishing the boundary and non-boundary MB. This paper presents the evaluation results of decoding complexity by measuring decoding time of a MB for rectangular, arbitrarily shaped video objects and the various types of objects supporting the resolution of HDTV using the optimized MPEG-4 Reference Software. The experimental results shows that decoding complexity varies depending on the coding type and more effective usage of decoding resources may be possible.

  • PDF

A Fully Synthesizable Bluetooth Baseband Module for a System-on-a-Chip

  • Chun, Ik-Jae;Kim, Bo-Gwan;Park, In-Cheol
    • ETRI Journal
    • /
    • v.25 no.5
    • /
    • pp.328-336
    • /
    • 2003
  • Bluetooth is a specification for short-range wireless communication using the 2.4 GHz ISM band. It emphasizes low complexity, low power, and low cost. This paper describes an area-efficient digital baseband module for wireless technology. For area-efficiency, we carefully consider hardware and software partitioning. We implement complex control tasks of the Bluetooth baseband layer protocols in software running on an embedded microcontroller. Hardware-efficient functions, such as low-level bitstream link control; host controller interfaces (HCIs), such as universal asynchronous receiver transmitter (UART) and universal serial bus (USB)interfaces; and audio Codec are performed by dedicated hardware blocks. Furthermore, we eliminate FIFOs for data buffering between hardware functional units. The design is done using fully synthesizable Verilog HDL to enhance the portability between process technologies so that our module can be easily integrated as an intellectual property core no system-on-a-chip (SoC) ASICs. A field programmable gate array (FPGA) prototype of this module was tested for functional verification and realtime operation of file and bitstream transfers between PCs. The module was fabricated in a $0.25-{\mu}m$ CMOS technology, the core size of which was only 2.79 $mm{\times}2.80mm$.

  • PDF

Reducing the Flow Completion Time for Multipath TCP

  • Heo, GeonYeong;Yoo, Joon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.8
    • /
    • pp.3900-3916
    • /
    • 2019
  • The modern mobile devices are typically equipped with multiple network interfaces, e.g., 4G LTE, Wi-Fi, Bluetooth, but the current implementation of TCP can support only a single path at the same time. The Multipath TCP (MPTCP) leverages the multipath feature and provides (i) robust connection by utilizing another interface if the current connection is lost and (ii) higher throughput than single path TCP by simultaneously leveraging multiple network paths. However, if the performance between the multiple paths are significantly diverse, the receiver may have to wait for packets from the slower path, causing reordering and buffering problems. To solve this problem, previous MPTCP schedulers mainly focused on predicting the latency of the path beforehand. Recent studies, however, have shown that the path latency varies by a large margin over time, thus the MPTCP scheduler may wrongly predict the path latency, causing performance degradation. In this paper, we propose a new MPTCP scheduler called, choose fastest subflow (CFS) scheduler to solve this problem. Rather than predicting the path latency, CFS utilizes the characteristics of these paths to reduce the overall flow completion time by redundantly sending the last part of the flow to both paths. We compare the performance through real testbed experiments that implements CFS. The experimental results on both synthetic packet generation and actual Web page requests, show that CFS consistently outperforms the previous proposals in all cases.

Visualization Technique of Spatial Statistical Data and System Implementation (공간 통계 데이터의 시각화 기술 및 시스템 개발)

  • Baek, Ryong;Hong, Gwang-Soo;Yang, Seung-Hoon;Kim, Byung-Gyu
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.12
    • /
    • pp.849-854
    • /
    • 2013
  • In this paper, a system technology-based algorithms and visualization is proposed to show a space data. Also the proposed system provides analysis function with combination of usual map and automatic document generation function to give a useful information for making an important decision based on spatial distributed data. In the proposed method, we employ the heat map analysis to present a suitable color distribution for 2 dimensional map data. The buffering analysis method is also used to define the spatial data access. By using the proposed system, spatial information in a variety of distribution will be easy to identify. Also, if we make a use of automatic document generation function in the proposed algorithm, a lot of time and cost savings are expected to make electronic document which representation of spatial information is required.

3D Printing Based Patient-specific Orbital Implant Design and Production by Using A Depth Image (깊이 영상을 이용한 3D 프린팅 기반 환자 맞춤형 안와 임플란트의 설계 및 제작)

  • Seo, Udeok;Kim, Ku-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.8
    • /
    • pp.903-914
    • /
    • 2020
  • In this paper, we present a novel algorithm to generate a 3D model of patient-specific orbital implant, which is finally produced by the 3D printer. Given CT (computed tomography) scan data of the defective orbital wall or floor, we compose the depth image of the defect site by using the depth buffering, which is a computer graphics technology. From the depth image, we compute the 3D surface which fills the broken part by interpolating the points around the broken part. By thickening the 3D surface, we get the 3D volume mesh of the orbital implant. Our algorithm generates the patient-specific orbital implant whose shape is accurately coincident to the broken part of the orbit. It provides the significant time efficiency for manufacturing the implant with supporting high user convenience.

Hardware Implementation for Real-Time Speech Processing with Multiple Microphones

  • Seok, Cheong-Gyu;Choi, Jong-Suk;Kim, Mun-Sang;Park, Gwi-Tea
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.215-220
    • /
    • 2005
  • Nowadays, various speech processing systems are being introduced in the fields of robotics. However, real-time processing and high performances are required to properly implement speech processing system for the autonomous robots. Achieving these goals requires advanced hardware techniques including intelligent software algorithms. For example, we need nonlinear amplifier boards which are able to adjust the compression radio (CR) via computer programming. And the necessity for noise reduction, double-buffering on EPLD (Erasable programmable logic device), simultaneous multi-channel AD conversion, distant sound localization will be explained in this paper. These ideas can be used to improve distant and omni-directional speech recognition. This speech processing system, based on embedded Linux system, is supposed to be mounted on the new home service robot, which is being developed at KIST (Korea Institute of Science and Technology)

  • PDF

METHODOLOGY TO ENHANCE THE PREDICTABILITY OF I/O DATA EXCHANGE BETWEEN DEVICE AND TASKS (장치와 태스크 간 입출력 데이터 교환의 예측성 향상 방안)

  • Koo, Cheol-Hea;Yang, Koon-Ho;Choi, Seong-Bong
    • Journal of Astronomy and Space Sciences
    • /
    • v.24 no.4
    • /
    • pp.451-456
    • /
    • 2007
  • Data coming from devices shall be transported to a specific task to be used in a software with the most accurate time and data integrity. During this process, a potential cause for invoking structured hazard and performance degradation is dormant. In this paper, a method which can protect the data integrity from the possible data corruption when collision has happened during I/O data exchange between device and tasks is presented. Also, an example diagram of mechanism according to the method is shown and the effect, merits and demerits of the method is evaluated.

A Data-Consistency Scheme for the Distributed-Cache Storage of the Memcached System

  • Liao, Jianwei;Peng, Xiaoning
    • Journal of Computing Science and Engineering
    • /
    • v.11 no.3
    • /
    • pp.92-99
    • /
    • 2017
  • Memcached, commonly used to speed up the data access in big-data and Internet-web applications, is a system software of the distributed-cache mechanism. But it is subject to the severe challenge of the loss of recently uncommitted updates in the case where the Memcached servers crash due to some reason. Although the replica scheme and the disk-log-based replay mechanism have been proposed to overcome this problem, they generate either the overhead of the replica synchronization or the persistent-storage overhead that is caused by flushing related logs. This paper proposes a scheme of backing up the write requests (i.e., set and add) on the Memcached client side, to reduce the overhead resulting from the making of disk-log records or performing the replica consistency. If the Memcached server fails, a timestamp-based recovery mechanism is then introduced to replay the write requests (buffered by relevant clients), for regaining the lost-data updates on the rebooted Memcached server, thereby meeting the data-consistency requirement. More importantly, compared with the mechanism of logging the write requests to the persistent storage of the master server and the server-replication scheme, the newly proposed approach of backing up the logs on the client side can greatly decrease the time overhead by up to 116.8% when processing the write workloads.