• Title/Summary/Keyword: adaptive schemes

Search Result 510, Processing Time 0.03 seconds

Monitoring-based Coordination of Network-adaptive FEC for Wireless Multi-hop Video Streaming (무선 멀티 홉 비디오 스트리밍을 위한 모니터링 기반의 네트워크 적응적 FEC 코디네이션)

  • Choi, Koh;Yoo, Jae-Yong;Kim, Jong-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.2A
    • /
    • pp.114-126
    • /
    • 2011
  • Video streaming over wireless multi-hop networks(WMNs) contains the following challenges from channel fading and variable bandwidth of wireless channel, and it cause degradation of video streaming performance. To overcome the challenges, currently, WMNs can use Forward Error Correction (FEC) mechanism. In WMNs, traditional FEC schemes, E2E-FEC and HbH-FEC, for video streaming are applied, but it has long transmission delay, high computational complexity and inefficient usage of resource. Also, to distinguish network status in streaming path, it has limitation. In this paper, we propose monitoring-based coordination of network-adaptive hop-to-end(H2E) FEC scheme. To enable proposed scheme, we apply a centralized coordinator. The coordinator has observing overall monitoring information and coordinating H2E-FEC mechanism. Main points of H2E-FEC is distinguishing operation range as well as selecting FEC starting node and redundancy from monitored results in coordination. To verify the proposed scheme, we perform extensive experiment over the OMF(Orbit Measurement Framework) and IEEE 802.1la-based multi-hop WMN testbed, and we carry out performance improvement, 17%, from performance comparison by existing FEC scheme.

An Adaptive Joint Precoding for Multi-user MIMO Systems (다중 사용자 MIMO 시스템을 위한 적응적 결합 프리코딩)

  • Park, Ju Yong;Hanif, Mohammad Abu;Song, Sang Seob;Lee, Moon Ho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.12
    • /
    • pp.3-11
    • /
    • 2014
  • Multiple antennas can provide huge capacity gains when the transmitter knows the channel state information (CSI). Precoding is a technique that exploits CSI at the transmitter side. In this paper, an adaptive precoding scheme is proposed, called a hybrid multiple-input multiple-output (MIMO) precoding (HMP). HMP is a combination of linear and nonlinear precoding. The number of transmit antennas less than or equal to four is as same as the conventional antenna selection scheme. Therefore, the HMP scheme uses more than four transmit antennas. The good channel means that the channels must be selected to maximize the channel capacity among the given channels, and the rest channels are called bad channel. In HMP scheme, we use the nonlinear precoding in the good channels and the linear precoding in the bad channels. The well-known Tomlinson-Harashima precoding (THP) is considered as nonlinear precoding. The system throughput and MSE (minimum square error) are shown for the performance of HMP scheme compared to the conventional schemes which are BD (block diagonalization), antenna selection and THP.

Design and Performance Analysis of Dynamic QoS Control for RTP-based Multimedia Data Transmission (RTP 기반 멀티미디어 데이터 전송을 위한 동적 QoS 제공방안의 설계 및 성능 분석)

  • Moon, Young-Jun;Ryoo, In-Tae;Park, Gwang-Hoon
    • The KIPS Transactions:PartC
    • /
    • v.10C no.7
    • /
    • pp.891-898
    • /
    • 2003
  • This paper analyzes and proposes a scheme that improves the performance of the RTP that is developed to support the end-to-end transmission function and QoS monitor function for real-time multimedia data transmission. Although the existing RTP module supports real-time transmission, it has some problems in guaranteeing QoS parameters. To solve this problem, we propose a new Selective Repeat Adaptive Rate Control (SRARC). The SRARC can support QoS by referring to the data transmission status from the client and then classifying the network status into three levels. It selectively transmits multimedia data and dynamically controls transmission rates based on such information as bandwidth, packet loss rate, and latency that can be calculated in data transfer phase. To verify the SRARC, we implement it in real local area networks and compare the QoS parameters of the SRARC with those of the SR and RTP By the experimental results, the SRARC shows better performance in the aspects of bandwidth usage rate, packet loss rates, and transmission delays than the existing RTP schemes.

