• Title/Summary/Keyword: block schemes

Search Result 302, Processing Time 0.029 seconds

Essential Computational Tools for High-Fidelity Aerodynamic Simulation and Design (고 정밀 항공우주 유동해석 및 설계를 위한 공력계산 툴)

  • Kim, Chong-Am
    • 유체기계공업학회:학술대회논문집
    • /
    • 2006.08a
    • /
    • pp.33-36
    • /
    • 2006
  • As the computing environment is rapidly improved, the interests of CFD are gradually focused on large-scale computation over complex geometry. Keeping pace with the trend, essential computational tools to obtain solutions of complex aerospace flow analysis and design problems are examined. An accurate and efficient flow analysis and design codes for large-scale aerospace problem are presented in this work. With regard to original numerical schemes for flow analysis, high-fidelity flux schemes such as RoeM, AUSMPW+ and higher order interpolation schemes such as MLP (Multi-dimensional Limiting Process) are presented. Concerning the grid representation method, a general-purpose basis code which can handle multi-block system and overset grid system simultaneously is constructed. In respect to design optimization, the importance of turbulent sensitivity is investigated. And design tools to predict highly turbulent flows and its sensitivity accurately by fully differentiating turbulent transport equations are presented. Especially, a new sensitivity analysis treatment and geometric representation method to resolve the basic flow characteristics are presented. Exploiting these tools, the capability of the proposed approach to handle complex aerospace simulation and design problems is tested by computing several flow analysis and design problems.

  • PDF

Call Admission Schemes for Multimedia Services in CDMA Cellular Systems (셀룰라 시스템에서 멀티미디어 서비스를 위한 호 수락제어 기법 연구)

  • Choi Sung-Gu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3B
    • /
    • pp.232-238
    • /
    • 2006
  • We propose a novel call admission control scheme which improves the handoff drop and the new call block probabilities of high priority services, minimizing the negative impact on low priority services, in multimedia service cellular networks. This paper proposes three schemes to solve this problem; the packing scheme in which available channels of a cell distributed to each frequency channel are concentrated on one frequency channel and a high transmission rate service is assigned to the frequency channel; the queuing scheme in which the queue is used for high transmission rate calls; and the power reallocation scheme in which the power assigned to calls under service is temporarily reduced and a high transmission rate service is allowed. The simulation results revealed that our scheme improved the drop and the block probabilities of the high priority services compared with the conventional scheme.

Privacy-Preserving H.264 Video Encryption Scheme

  • Choi, Su-Gil;Han, Jong-Wook;Cho, Hyun-Sook
    • ETRI Journal
    • /
    • v.33 no.6
    • /
    • pp.935-944
    • /
    • 2011
  • As a growing number of individuals are exposed to surveillance cameras, the need to prevent captured videos from being used inappropriately has increased. Privacy-related information can be protected through video encryption during transmission or storage, and several algorithms have been proposed for such purposes. However, the simple way of evaluating the security by counting the number of brute-force trials is not proper for measuring the security of video encryption algorithms, considering that attackers can devise specially crafted attacks for specific purposes by exploiting the characteristics of the target video codec. In this paper, we introduce a new attack for recovering contour information from encrypted H.264 video. The attack can thus be used to extract face outlines for the purpose of personal identification. We analyze the security of previous video encryption schemes against the proposed attack and show that the security of these schemes is lower than expected in terms of privacy protection. To enhance security, an advanced block shuffling method is proposed, an analysis of which shows that it is more secure than the previous method and can be an improvement against the proposed attack.

Efficient Tracking of a Moving Object Using Optimal Representative Blocks

  • Kim, Wan-Cheol;Hwang, Cheol-Ho;Park, Su-Hyeon;Lee, Jang-Myung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.41.3-41
    • /
    • 2002
  • Motion estimation using Full-Search(FS) and Block-Matching Algorithm(BMA) is often used in the case of moving object tracking by vision sensors. However these methods often miss the real-time vision data because these schemes suffer the heavy computational load. When the image size of moving object is changed in an image frame according to the distance between the camera of mobile robot and the moving object, the tracking performance of a moving object may decline with these methods because of the shortage of active handling. In this paper, the variable-representative block that can reduce a lot of data computations, is defined and optimized by changing the size of representative block accor...

  • PDF

A Data Hiding Scheme Based on Turtle-shell for AMBTC Compressed Images

  • Lee, Chin-Feng;Chang, Chin-Chen;Li, Guan-Long
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.6
    • /
    • pp.2554-2575
    • /
    • 2020
  • Data hiding technology hides secret information into the carrier, so that when the carrier is transmitted over network, it will not attract any malicious attention. Using data compression, it is possible to reduce the data size into a small compressed code, which can effectively reduce the time when transmitting compressed code on the network. In this paper, the main objective is to effectively combine these two technologies. We designed a data hiding scheme based on two techniques which are turtle-shell information hiding scheme and absolute moment block truncation coding. The experimental results showed that the proposed scheme provided higher embedding capacity and better image quality than other hiding schemes which were based on absolute moment block truncation coding.

