• 제목/요약/키워드: mean delay

검색결과 588건 처리시간 0.023초

Real-time Fluorescence Lifetime Imaging Microscopy Implementation by Analog Mean-Delay Method through Parallel Data Processing

  • Kim, Jayul;Ryu, Jiheun;Gweon, Daegab
    • Applied Microscopy
    • /
    • 제46권1호
    • /
    • pp.6-13
    • /
    • 2016
  • Fluorescence lifetime imaging microscopy (FLIM) has been considered an effective technique to investigate chemical properties of the specimens, especially of biological samples. Despite of this advantageous trait, researchers in this field have had difficulties applying FLIM to their systems because acquiring an image using FLIM consumes too much time. Although analog mean-delay (AMD) method was introduced to enhance the imaging speed of commonly used FLIM based on time-correlated single photon counting (TCSPC), a real-time image reconstruction using AMD method has not been implemented due to its data processing obstacles. In this paper, we introduce a real-time image restoration of AMD-FLIM through fast parallel data processing by using Threading Building Blocks (TBB; Intel) and octa-core processor (i7-5960x; Intel). Frame rate of 3.8 frames per second was achieved in $1,024{\times}1,024$ resolution with over 4 million lifetime determinations per second and measurement error within 10%. This image acquisition speed is 184 times faster than that of single-channel TCSPC and 9.2 times faster than that of 8-channel TCSPC (state-of-art photon counting rate of 80 million counts per second) with the same lifetime accuracy of 10% and the same pixel resolution.

Short Bus contention 방식의 Priority Output Queuing Model의 분석 (The Analysis of Priority Output Queuing Model by Short Bus Contention Method)

  • 정용주
    • 한국정보처리학회논문지
    • /
    • 제6권2호
    • /
    • pp.459-466
    • /
    • 1999
  • I broadband ISDN every packet will show different result if it would be processed according to its usage by the server. That is, normal data won't show big differences if they would be processed at normal speed. But it will improve the quality of service to process some kinds of data - for example real time video or voice type data or some data for a bid to by something through the internet - more fast than the normal type data. solution for this problem was suggested - priority packets. But the analyses of them are under way. Son in this paper a switching system for an output queuing model in a single server was assumed and some packets were given priorities and analysed. And correlation, simulating real life situation, was given too. These packets were analysed through three cases, first packets having no correlation, second packets having only correlation and finally packets having priority three cases, first packets having no correlation, second packets having only correlation and finally packets having priority and correlation. The result showed that correlation doesn't affect the mean delay time and the high priority packets have improved mean delay time regardless of the arrival rate. Those packets were assumed to be fixed-sized like ATM fixed-sized cell and the contention strategy was assumed to be short bus contention method for the output queue, and the mean delay length and the maximum 버퍼 length not to lose any packets were analysed.

  • PDF

Improved Maximum Access Delay Time, Noise Variance, and Power Delay Profile Estimations for OFDM Systems

  • Wang, Hanho;Lim, Sungmook;Ko, Kyunbyoung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권12호
    • /
    • pp.4099-4113
    • /
    • 2022
  • In this paper, we propose improved maximum access delay time, noise variance, and power delay profile (PDP) estimation schemes for orthogonal frequency division multiplexing (OFDM) system in multipath fading channels. To this end, we adopt the approximate maximum likelihood (ML) estimation strategy. For the first step, the log-likelihood function (LLF) of the received OFDM symbols is derived by utilizing only the cyclic redundancy induced by cyclic prefix (CP) without additional information. Then, the set of the initial path powers is sub-optimally obtained to maximize the derived LLF. In the second step, we can select a subset of the initial path power set, i.e. the maximum access delay time, so as to maximize the modified LLF. Through numerical simulations, the benefit of the proposed method is verified by comparison with the existing methods in terms of normalized mean square error, erroneous detection, and good detection probabilities.

