• Title/Summary/Keyword: 전송프레임

Search Result 1,134, Processing Time 0.025 seconds

A Hierarchical Block Matching Algorithm Based on Camera Panning Compensation (카메라 패닝 보상에 기반한 계층적 블록 정합 알고리즘)

  • Gwak, No-Yun;Hwang, Byeong-Won
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.8
    • /
    • pp.2271-2280
    • /
    • 1999
  • In this paper, a variable motion estimation scheme based on HBMA(Hierarchical Block Matching Algorithm) to improve the performance and to reduce heavy computational and transmission load, is presented. The proposed algorithm is composed of four steps. First, block activity for each block is defined using the edge information of differential image between two sequential images, and then average block activity of the present image is found by taking the mean of block activity. Secondly, camera pan compensation is carried out, according to the average activity of the image, in the hierarchical pyramid structure constructed by wavelet transform. Next, the LUT classifying each block into one among Moving, No Moving, Semi-Moving Block according to the block activity compensated camera pan is obtained. Finally, as varying the block size and adaptively selecting the initial search layer and the search range referring to LUT, the proposed variable HBMA can effectively carries out fast motion estimation in the hierarchical pyramid structure. The cost function needed above-mentioned each step is only the block activity defined by the edge information of the differential image in the sequential images.

  • PDF

Fast Cell Search Algorithm using Polarization Code Modulation(PCM) in WCDMA Systems (WCDMA 시스템에서 극성 변조를 이용한 빠른 셀 탐색 알고리즘)

  • Bae Sung-Oh;Lim Jae-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.8B
    • /
    • pp.809-818
    • /
    • 2002
  • In this paper, we propose a fast cell search algorithm keeping compatible with the standard cell search algorithm of the WCDMA system. The proposed algorithm can acquire the synchronization of slot and frame times, and the code group identification using only one synchronization channel while the standard algorithm employs two synchronization channels called P-SCH and S-SCH. The proposed synchronization channel structure is the same as the P-SCH structure of the WCDMA system. However, the P-SCH is modulated with a specific polarization code, which is one element of new code group codes. The proposed algorithm can reduce both the BS' transmission power and the complexity of receiver as compared with the conventional one since only on synchronization channel is used. It is shown through the computer simulation that the proposed algorithm yields a significant improvement in terms of cell search time compared with the standard especially in low SNR environments.

Efficient Distributed Video Coding System and Performance Analysis Using Lapped Transform (Lapped Transform을 이용한 효율적인 분산 동영상 부호화 시스템 및 성능해석)

  • Kang, Soo-Kyung;Lee, Chang-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9C
    • /
    • pp.564-572
    • /
    • 2011
  • Distributed video coding (DVC) system has been proposed to reduce encoder complexity by using the correlation of frames in decoders. Since the block based motion estimation operation is not performed in the encoder of DVC system, lapped transforms, in which adjacent two blocks are transformed into one block, can be efficiently used in the DVC system. In this paper, an efficient DVC system using lapped transforms is proposed. The overlapped block motion compensated interpolation is used to produce side information, and the corresponding correlation noise between original Wyner-Ziv frame and side information is modeled. Extensive computer simulations show that the proposed DVC system outperforms conventional DVC systems.

Search of Beacon in Low Power Wireless Interface (저전력 무선접속에서 비콘 탐색)

  • Song, Myong-Lyol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.4A
    • /
    • pp.365-372
    • /
    • 2007
  • In IEEE 802.11b wireless network, stations synchronize themselves to the beacons periodically sent by the access point(AP) when they are running in low power mode. In case of missing beacon due to noise or traffic from neighboring wireless network stations must be awake until they get the next beacon, which causes energy consumption in stations. In this paper, we propose a scheme searching next beacon consuming little energy. The problems of missing beacon in low power mode of IEEE 802.11b wireless interface are described and a new method to reduce energy consumption is proposed. The proposed method is simulated with the network simulator, ns2, and compared with the low power mode of the IEEE 802.11b. The result measured in terms of station's wakeup time shows some enhancement in energy consumption when some errors occur in receiving frames.

Improvement to High-Availability Seamless Redundancy (HSR) Unicast Traffic Performance Using a Hybrid Approach, QRPL (High-Availability Seamless Redundancy (HSR)의 Unicast 트래픽 성능 향상을 위한 QRPL 알고리즘)

  • Altaha, Ibraheem Raed;Rhee, Jong Myung
    • Journal of Satellite, Information and Communications
    • /
    • v.11 no.2
    • /
    • pp.29-35
    • /
    • 2016
  • High-availability seamless redundancy (HSR) is a fault-tolerant protocol for Ethernet networks that provides two frame copies for each frame sent. Each copy is forwarded on a separate physical path. HSR is a potential candidate for several fault-tolerant Ethernet applications, including smart-grid communications. However, the major drawback of the HSR protocol is that it generates and circulates unnecessary frames within connected rings regardless of the presence of a destination node in the ring. This downside degrades network performance and can deplete network resources. Two simple but efficient approaches have previously been proposed to solve the above problem: quick removing (QR) and port locking (PL). In this paper, we will present a hybrid approach, QRPL, by combining QR with PL, resulting in further traffic reductions. Our analysis showed that network traffic is significantly reduced for a large-sized HSR connected ring network compared to the standard HSR protocol, QR, and PL.

