• Title/Summary/Keyword: buffer constraint

Search Result 50, Processing Time 0.024 seconds

H/W Design and Implementations of the Wideband Data Processing system for the AMPS (이동통신 AMPS에서 광대역 데이터 송.수신을 위한 하드웨어 설계에 관한 연구)

  • 이준동;김대중;김종일;이영천;조형래;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.3
    • /
    • pp.247-259
    • /
    • 1992
  • In this paper, the types of the data exchange between a cell site and a cobile phonefor the call processing on the AMPS(Advanced Mobile Phone Service) are investigated, and the circuit for processing the wideband data stream according to the data types is designed and implemented. The circuit for detecting the Busy / Idle bit which is needed for determining the channel access, the circuit for detecting the word sync and the circuit for transmitting and receiving the wideband data is designed. The 3-out-of-5 majority vote of the 5received data is performed to reduce error and an algorithm requiring a small buffer size for real time processing of voting process is proposed. The method to overcome the computational complexity and the real time constraint of the conventional BCH decoding is proposed.

  • PDF

Joint Source/Channel Rate Control based on Adaptive Frame Skip for Real-Time Video Transmission (적응형 화면 스킵 기반 실시간 비디오의 소스/채널 통합 부호화율 제어)

  • Lee, Myeong-Jin
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.4
    • /
    • pp.523-531
    • /
    • 2009
  • In this study, we propose a joint source/channel rate control algorithm for video encoder targeting packet erasure channel. Based on the buffer constraints of video communication systems, encoding rate constraint is presented. After defining source distortion models for coded and skipped video frames and a channel distortion model for packet errors and their propagation, an average distortion model of received video is proposed for a given encoding window. Finally, we define an optimization problem to minimize the average distortion for given channel rates and packet loss rates by controlling spatio-temporal parameters of source video and FEC block sizes. Then, we propose a window-based algorithm to solve the problem in real-time.

  • PDF

Magnetic Properties of Multiferroic $BiFeO_3/BaTiO_3$ Bi-layer Thin Films

  • Yang, P.;Byun, S.H.;Kim, K.M.;Lee, Y.H.;Lee, J.Y.;Zhu, J.S.;Lee, H.Y.
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2008.06a
    • /
    • pp.318-319
    • /
    • 2008
  • In this article, magnetic properties of multiferroic bi-layer $BiFeO_3$ (BFO)/$BaTiO_3$ (BTO) thin films were studied. It was found that the magnetization increased by the insertion of BTO buffer layer even though the interfacial stress was slightly relaxed, which indicated a coupling between the ferroelectric and ferromagnetic orders. Furthermore, with slightly increase of BFO film thickness, both BFO and BFO/BTO bi-layer films showed anisotropic magnetic properties with higher in-plane magnetization than the values measured out-of-plane. These are attributable to strain constraint effect at the interface.

  • PDF

A Selective Layer Discard Algorithm for Stored Video Delivery over Resource Constrained Networks (자원 제약이 있는 네트워크에서 저장 비디오 데이터의 효율적인 전송을 위한 선택적 계층삭제 알고리즘)

  • No, Ji-Won;Lee, Mi-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.8C no.5
    • /
    • pp.647-656
    • /
    • 2001
  • Video delivery from a server to a client across a network system is an important part of many multimedia applications. Usually, the network system has constraint in both the amount of network bandwidth and the buffer size in the client. While delivering a video stream across such a constrained network system, loss of frames may be unavoidable. The system resources consumed by the dropped frames are wasted, and the losses of frames would result in discontinuous display at the client. In this paper, for delivering hierarchically encoded video stream, we introduce the notion of selective layer discard algorithm at the server which not only preemptively discards data at the server but also drops less important part of a frame instead of the entire frame. By the simulation, we compare the proposed selective layer discard algorithm and the existing selective frame discard algorithm. The simulation results show that the proposed algorithm may improve the quality of decoded video, and decrease the replay discontinuity at the client.

  • PDF

Embedded Compression Codec Algorithm for Motion Compensated Wavelet Video Coding System (움직임 보상된 웨이블릿 기반의 비디오 코딩 시스템에 적용 가능한 임베디드 압축 코덱 알고리즘)

  • Kim, Song-Ju
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.3
    • /
    • pp.77-83
    • /
    • 2012
  • In this paper, a low-complexity embedded compression (EC) Codec algorithm for the wavelet video coder is applied to reduce excessive external memory requirements. The EC algorithm is used to achieve a fixed compression ratio of 50 % under the near-lossless-compression constraint. The EC technique can reduce the 50 % memory requirement for intermediate low-frequency coefficients during multiple discrete wavelet transform stages compared with direct implementation of the wavelet video encoder of this paper. Furthermore, the EC scheme based on a forward adaptive quantization and fixed length coding can save bandwidth and size of buffer between DWT and SPIHT to 50 %. Simulation results show that our EC algorithm present only PSNR degradation of 0.179 and 0.162 dB in average when the target bit-rate of the video coder are 1 and 0.5 bpp, respectively.