GPON에서 동적 대역할당 방안의 지연성능 분석 (Delay Performance Analysis of a Dynamic Bandwidth Allocation Scheme in a GPON)

  • 박철근;정해;김진희
    • 한국통신학회논문지
    • /
    • 제33권9B호
    • /
    • pp.813-821
    • /
    • 2008
  • 최근 인터넷을 기반으로 하는 응용프로그램과 인터넷 사용자들의 급격한 증가에 부응해 가입자 루프의 고속화 방안으로 여러 가지 PON 방식이 도입되고 있다. GPON은 이러한 PON 방식중 대표적인 접속망 기술로 상향 트래픽의 효율적인 전송을 위해 DBA 방안을 채택하고 있다. 본 논문에서는 GPON에서 동적대역 할당방안의 지연성능을 분석하기 위해 2단계 버퍼를 갖는 개찰 폴링 시스템을 도입한다. 평균 사이클 타임을 유도하고 패킷의 평균 지연 시간을 구하기 위해 연속시간 큐잉 모델을 사용한다. 수치해석 결과를 이용하여 대칭형 폴링 시스템에 대한 지연 성능을 조사한다.

3GPP ARQ를 위한 재정렬 버퍼의 점유량 조절 방식 (Occupancy Control Scheme for Reordering Buffer at 3GPP ARQ)

  • 신우철;박진경;하준;최천원
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 I
    • /
    • pp.65-68
    • /
    • 2003
  • 3GPP's RLC protocol specification adopted an error control scheme based on selective repeat ARQ. In 3GPP ARQ, distinctive windows are provide at transmitting and receiving stations so that those stations are prohibited to send or receive data PDU's out of window. An increase in window size enhances delay performance. Such an increase, however, raises the occupancy at reordering buffer, which results in a long reordering time. Aiming at suppressing the occupancy at reordering buffer, we propose a occupancy control scheme in this paper. In this scheme, a threshold is created in the receiving station's window and a data PDU out of the threshold (but within the window) is treated according to go back N ARQ. By the employment of the occupancy control scheme, the occupancy at the reordering buffer is apparently reduced, while the delay performance may be degraded due to the properties of go back N ARQ. We, thus, investigate the peak occupancy and mean delay performance by a simulation method. From numerical examples, we observe a trade-off in both performance measures and conclude that the peak occupancy is effectively reduced by setting a proper threshold under a constraint on mean delay performance.

  • PDF

IEEE 802.11 무선랜을 위한 지하철 터널 환경에서 다양한 지향성 빔의 전파측정 (Propagation Measurements of Various Directional Beam in Subway funnel Environments for IEEE 802.11 Wireless LAN)

  • 박노준;송문규;강영진
    • 한국정보통신학회논문지
    • /
    • 제8권2호
    • /
    • pp.232-238
    • /
    • 2004
  • 본 논문에서는 각각 2.4㎓ 대역과 5.8㎓ 대역에서 팬빔 안테나, 원형편파 안테나 그리고 지향성 안테나를 사용하여 지하철 터널에서의 전파 특성을 실험하였다. 협대역 채널 측정의 격과, NLOS (Non-Line-Of-Sight) 경로에서 수신전력 레벨이 LOS(Line-Of-Sight)에 비하여 급격히 감소함을 보였다. 광대역채널 측정은 PN sliding correlation 방법을 사용하여 수행하였다. 2.4㎓ 대역과 5.8㎓ 대역을 포함하는 IEEE 802.11 무선랜 대역에서 다양한 지향성 빔에 대한 평균초과지연(mean access delay)과 RMS 지연확산(RMS delay spread) 등의 채널 파라미터를 비교하였다.

