• 제목/요약/키워드: Bit time delay

Search Result 271, Processing Time 0.03 seconds

A study on strategical statistical multiplexing of VBR MPEG bit streams and QoS based multiplexing gains (가변비트율 MPEG-2 비트열의 합성과 QoS를 고려한 다중화 이득에 관한 연구)

  • 장승기;서덕영;경문현;박섭형;정재일
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.11
    • /
    • pp.2836-2849
    • /
    • 1996
  • Over ATM network, variable bit rate(or VBR) traffic is allowed. Control of VBR traffic is allowed. Control of VBR traffic becomes difficult if it is bursty. VBR video traffic becomes so much bursty during intra frame period that much cell loss would occur when satistical multiplexed in ATM swich. To aviod cellloss, extra communication resources should be allocated, which reduces the capability of an ATM channel. In this paper, we propose two methods which enable a channel limited in resources to serve more VBR MPEG video bit streams. Firstly, we could redue the bitrate fluction of a statiscally multiplexed bundle of VBR video bit streams by reducing the number of intra frames overlapped at the same frame period. This method can be used in ATM switch which controls multiple video sources. Secondary, in two layer enoding, statistical multiplexing gains can be icreased by letting peak bit rate durations of both layers not be overlapped. This results in more smooth traffic. The performance of proposed methods are demonstrated by a proposed calculation method of statistical multiplexing gains(or SMGs.) The proposed SMG is based on both delay and cell loss QoS requirements at the same time.

  • PDF

Digit-Parallel/Bit-Serial Multiplier for GF$(2^m)$ Using Polynomial Basis (다항식기저를 이용한 GF$(2^m)$ 상의 디지트병렬/비트직렬 곱셈기)

  • Cho, Yong-Suk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11C
    • /
    • pp.892-897
    • /
    • 2008
  • In this paper, a new architecture for digit-parallel/bit-serial GF$(2^m)$ multiplier with low latency is proposed. The proposed multiplier operates in polynomial basis of GF$(2^m)$ and produces multiplication results at a rate of one per D clock cycles, where D is the selected digit size. The digit-parallel/bit-serial multiplier is faster than bit-serial ones but with lower area complexity than bit-parallel ones. The most significant feature of the proposed architecture is that a trade-off between hardware complexity and delay time can be achieved.

Algorithm and Experimental Verification of Underwater Acoustic Communication Based on Passive Time-Reversal Mirror (수동형 시역전에 기반한 수중음향통신 알고리즘 및 실험적 검증)

  • Eom, Min-Jeong;Kim, J.S.;Cho, Jung-Hong;Kim, Hoeyong;Sung, Il
    • The Journal of the Acoustical Society of Korea
    • /
    • v.33 no.6
    • /
    • pp.392-399
    • /
    • 2014
  • The underwater acoustic communication is characterized by doubly spread channels, which are the delay spread due to multiple paths and the doppler spread due to environmental fluctuations or a moving platform. An equalizer is used to remove the inter-symbol interferences that the delay spread causes, but an equalizer doesn't use an acoustic environment such as a multipath. However, a passive time-reversal mirror is simpler than an equalizer because a matched filter is implemented numerically at the receiver structure along with one-way propagation. In this paper, a passive time-reversal mirror is applied to remove interferences due to a multipath in sea-going experimental data in East Sea in Oct. 2010 and improved communication performance is confirmed. The performance is verified by comparing the signal-to-interference plus noise ratio before/after passive time-reversal mirror. It is also performed independently of the passive time-reversal mirror and adaptive equalizer and the bit error rate is compared to verify the performance of underwater acoustic communication.

Group Synchronization Method Using Adaptive Synchronization Delay Time for Media Streaming (미디어 스트리밍을 위한 적응적 동기 지연시간을 이용한 그룹 동기화 기법)

  • Kwon, Dongwoo;Ok, Kisu;Kim, Hyeonwoo;Ju, Hongtaek
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.3
    • /
    • pp.506-515
    • /
    • 2015
  • In this paper, we propose a group playback synchronization method using adaptive synchronization delay time by the bit rate of media to synchronize a play position of streaming media between mobile smart devices. This method consists of streaming server-side and client-side synchronization algorithms based on synchronization delay time which includes connection time, control packet transmission time, streaming data buffering time, and synchronization processing time. We implement the Android media player application with synchronization support using the proposed algorithms and present the result of performance evaluation.

Low Latency Systolic Multiplier over GF(2m) Using Irreducible AOP (기약 AOP를 이용한 GF(2m)상의 낮은 지연시간의 시스톨릭 곱셈기)

  • Kim, Kee-Won;Han, Seung-Chul
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.11 no.4
    • /
    • pp.227-233
    • /
    • 2016
  • Efficient finite field arithmetic is essential for fast implementation of error correcting codes and cryptographic applications. Among the arithmetic operations over finite fields, the multiplication is one of the basic arithmetic operations. Therefore an efficient design of a finite field multiplier is required. In this paper, two new bit-parallel systolic multipliers for $GF(2^m)$ fields defined by AOP(all-one polynomial) have proposed. The proposed multipliers have a little bit greater space complexity but save at least 22% area complexity and 13% area-time (AT) complexity as compared to the existing multipliers using AOP. As compared to related works, we have shown that our multipliers have lower area-time complexity, cell delay, and latency. So, we expect that our multipliers are well suited to VLSI implementation.