Maximizing Concurrency and Analyzable Timing Behavior in Component-Oriented Real-Time Distributed Computing Application Systems

  • Kim, Kwang-Hee Kane;Colmenares, Juan A.
    • Journal of Computing Science and Engineering
    • /
    • v.1 no.1
    • /
    • pp.56-73
    • /
    • 2007
  • Demands have been growing in safety-critical application fields for producing networked real-time embedded computing (NREC) systems together with acceptable assurances of tight service time bounds (STBs). Here a service time can be defined as the amount of time that the NREC system could take in accepting a request, executing an appropriate service method, and returning a valid result. Enabling systematic composition of large-scale NREC systems with STB certifications has been recognized as a highly desirable goal by the research community for many years. An appealing approach for pursuing such a goal is to establish a hard-real-time (HRT) component model that contains its own STB as an integral part. The TMO (Time-Triggered Message-Triggered Object) programming scheme is one HRT distributed computing (DC) component model established by the first co-author and his collaborators over the past 15 years. The TMO programming scheme has been intended to be an advanced high-level RT DC programming scheme that enables development of NREC systems and validation of tight STBs of such systems with efforts far smaller than those required when any existing lower-level RT DC programming scheme is used. An additional goal is to enable maximum exploitation of concurrency without damaging any major structuring and execution approaches adopted for meeting the first two goals. A number of previously untried program structuring approaches and execution rules were adopted from the early development stage of the TMO scheme. This paper presents new concrete justifications for those approaches and rules, and also discusses new extensions of the TMO scheme intended to enable further exploitation of concurrency in NREC system design and programming.

Verification of ERP Standard Time Using TOC Technique and Improvement of MES Routing Point (TOC 기법을 적용한 ERP 표준시간 검증 및 MES 공정실적개선)

  • Kim, Sung-Min;Ahn, Jaekyoung
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.41 no.4
    • /
    • pp.22-33
    • /
    • 2018
  • Recently domestic manufacturing companies have been experiencing worsening profitability and stunted growth due to the long-term economic recession and the rapid rise of developing countries such as China and Southeast Asia. These difficulties force many companies to concentrate their core competencies on new value creation and innovation in order to gain momentum for new growth. Enterprise Resource Planning (ERP) has been considered as one of viable solutions. Among the various modules in ERP, shop floor control function in the production management module is rather limited. In order to overcome this problem, Manufacturing Execution System (MES) has been used as a subsystem which has a strong information gathering power and flexibility. Both systems interact closely with each other. In particular, ERP requires fast, accurate shop floor information at MES. This paper describes how to synchronize relevant information between ERP and MES with theory of constraints (TOC). The processing time information transmitted from the MES workplace is received at the ERP workplace. In the process, the received processing time is causing information distortion in ERP, when the information gathering standard of MES is different from the ERP information interpretation standard. The Drum-Buffer-Rope theory of TOC was applied to resolve this problem, therefore, information synchronization between both systems was made. As a precondition, the standard time of the upper ERP system was rearranged according to the capacity constraints resource. As a result, standard time restructuring has affected changes in labor costs. Standard labor costs have come close to actual ones, and information synchronization of MES transmission data has improved the reliability of standard product costs, such that it enabled various company-wide restructuring actions to be much more effective.

A Bio-inspired Hybrid Cross-Layer Routing Protocol for Energy Preservation in WSN-Assisted IoT

  • Tandon, Aditya;Kumar, Pramod;Rishiwal, Vinay;Yadav, Mano;Yadav, Preeti
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.4
    • /
    • pp.1317-1341
    • /
    • 2021
  • Nowadays, the Internet of Things (IoT) is adopted to enable effective and smooth communication among different networks. In some specific application, the Wireless Sensor Networks (WSN) are used in IoT to gather peculiar data without the interaction of human. The WSNs are self-organizing in nature, so it mostly prefer multi-hop data forwarding. Thus to achieve better communication, a cross-layer routing strategy is preferred. In the cross-layer routing strategy, the routing processed through three layers such as transport, data link, and physical layer. Even though effective communication achieved via a cross-layer routing strategy, energy is another constraint in WSN assisted IoT. Cluster-based communication is one of the most used strategies for effectively preserving energy in WSN routing. This paper proposes a Bio-inspired cross-layer routing (BiHCLR) protocol to achieve effective and energy preserving routing in WSN assisted IoT. Initially, the deployed sensor nodes are arranged in the form of a grid as per the grid-based routing strategy. Then to enable energy preservation in BiHCLR, the fuzzy logic approach is executed to select the Cluster Head (CH) for every cell of the grid. Then a hybrid bio-inspired algorithm is used to select the routing path. The hybrid algorithm combines moth search and Salp Swarm optimization techniques. The performance of the proposed BiHCLR is evaluated based on the Quality of Service (QoS) analysis in terms of Packet loss, error bit rate, transmission delay, lifetime of network, buffer occupancy and throughput. Then these performances are validated based on comparison with conventional routing strategies like Fuzzy-rule-based Energy Efficient Clustering and Immune-Inspired Routing (FEEC-IIR), Neuro-Fuzzy- Emperor Penguin Optimization (NF-EPO), Fuzzy Reinforcement Learning-based Data Gathering (FRLDG) and Hierarchical Energy Efficient Data gathering (HEED). Ultimately the performance of the proposed BiHCLR outperforms all other conventional techniques.