Packet Size Optimization for Improving the Energy Efficiency in Body Sensor Networks

  • Domingo, Mari Carmen
    • ETRI Journal
    • /
    • v.33 no.3
    • /
    • pp.299-309
    • /
    • 2011
  • Energy consumption is a key issue in body sensor networks (BSNs) since energy-constrained sensors monitor the vital signs of human beings in healthcare applications. In this paper, packet size optimization for BSNs has been analyzed to improve the efficiency of energy consumption. Existing studies on packet size optimization in wireless sensor networks cannot be applied to BSNs because the different operational characteristics of nodes and the channel effects of in-body and on-body propagation cannot be captured. In this paper, automatic repeat request (ARQ), forward error correction (FEC) block codes, and FEC convolutional codes have been analyzed regarding their energy efficiency. The hop-length extension technique has been applied to improve this metric with FEC block codes. The theoretical analysis and the numerical evaluations reveal that exploiting FEC schemes improves the energy efficiency, increases the optimal payload packet size, and extends the hop length for all scenarios for in-body and on-body propagation.

Performance Analysis of Space-Time Block Coded Cooperative Wireless Transmission in Rayleigh Fading Channels

  • Kong Hyung-Yun;Khuong Ho-Van
    • Journal of Communications and Networks
    • /
    • v.8 no.3
    • /
    • pp.306-312
    • /
    • 2006
  • This paper studies theoretically the bit error rate (BER) performance of cooperative transmission using space-time block code (STBC) in a fully distributed manner. Specifically, we first propose a STBC-based cooperative signaling structure to make the cooperation of three single-antenna terminals possible. Then, we derive the closed-form BER expressions for both cooperation and noncooperation schemes under flat Rayleigh fading channel plus additive white Gaussian noise (AWGN). The validity of these expressions is verified by Monte-Carlo simulations. A variety of numerical and simulation results reveal that the cooperative transmission achieves higher diversity gain and better performance than the direct transmission for the same total transmit power.

Video coding based on wavelet transform for very low bitrate channel (웨이브릿 변환을 사용한 초저속 전송 매체용 비디오 코딩)

  • 오황석;이흥규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.4
    • /
    • pp.822-833
    • /
    • 1996
  • The video coding for very low bit rate has recently received considerable attention, but conventional block based transform coding schemes suffer from the blocking effect for the constraints of bit rates. In this paper, we present a video coding sysem suing multi-resolution motion estimation/compensation with variable size block(VMRME/C) and multi-resolution vector quantization(MRVQ) in wavelet transform domain for very low bit rate coding. It is shown that the presented scheme has better performance in the peak signal-to-nose ratio(RSNR) by 0.2-0.6 dB as well as subjective quality than that of conventional block based transform video coding techniques(especially, H. 263 which is DCT based video coding).

  • PDF

An error concealment method using projections onto the overcomplete basis (오버컴플릿 기저에 대한 사영을 이용한 오류 은닉 기법)

  • 장준호;김정권;이충웅
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.5
    • /
    • pp.1107-1115
    • /
    • 1997
  • In this paper, we propose an error concealment method to recovre damaged block-based image coding schemes. Channel errors during transmission of image data such as bit errors or cell loss result in damaged image blocks in the reconstructed images. To recover damaged blocks is to estimate them using the correctly received or undamaged neighborhood information. In the proposed method, an overcomplete basis for a large block containing a damaged block at its center is introduced and damaged blocks are recovered by sequentially projecting the known neighborhood information onto the overcomplete basis function. Computer simulations show that the proposed algorithm outperforms the conventional method in subjectie recovery qualities as well as objective ones.

  • PDF

Low Power Scheme Using Bypassing Technique for Hybrid Cache Architecture

  • Choi, Juhee
    • Journal of the Semiconductor & Display Technology
    • /
    • v.20 no.4
    • /
    • pp.10-15
    • /
    • 2021
  • Cache bypassing schemes have been studied to remove unnecessary updating the data in cache blocks. Among them, a statistics-based cache bypassing method for asymmetric-access caches is one of the most efficient approach for non-voliatile memories and shows the lowest cache access latency. However, it is proposed under the condition of the normal cache system, so further study is required for the hybrid cache architecture. This paper proposes a novel cache bypassing scheme, called hybrid bypassing block selector. In the proposal, the new model is established considering the SRAM region and the non-volatile memory region separately. Based on the model, hybrid bypassing decision block is implemented. Experiments show that the hybrid bypassing decision block saves overall energy consumption by 21.5%.