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

검색결과 3,777건 처리시간 0.028초

Relay Performance Analysis of TTR and STR Relay Modes in IEEE 802.16j MMR System

  • Seo, Si-O;Kim, Se-Jin;Kim, Seung-Yeon;Kim, Young-Il;Lee, Hyong-Woo;Ryu, Seung-Wan;Cho, Choong-Ho
    • ETRI Journal
    • /
    • 제32권2호
    • /
    • pp.230-240
    • /
    • 2010
  • The IEEE802.16j standard uses non-transparent relay stations to extend coverage. There are two types of non-transparent relay modes, that is, the time-division transmit and receive (TTR) relay mode which can operate with one of two types of frame structures, a single-frame and multiframe structure, and the simultaneous transmit and receive (STR) relay mode. In this paper, we analyze the relay performance of TTR and STR relay modes in IEEE 802.16j MMR system. We also propose a fair resource allocation scheme for the downlink relay frame. Numerical results show that relay performance of the TTR with a single-frame or a multiframe structure and that of the STR relay modes are almost the same in a two-hop system. However, in a three-hop system, the TTR mode with a single-frame structure outperforms other relay modes.

Performance Anomaly of the IEEE 802.11 DCF in Different Frame Error Rate Conditions

  • Kang, Koohong
    • Journal of Information Processing Systems
    • /
    • 제8권4호
    • /
    • pp.739-748
    • /
    • 2012
  • We propose an analytic model to compute the station's saturated throughput and packet delay performance of the IEEE 802.11 DCF (Distributed Coordination Function) in which frame transmission error rates in the channel are different from each other. Our analytic model shows that a station experiencing worse frame error rates than the others suffers severe performance degradation below its deserved throughput and delay performance. 802.11 DCF adopts an exponential back-off scheme. When some stations suffer from high frame error rates, their back-off stages should be increased so that others get the benefit from the smaller collision probabilities. This impact is then recursively applied to degrade the performance of the victim stations. In particular, we show that the performance is considerably degraded even if the frame error rate of the victim station satisfies the receiver input level sensitivity that has been specified in the IEEE 802.11 standard. We also verify the analytic results by the OPNET simulations.

FR/ATM 연동에서의 UPC 방식 (UPC Schemes on the Frame Relay/ATM Interworking in ATM Networks)

  • 남윤석;박원식
    • 한국정보처리학회논문지
    • /
    • 제6권11호
    • /
    • pp.3108-3115
    • /
    • 1999
  • Frame relay needs UPC function for the multiplexed logical connections to prevent malicious user traffic from incoming to network, to guarantee the QoS of conformed user traffic, and to protect the normal operation of network system. On the FR/ATM interworking in ATM networks, the UPC may be conducted either by cell-based ATM UPC or frame-based FR UPC. Frames come into and traverse ATm networks by segmentation to ATM cells. Of course, FR QoS should be guaranteed in spite of segmentation and reassembly in ATM networks. In this paper, we compared the QoS of cell-based ATM UPC and frame-based FR UPC in terms of analysis and simulation in case of ingress of excess traffic over negotiated traffic parameters at user-to-network interface. Also we studied frame-based UPC schemes including window-based FR UPC and frame-based VSA which is an ATM UPC algorithm recommended by ITU-T. We described introductions to frame relay including frame structure and FR/ATM interworking, FR traffic parameters and their relationship, comparison of FR QoS between frame-based FR UPC and cell-based ATM UPC, comparison of FR UPC schemes, necessities of egress traffic control, and conclusions.

  • PDF

프레임릴레이를 통한 LAN/ISDN 인터페이스 연구 (Study on the LAN/ISDN Interface Through Frame Relay)

  • 양충렬;김진태
    • 정보와 통신
    • /
    • 제11권4호
    • /
    • pp.62-70
    • /
    • 1994
  • 본고는 교환기의 기본구조를 변경하지 않고 프레임릴레이를 통하여 ISDN(Intergrated services digital network) 교환기에 물리적으로 적용 가능한 LAN(Local area network) 인터페이스 기술에 대하여 서술하였다. 프레임릴레이의 구현을 위해 기존 X.25 서비스와의 상호접속 방안이 매우 중요한데 이를 위해서는 X.75 및 I.122를 배경으로 하는 상호적인 방안이 고려되어야 한다. 프레임릴레이 서비스에 필요한 특징 및 트로토콜, 브릿지 상호접속 및 ISDN 노드에 사용되어 프레임 수행을 위한 프레임핸들러의 설계방법에 이어, 프레임릴레이를 통한 LAN과 ISDN간 상호접속 메카니즘에 대해 각각 서술하였다. 그리고 프레임릴레이를 통하여 LAN을 위한 고속 프레임릴레이 서비스를 구현한 주요국의 사례를 살펴보았다.

  • PDF

Frame Memory 축소를 위한 DWT와 Color Conversion 기반의 Overdrive 구조 (Overdrive Architecture using DWT and Color Conversion for Frame Memory Reduction)

  • 변진수;김현섭;김도석;김보관
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2008년도 하계종합학술대회
    • /
    • pp.997-998
    • /
    • 2008
  • In this paper, we proposed a reduced memory overdrive architecture. Proposed overdrive architecture consists of 2D-DWT filter, BLI and Color Conversion block. For Frame Memory reduction we eliminated HH data in DWT-IDWT process and converted color space RGB into YCbCr. Consequently, we reduced Frame Memory about 50%.

  • PDF