Effect Analysis of Timing Offsets for Asynchronous MC-CDMA Uplink Systems (비동기 MC-CDMA 상향 링크 시스템에서의 시간 옵셋 영향 분석)

  • Ko, Kyun-Byoung;Woo, Choong-Chae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.8
    • /
    • pp.1-8
    • /
    • 2010
  • This paper models a symbol timing offset (STO) with respect to the guard period and the maximum access delay time for asynchronous multicarrier code division multiple access (MC-CDMA) uplink systems over frequency-selective multipath fading channels. Analytical derivation shows that STO causes desired signal power degradation and generates self-interferences. This effect of the STO on the average bit error rate (BER) and the effective signal-to-noise ratio (SNR) is evaluated. The approximated BER and the SNR loss caused by STO are then obtained as closed-form expressions. The tightness between the analytical result and the simulated one is verified for the different STOs and SNRs. Furthermore, the derived analytical results are verified via Monte Carlo simulations.

The Effect of Asynchronous Haptic and Video Feedback on Teleoperation and a Comment for Improving the Performance (비 동기화된 촉각과 영상 시간지연이 원격조종로봇에 미치는 영향과 성능 향상을 위한 조언)

  • Kim, Hyuk;Ryu, Jee-Hwan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.2
    • /
    • pp.156-160
    • /
    • 2012
  • In this paper, we investigate the effect of asynchronous haptic and video feedback on the performance of teleoperation. To analyze the effect, a tele-manipulation experiment is specially designed, which operator moves square objects from one place to another place by using master/slave telerobotic system. Task completion time and total number of falling of the object are used for evaluating the performance. Subjective study was conducted with 10 subjects in 16 different combinations of video and haptic feedback while participants didn't have any prior information about the amount of each delay. Initially we assume that synchronized haptic and video feedback would give best performance. However as a result, we found that the accuracy was increased when haptic and video feedback was synchronized, and the completion time was decreased when one of the feedback (either haptic or video) was decreased. Another interesting fact that we found in this experiment is that it showed even better accuracy when haptic information arrives little bit earlier than video information, than the case when those are synchronized.

Characteristics of A Tunable OADM Using A Fiber-Optic Delay-Line Transversal Filter (광섬유 지연서로 트랜스버설 필터를 이용한 파장 가변 OADM의 특성)

  • 윤찬호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.10B
    • /
    • pp.1707-1713
    • /
    • 2000
  • We have proposed a tunable optical ADM using a fiber-optic transversal filter which is composed of fiber couplers and metal-film coated fiber-optic tapped delay-lines with a flat spectral response in abroad range of wavelength. Simulation results show that the optical loss at the DROP and PASS wavelengths of the OADM is negligible and the wavelength tunability is 0.78${\mu}{\textrm}{m}$/ps for the unit time delay of 2 ps. In order to investigate the effects of wavelength drift of the imput optical signal on the OADM the loss at the DROP port and the crosstalks to the other ports have been calculated. The maximum bit rates have been calculated at 46.26 Gb/s for the input Gaussian pulse width of 10 ps.

  • PDF

A New RFID Multi-Tag recognition Algorithm using Collision-Bit (RFID 충돌 비트를 이용한 다중 태그 인식 알고리즘)

  • Ji, Yoo-Kang;Cho, Mi-Nam;Hong, Sung-Soo;Park, Soo-Bong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.55-58
    • /
    • 2008
  • RFID(Radio frequency IDentification) leader is collision of data, when recognizing the multiple tag the inside area. This collision became the cause which delays the tag recognition time of the leader. The protocol which prevents the delay of tag recognition time of the leader the place where representative it uses QT(Query Tree) algorithms, it uses a collision bit position from this paper and are improved QT-MTC(Query Tree with Multi-Tag Cognition) algorithms which it proposes. This algorithm stored the bit position which bit possibility and the collision where the collision happens occurs in the stack and goes round a tree the number of time which, it reduced could be identified two tags simultaneously in order, it was planned. A result of performance analysis, It compared in QT protocols and the this algorithm against the tag bit which is continued a tush efficiency improvement effect was visible.

  • PDF

A New RFID Multi-Tag recognition Algorithm using Collision-Bit (RFID 충돌 비트를 이용한 다중 태그 인식 알고리즘)

  • Ji, Yoo-Kang;Cho, Mi-Nam;Hong, Sung-Soo;Park, Soo-Bong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.6
    • /
    • pp.999-1005
    • /
    • 2008
  • RFID(Radio Frequency IDintification) leader is collision of data, when recognizing the multiple tag the inside area. This collision became the cause which delays the tag recognition time of the leader. The protocol which prevents the delay of tag recognition time of the leader the place where representative it uses QT(Query Tree) algorithms, it uses a collision bit position from this paper and are improved QT-MTC(Query Tree with Multi-Tag Cognition) algorithms which it proposes. This algorithm stored the bit position which bit possibility and the collision where the collision happens occurs in the stack and goes round a tree the number of time which, it reduced could be identified two tags simultaneously in order, it was planned. A result of performance analysis, It compared in QT protocols and the this algorithm against the tag bit which is continued a high efficiency improvement effect was visible.