CLO (Cross Layer Optimization) Technique for Multi-view Video Streaming Service over WiBro Network (WiBro망에서의 다시점 비디오 스트리밍 서비스를 위한 계층 간 최적화 방식)

  • Son, Jung-Hyun;Cho, Ye-Jin;Suh, Doug-Young;Park, Gwang-Hoon;Kim, Kyu-Heon
    • Journal of Broadcast Engineering
    • /
    • v.13 no.5
    • /
    • pp.719-731
    • /
    • 2008
  • This paper defines QoE (Quality of Experience) for multi-view video streaming service over WiBro and proposes the CLO (Cross-Layer Optimization) algorithm can maximize this. Proposal CLO algorithm contains from physical layer to video layer. Under the time-varying wireless channel condition, the CLO technique takes view-wise and the temporal priority of the multi-view video into consideration in order to decide the transmission of frames and its FEC level. At the handover situation, it is shown through computer simulation that the optimal quality of the multi-view video can be achieved using the minimum amount of resources if the proposed CLO technique is applied.

A Study to Guarantee Minimum Bandwidth to TCP Traffic over ATM-GFR Service (ATM-GFR 서비스에서 TCP 트래픽의 최소 대역폭 보장에 관한 연구)

  • 박인용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4C
    • /
    • pp.308-315
    • /
    • 2002
  • Guaranteed frame rate (GFR) service has been defied to provide minimum cell rate (MCR) guarantees for virtual connections (VCs) carrying Internet traffic in ATM networks and allow them to fairly share residual bandwidth. The simplest switch implementation mechanism to support the GFR service in ATM networks consists of the frame-based generic cell rate algorithm (F-GCRA) frame classifier and the early packet discard (EPD)-like buffer acceptance algorithm in a single FIFO buffer. This mechanism is simple, but has foiled to guarantee the same bandwidth as an MCR to a VC that has reserved a relatively large MCR. This paper applies the packet spacing scheme to TCP traffic to alleviate its burstness, so as to guarantee a larger MCR to a VC. In addition, the random early detection (RED) scheme is added to the buffer acceptance algorithm in order to improve fairness in use of residual bandwidth. Simulation results show that the applied two schemes improve a quality of service (QoS) in the GFR service for the TCP traffic.

Adaptive Data Hiding Techniques for Secure Communication of Images (자기유사성 네트워크에서 트래픽 제어에 의한 성능 개선)

  • 석경휴;나상동
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.6B
    • /
    • pp.575-583
    • /
    • 2004
  • In this paper, we extend the multiple time scale control framework to the window-based congestion control, in particular, such as the TCP. This is performed by interfacing the TCP with a large time scale control module which adjusts the aggressiveness of the bandwidth consumption behavior exhibited by the TCP as a function of large time scale Self-Similar network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by the RTT. How to effectively utilize such an information-due to its probabilistic nature, dispersion over the multiple time scales, and affection on the top of the existing window-based congestion controls-is a non-trivial problem. The evaluation performance of the multiple time scale TCP is facilitated by a simulation of the bench-mark environment which is based on the physical modeling of a self-similar traffic. We explicate our methodology for discerning and evaluating the impact of changes in transport protocols in the protocol stack under the self-similar traffic conditions. We discuss issues arising in the comparative performance evaluation under heavy-tailed workloads.

Cellular-Automata Based Node Scheduling Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 셀룰러 오토마타 기반의 노드 스케줄링 제어)

  • Byun, Heejung;Shon, Sugook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.10
    • /
    • pp.708-714
    • /
    • 2014
  • Wireless sensor networks (WSNs) generally consist of densely deployed sensor nodes that depend on batteries for energy. Having a large number of densely deployed sensor nodes causes energy waste and high redundancy in sensor data transmissions. The problems of power limitation and high redundancy in sensing coverage can be solved by appropriate scheduling of node activity among sensor nodes. In this paper, we propose a cellular automata based node scheduling algorithm for prolonging network lifetime with a balance of energy savings among nodes while achieving high coverage quality. Based on a cellular automata framework, we propose a new mathematical model for the node scheduling algorithm. The proposed algorithm uses local interaction based on environmental state signaling for making scheduling decisions. We analyze the system behavior and derive steady states of the proposed system. Simulation results show that the proposed algorithm outperforms existing protocols by providing energy balance with significant energy savings while maintaining sensing coverage quality.

Selection of Scalable Video Coding Layer Considering the Required Peak Signal to Noise Ratio and Amount of Received Video Data in Wireless Networks (무선 네트워크에서 요구되는 평균 최대 신호 대 잡음비와 수신 비디오 데이터양을 고려하는 스케일러블 비디오 코딩 계층 선택)

  • Lee, Hyun-No;Kim, Dong-Hoi
    • Journal of Digital Contents Society
    • /
    • v.17 no.2
    • /
    • pp.89-96
    • /
    • 2016
  • SVC(Scalable Video Coding), which is one form among video encoding technologies, makes video streaming with the various frame rate, resolution, and video quality by combining three different scalability dimensions: temporal, spatial, and video quality scalability. As the above SVC-encoded video streaming consists of one base layer and several enhancement layers, and a wireless AP(Access Point) chooses and sends a suitable layer according to the received power from the receiving terminals in the changeable wireless network environment, the receiving terminals supporting SVC are able to receive video streaming with the appropriate resolution and quality according to their received powers. In this paper, after the performance analysis for the received power, packet loss rate, PSNR(Required Peak Signal to Noise Ratio), video quality level and amount of received video data based on the number of SVC layers was performed, an efficient method for selecting the number of SVC layer satisfying the RSNR and minimizing the amount of received video data is proposed.