IEEE 802.11e EDCA 무선랜의 매체 접속 지연 시간 및 정상 상태에서의 패킷 지연 분석 (Access delay and packet delay of EDCA in IEEE 802.11e wireless network)

  • 이유태;장종민;이계상;김동일;김창규
    • 한국정보통신학회논문지
    • /
    • 제12권8호
    • /
    • pp.1420-1426
    • /
    • 2008
  • 본 논문은 IEEE 802.11e 무선랜 환경에서 단말 수에 따른 각 AC(Access Category)별 포화 상태의 시스템 처리율과 관련한 기존 결과에 기반을 두어, IEEE 802.11e 무선랜 네트워크에서의 패킷 전송시간 간격을 통해, 각 AC별 매체 접속 지연 시간을 유도한다. 이 매체 접속 지연 시간을 서비스시간으로 갖는 대기행렬모형을 이용하여, 정상 상태에서의 각 AC별 대 기열의 길이와 패킷 지연 시간을 유도한다. 또한, 수치 해석과 모의 실험을 통하여 모형의 정확성을 검증하고 각 AC별 성능을 분석한다.

딥러닝 기반 GNSS 천정방향 대류권 습윤지연 추정 연구 (Estimation of GNSS Zenith Tropospheric Wet Delay Using Deep Learning)

  • 임수현;배태석
    • 한국측량학회지
    • /
    • 제39권1호
    • /
    • pp.23-28
    • /
    • 2021
  • 최근 딥러닝을 활용한 데이터 분석 연구가 다양한 분야에서 진행되고 있다. 본 논문에서는 딥러닝 모델인 MLP (Multi-Layer Perceptron)와 LSTM (Long Short-Term Memory) 모델을 통해 ZWD (Zenith tropospheric Wet Delay)을 추정함으로써 딥러닝을 활용한 GNSS (Global Navigation Satellite System) 기반 기상 연구를 수행하였다. 딥러닝 모델은 기상 데이터와 천정방향 대류권 총 지연, 건조지연을 통해 추정한 ZWD로 학습되었고, 학습에 사용되지 않은 기상 데이터를 학습된 모델에 적용하여 두 모델에서 센티미터 수준의 RMSE (Root Mean Square Error)로 ZWD 결과를 산출하였다. 추후 해안지역의 GNSS 데이터를 함께 사용하고 시간 해상도를 높여 다양한 상황에서도 ZWD가 추정될 수 있도록 추가적인 연구가 수행될 필요가 있다.

LONG-TERM VARIATION OF THE SHUTTER DELAY TIME OF Y4KCAM OF THE CTIO 1.0 M TELESCOPE

  • Lee, Jae-Woo;Pogge, Richard
    • 천문학회지
    • /
    • 제49권6호
    • /
    • pp.289-293
    • /
    • 2016
  • We investigate the long-term spatial drift of the center and the temporal variation of the shutter delay time map of Y4KCam mounted on the CTIO 1.0 m telescope. We have collected shutter delay time maps over eight years as a part of our long-term survey program. We find that the center of the shutter delay time map can drift up to $450{\mu}m$, equivalent to ${\approx}30pixels$, on the CCD. This effect can result in a small amount of error in integration time without the proper shutter delay time correction, but it does not appear to cause any significant problems in photometric measurements. We obtain a mean shutter delay time of $69.1{\pm}0.8$ ms and find no temporal variation of the shutter delay time of Y4KCam over eight years, indicative of the mechanical stability of the shutter. We suggest that using a master shutter delay time correction frame would be sufficient to achieve high precision photometry, which does not exceed photometric errors ${\approx}1.7mmag$ across the CCD frame for exposure times longer than 1 s.

스토캐스틱 시간지연 시스템을 위한 동적 출력궤환 제어기 설계 (Dynamic Output-Feedback Controller Design for Stochastic Time-Delay Systems)

  • 최현철;정진우;심형보;서진헌
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2008년도 학술대회 논문집 정보 및 제어부문
    • /
    • pp.462-463
    • /
    • 2008
  • This paper proposes a method for dynamic output-feedback controller design for stochastic time-delay systems. Based on recent results on time-delay systems control, a tractable and delay-dependent design condition is proposed, which provides a dynamic output-feedback controller to render the closed-loop stochastic time-delay systems to be asymptotically stable in the mean-square sense. The feasibility problem of the proposed condition is recast into a cone complementarity problem. An algorithm adopting cone complementarity linearization is presented to solve the resulting problem.

  • PDF