홈 네트워크에서 고효율 전송을 위한 Zigbee Beacon Frame 설계 (Design of Zigbee Beacon Frame for High Efficiency Transmit in Home Network)

  • 한경헌;한승조;최현용
    • 한국통신학회논문지
    • /
    • 제36권11B호
    • /
    • pp.1373-1382
    • /
    • 2011
  • 무선 홈 네트워크 환경에서 넓은 확장성과 저전력이 통신이 기능한 Zigbee는 홈 네트워크에서 가장 이상적인 통신기술이다. 하지만 Zigbee는 숨겨진 단말 문제와 전송 지연 문제를 항상 가지고 있어 무선 홈 네트워크에서 많이 사용되고 있지 못하고 있다. 이런 Zigbee가 가지고 있는 두 문제를 해결하기 위해 본 논문에서는 새로운 프레임을 제안한다. 제안하는 프레임은 슈퍼프레임 구간을 줄여서 생기는 공간에 제어 프레임 구간을 추가하는 구조를 이루어져 있다. 새롭게 구성된 제어프레임 구간에서는 제어프레임을 이용하여 단말의 상태 정보를 교환하여 숨겨진 단말 문제를 해결할 것으로 예상한다. 또한 제어 프레임 구간과 슈퍼 프레임 구간사이에 동기화에 사용되는 비콘을 넣어 하위 계층에서 발생하는 전송 지연 문제를 해결할 수 있다고 예상한다. 제안하는 프레임이 숨겨진 단말 문제와 전송 지연 문제를 해결하였는지 확인하기 위해 OPNET을 통해 Zigbee Qos Parameter 환경에서 시뮬레이션을 하였다. 전송 지연 문제를 해결여부를 확인하기 위해 전송지연시간을 측정하였으며, 숨겨진 단말 문제를 해결여부를 확인하기 위해 전송률과 처리율을 측정하였다.

Whole Frame Error Concealment with an Adaptive PU-based Motion Vector Extrapolation for HEVC

  • Kim, Seounghwi;Lee, Dongkyu;Oh, Seoung-Jun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제4권1호
    • /
    • pp.16-21
    • /
    • 2015
  • Most video services are transmitted in wireless networks. In a network environment, a packet of video is likely to be lost during transmission. For this reason, numerous error concealment (EC) algorithms have been proposed to combat channel errors. On the other hand, most existing algorithms cannot conceal the whole missing frame effectively. To resolve this problem, this paper proposes a new Adaptive Prediction Unit-based Motion Vector Extrapolation (APMVE) algorithm to restore the entire missing frame encoded by High Efficiency Video Coding (HEVC). In each missing HEVC frame, it uses the prediction unit (PU) information of the previous frame to adaptively decide the size of a basic unit for error concealment and to provide a more accurate estimation for the motion vector in that basic unit than can be achieved by any other conventional method. The simulation results showed that it is highly effective and significantly outperforms other existing frame recovery methods in terms of both objective and subjective quality.

An Improved Method of Guaranteeing Frame Rates of Avionics Simulator based on HMD Motion

  • Lee, Jeong-Hoon;Jo, Yong-Il;Kim, Kyong Hoon
    • 한국컴퓨터정보학회논문지
    • /
    • 제23권7호
    • /
    • pp.57-62
    • /
    • 2018
  • In this paper, we propose an improved algorithm for rendering method to guarantee frame rates based on HMD (Head Mounted Display) motion in an avionics simulator. One of important issues in HMD simulators is to guarantee frame rates despite fast motion of HMD which is more rapid than the aircraft's moving speed to maintain a quality of images. Therefore, we propose an algorithm considering the moving speed of a pilot's head: Improved Speed-Based LOD (Level-Of-Detail) Control (ISBLC). In the proposed algorithm, frame rates are improved by changing dynamic LOD which determines details of objects for rendering images. Throughout the experiments, we show the average frame rates are achieved up to 60 and minimum frame rates are guaranteed up to 40. The proposed algorithms will be used HMD simulation in avionics simulators.

A Novel Selective Frame Discard Method for 3D Video over IP Networks

  • Chung, Young-Uk
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권6호
    • /
    • pp.1209-1221
    • /
    • 2010
  • Three dimensional (3D) video is expected to be an important application for broadcast and IP streaming services. One of the main limitations for the transmission of 3D video over IP networks is network bandwidth mismatch due to the large size of 3D data, which causes fatal decoding errors and mosaic-like damage. This paper presents a novel selective frame discard method to address the problem. The main idea of the proposed method is the symmetrical discard of the two dimensional (2D) video frame and the depth map frame. Also, the frames to be discarded are selected after additional consideration of the playback deadline, the network bandwidth, and the inter-frame dependency relationship within a group of pictures (GOP). It enables the efficient utilization of the network bandwidth and high quality 3D IPTV service. The simulation results demonstrate that the proposed method enhances the media quality of 3D video streaming even in the case of bad network conditions.

Accelerating RFID Tag Identification Processes with Frame Size Constraint Relaxation

  • Park, Young-Jae;Kim, Young-Beom
    • Journal of information and communication convergence engineering
    • /
    • 제10권3호
    • /
    • pp.242-247
    • /
    • 2012
  • In the determination of suitable frame sizes associated with dynamic framed slotted Aloha used in radio frequency identification tag identification processes, the widely imposed constraint $L=2^Q$ often yields inappropriate values deviating far from the optimal values, while a straightforward use of the estimated optimal frame sizes causes frequent restarts of read procedures, both resulting in long identification delays. Taking a trade-off, in this paper, we propose a new method for determining effective frame sizes where the effective frame size changes in a multiple of a predetermined step size, namely ${\Delta}$. Through computer simulations, we show that the proposed scheme works fairly well in terms of identification delay.