An Efficient Load-Balancing Algorithm based on Bandwidth Reservation Scheme in Wireless Multimedia Networks (무선 멀티미디어 망에서 대역폭 예약을 이용한 효율적인 부하 균형 알고리즘)

  • 정영석;우매리;김종근
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.4
    • /
    • pp.441-449
    • /
    • 2002
  • For multimedia traffics to be supported successfully in wireless network environment, it is necessary to provide Qualify-of-Service(QoS) guarantees among mobile hosts(clients). In order to guarantee the QoS, we have to keep the call blocking probability below a target value during hand-off session. However, the QoS negotiated between the client and the network may not be guaranteed due to lack of available channels for traffic of a new cell, since on service mobile clients should be able to continue their sessions. In this paper, we propose an efficient load-balancing algorithm based on the adaptive bandwidth reservation scheme for enlarging available channels in a cell. Proposed algorithm predicts the direction of clients in a cell and adjusts the amount of the channel to be reserved according to the load status of the cell. This method is used to reserve a part of bandwidths of a cell for hand-off calls to its adjacent cells and this reserved bandwidth can be used for hand-off call prior to new connection requests. If the number of free channels is also under a low threshold value, our scheme use a load-balancing algorithm with an adaptive bandwidth reservation. In order to evaluate the performance of our algorithm, we measure metrics such as the blocking probability of new calls and dropping probability of hand-off calls, and compare with those of existing schemes.

  • PDF

ROUTE/DASH-SRD based Point Cloud Content Region Division Transfer and Density Scalability Supporting Method (포인트 클라우드 콘텐츠의 밀도 스케일러빌리티를 지원하는 ROUTE/DASH-SRD 기반 영역 분할 전송 방법)

  • Kim, Doohwan;Park, Seonghwan;Kim, Kyuheon
    • Journal of Broadcast Engineering
    • /
    • v.24 no.5
    • /
    • pp.849-858
    • /
    • 2019
  • Recent developments in computer graphics technology and image processing technology have increased interest in point cloud technology for inputting real space and object information as three-dimensional data. In particular, point cloud technology can accurately provide spatial information, and has attracted a great deal of interest in the field of autonomous vehicles and AR (Augmented Reality)/VR (Virtual Reality). However, in order to provide users with 3D point cloud contents that require more data than conventional 2D images, various technology developments are required. In order to solve these problems, an international standardization organization, MPEG(Moving Picture Experts Group), is in the process of discussing efficient compression and transmission schemes. In this paper, we provide a region division transfer method of 3D point cloud content through extension of existing MPEG-DASH (Dynamic Adaptive Streaming over HTTP)-SRD (Spatial Relationship Description) technology, quality parameters are further defined in the signaling message so that the quality parameters can be selectively determined according to the user's request. We also design a verification platform for ROUTE (Real Time Object Delivery Over Unidirectional Transport)/DASH based heterogeneous network environment and use the results to validate the proposed technology.

Enhanced Index Assignment for Beamforming with Limited-rate Imperfect Feedback (피드백 에러가 있는 빔포밍 시스템에서 개선된 인덱스 배치기법)

  • Park, Noe-Yoon;Kim, Young-Ju
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.5
    • /
    • pp.7-14
    • /
    • 2012
  • The quantized beamforming systems always need the channel state information, which must be quantized into a finite set of vectors (named codebook), and feedback only sends the index representing the desired vector. Thereby it minimized the impact of feedback errors, caused by feedback overhead and delay. In this regard, index assignment (IA) methods, an exhaustive-search and group-based schemes, have been presented for minimizes the performance degradation without additional feedback bits. In this paper, we proposed enhanced group-based IA method, which used the optimal codebook design with chordal distance, having the adaptive properties in application of the existing IA methods. When the number of transmit antennas is 4 and LTE codebook is used, Monte-Carlo simulations verify that the proposed scheme has a power advantage of 0.5~1dB to obtain the same bit error rate than methods without IA, and it has 0.1~0.2 dB better performance compared with the existing IA methods over same environment.

Dynamic Full-Scalability-Conversion in SVC (스케일러블 비디오 코딩에서의 실시간 스케일러빌리티 변환)

  • Lee, Dong-Su;Bae, Tae-Meon;Ro, Yong-Man
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.6 s.312
    • /
    • pp.60-70
    • /
    • 2006
  • Currently, Scalable Video Coding (SVC) is being standardized. By using scalability of SVC, QoS managed video streaming service is enabled in heterogeneous networks even with only one original bitstream. But current SVC is insufficient to dynamic video conversion for the scalability, thereby the adaptation of bitrate to meet a fluctuating network condition is limited. In this paper, we propose dynamic full-scalability conversion method for QoS adaptive video streaming in H.264/AVC SVC. To accomplish full scalability dynamic conversion, we propose corresponding bitstream extraction, encoding and decoding schemes. On the encoder, we newly insert the IDR NAL to solve the problems of spatial scalability conversion. On the extractor, we analyze the SVC bitstream to get the information which enable dynamic extraction. By using this information, real time extraction is achieved. Finally, we develop the decoder so that it can manage changing bitrate to support real time full-scalability. The experimental results showed that dynamic full-scalability conversion was verified and it was necessary for time varying network condition.