A Cell Loss Constraint Method of Bandwidth Renegotiation for Prioritized MPEG Video Data Transmission in ATM Networks (ATM망에서 우선 순위가 주어진 MPEG 비디오 데이터 전송시 대역폭 재협상을 통한 셀 손실 방지 기법)

  • Yun, Byoung-An;Kim, Eun-Hwan;Jun, Moon-Seog
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1770-1780
    • /
    • 1997
  • Our problem is improvement of image quality because it is inevitable cell loss of image data when traffic congestion occurs. If cells are discarded indiscriminately in transmission of MPEG video data, it occurs severe degradation in quality of service(QOS). In this paper, to solve this problem, we propose two method. The first, we analyze the traffic characteristics of an MPEG encoder and generate high priority and low priority data stream. During network congestion, only the least low priority cells are dropped, and this ensures that the high priority cells are successfully transmitted, which, in turn, guarantees satisfactory QoS. In this case, the prioritization scheme for the encoder assigns components of the data stream to each priority level based on the value of a parameter ${\beta}$. The second, Number of high priority cells are increased when value of ${\beta}$ is large. It occurs the loss of high priority cell in the congestion. To prevent it, this paper is regulated to data stream rate as buffer occupancy with UPC controller. Therefore, encoder's bandwidth can be calculated renegotiation of the encoder and networks. In this paper, the encoder's bandwidth requirements are characterized by a usage parameter control (UPC) set consisting of peak rate, burstness, and sustained rate. An adaptive encoder rate control algorithm at the Networks Interface Card(NIC) computes the necessary UPC parameter to maintain the user specified quality of service. Simulation results are given for a rate-controlled VBR video encoder operating through an ATM network interface which supports dynamic UPC. These results show that dynamic bandwidth renegotiation of prioritized data stream could provided bandwidth saving and significant quality gains which guarantee high priority data stream.

  • PDF

Scheduling System using CSP leer Effective Assignment of Repair Warrant Job (효율적인 A/S작업 배정을 위한 CSP기반의 스케줄링 시스템)

  • 심명수;조근식
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2000.11a
    • /
    • pp.247-256
    • /
    • 2000
  • 오늘날의 기업은 상품을 판매하는 것 뿐만 아니라 기업의 신용과 이미지를 위해 그 상품에 대한 사후처리(After Service) 업무에 많은 투자를 하고 있다. 이러한 양질의 사후서비스를 고객에게 공급하기 위해서는 많은 인력을 합리적으로 관리해야 하고 요청되는 고장수리 서비스 업무를 빠르게 해결하기 위해서는 업무를 인력들에게 합리적으로 배정을 하고 회사의 비용을 최소화하면서 정해진 시간에 요청된 작업을 처리하기 위해서는 인력들에게 작업을 배정하고 스케줄링하는 문제가 발생된다. 본 논문에서는 이러한 문제를 해결하기 위해 화학계기의 A/S 작업을 인력에게 합리적으로 배정하는 스케줄링 시스템에 관한 연구이다. 먼저 스케줄링 모델을 HP 사의 화학분석 및 시스템을 판매, 유지보수 해 주는 "영진과학(주)"회사의 작업 스케줄을 분석하여 필요한 도메인과 고객서비스전략과 인력관리전략에서 제약조건을 추출하였고 여기에 스케줄링 문제를 해결하기 위한 방법으로 제약만족문제(CSP) 해결기법인 도메인 여과기법을 적용하였다. 도메인 여과기법은 제약조건에 의해 변수가 갖는 도메인의 불필요한 부분을 여과하는 것으로 제약조건과 관련되어 있는 변수의 도메인이 축소되는 것이다. 또한, 스케줄링을 하는데에 있어서 비용적인 측면에서의 스케줄링방법과 고객 만족도에서의 스케줄링 방법을 비교하여 가장 이상적인 해를 찾는데 트래이드오프(Trade-off)를 이용하여 최적의 해를 구했으며 실험을 통해 인력에게 더욱 효율적으로 작업들을 배정 할 수 있었고 또한, 정해진 시간에 많은 작업을 처리 할 수 있었으며 작업을 처리하는데 있어 소요되는 비용을 감소하는 결과를 얻을 수 있었다. 검증하였다.를, 지지도(support), 신뢰도(confidence), 리프트(lift), 컨빅션(conviction)등의 관계를 통해 다양한 방법으로 모색해본다. 이 연구에서 제안하는 이러한 개념계층상의 흥미로운 부분의 탐색은, 전자 상거래에서의 CRM(Customer Relationship Management)나 틈새시장(niche market) 마케팅 등에 적용가능하리라 여겨진다.선의 효과가 나타났다. 표본기업들을 훈련과 시험용으로 구분하여 분석한 결과는 전체적으로 재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity

  • PDF