Capacity of Spectrum Sharing Cognitive Radio with MRC Diversity under Delay Quality-of-Service Constraints in Nakagami Fading Environments

  • Zhang, Ping;Xu, Ding;Feng, Zhiyong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.632-650
    • /
    • 2013
  • The paper considers a spectrum sharing cognitive radio (CR) network coexisting with a primary network under the average interference power constraint. In particular, the secondary user (SU) is assumed to carry delay-sensitive services and thus shall satisfy a given delay quality-of-service (QoS) constraint. The secondary receiver is also assumed to be equipped with multiple antennas to perform maximal ratio combining (MRC) to enhance SU performance. We investigate the effective capacity of the SU with MRC diversity under aforementioned constraints in Nakagami fading environments. Particularly, we derive the optimal power allocation to achieve the maximum effective capacity of the SU, and further derive the effective capacity in closed-form. In addition, we further obtain the closed-form expressions for the effective capacities under three widely used power and rate adaptive transmission schemes, namely, optimal simultaneous power and rate adaptation (opra), truncated channel inversion with fixed rate (tifr) and channel inversion with fixed rate without truncation (cifr). Numerical results supported by simulations are presented to consolidate our studies. The impacts on the effective capacity of various system parameters such as the number of antennas, the average interference power constraint and the delay QoS constraint are investigated in detail. It is shown that MRC diversity can significantly improve the effective capacity of the SU especially for cifr transmission scheme.

Residual Vibration Control of High Speed Take-out Robot Used for Handling of Injection Mold Plastic Part (고속운동 플라스틱 금형사출 부품 취출 로봇의 잔류진동 제어)

  • Rhim, Sung-Soo;Park, Joo-Han
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.28 no.9
    • /
    • pp.1025-1031
    • /
    • 2011
  • Take-out robots used for handling of the plastic parts manufactured with the injection mold are usually the gantry type that consists of long and thin links, The performance of the take-out robot is determined by the speed of the motion and the positioning accuracy to grab the part out of the mold, As the speed of the robot increases the flexure in the links of the take-out robot becomes more significant and it results in more residual vibration, The residual vibration deteriorates the positioning accuracy and compels the operator to slow down the motion of the robot. The typical method to reduce the vibration in the robot requires stiffening the links and/or slowing down the robot, Vibration control could achieve the desired performance without increasing the manufacturing cost or the operation cost that would be incurred otherwise, Considering the point-to-point nature of the task to be performed by the take-out robot the time-delay command (or input) shaping filter approach would be the most effective control method to be adopted among a few available control schemes. In this paper a direct adaptive command shaping filter (ACSF) algorithm has been modified and applied to design the optimal command shaping filters for various configuration of the take-out robot. Optimal filters designed by ACSF algorithm have been implemented on a take-out robot and the effectiveness of the designed filters in terms of vibration suppression has been verified for multiple positions of the robot.

Performance Comparison of Fast Distributed Video Decoding Methods Using Correlation between LDPCA Frames (LDPCA 프레임간 상관성을 이용한 고속 분산 비디오 복호화 기법의 성능 비교)

  • Kim, Man-Jae;Kim, Jin-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.4
    • /
    • pp.31-39
    • /
    • 2012
  • DVC(Distributed Video Coding) techniques have been attracting a lot of research works since these enable us to implement the light-weight video encoder and to provide good coding efficiency by introducing the feedback channel. However, the feedback channel causes the decoder to increase the decoding complexity and requires very high decoding latency because of numerous iterative decoding processes. So, in order to reduce the decoding delay and then to implement in a real-time environment, this paper proposes several parity bit estimation methods which are based on the temporal correlation, spatial correlation and spatio-temporal correlations between LDPCA frames on each bit plane in the consecutive video frames in pixel-domain Wyner-Ziv video coding scheme and then the performances of these methods are compared in fast DVC scheme. Through computer simulations, it is shown that the adaptive spatio-temporal correlation-based estimation method and the temporal correlation-based estimation method outperform others for the video frames with the highly active contents and the low active contents, respectively. By using these results, the proposed estimation schemes will be able to be effectively used in a variety of different applications.