• Title/Summary/Keyword: information processing mode

Search Result 523, Processing Time 0.025 seconds

Alarm Processing for Efficient Fault Management on High Speed Information Networks (초고속정보통신망에서 효율적인 장애관리를 위한 알람처리)

  • 김동일;오창석
    • The Journal of the Korea Contents Association
    • /
    • v.2 no.1
    • /
    • pp.86-97
    • /
    • 2002
  • In this thesis, we propose a high-speed information network management mode based on layering and partitioning concepts of ITU-T G.805 We describe an information mood of the configuration of VP and VC networks and an information mode to manage faults in high-speed information networks. In order to efficient manage faults, us distinguish between an alarm with a fault that has negative effects on services and an alarm with an alert that barely affects services. Thus, we propose two types of computational models to treat all of these alarms, a fault alarm processing system and an alert alarm processing system. We also describe procedures of alarm processing and we describe the scope and processing course of NMS and SubNMS when rerouting a fault VP and VC fault connection. Lastly, we describe the implementation and analysis of the performance of the proposed fault alarm processing system. We compare the alarm processing tire of each priority according to the alarm occurrence ratio.

  • PDF

Operation-level Early Termination Algorithm for Inter-predictions in HEVC

  • Rhee, Chae Eun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.4
    • /
    • pp.235-242
    • /
    • 2016
  • The emerging High-Efficiency Video Coding (HEVC) standard attempts to improve coding efficiency by a factor of two over H.264/Advanced Video Coding (AVC) at the expense of an increase in computational complexity. Mode decision with motion estimation (ME) is still one of the most time-consuming computations in HEVC, as it is with H.264/AVC. Thus, fast mode decisions are not only an important issue to be researched, but also an urgent one. Several schemes for fast mode decisions have been presented in reference software and in other studies. However, the conventional hierarchical mode decision can be useless when block-level parallelism is exploited. This paper proposes operation-level exploration that offers more chances for early termination. An early termination condition is checked between integer and fractional MEs and between the parts of one partition type. The fast decision points of the proposed algorithm do not overlap those in previous works. Thus, the proposed algorithms are easily used with other fast algorithms, and consequently, independent speed-up is possible.

Design of High Performance Multi-mode 2D Transform Block for HEVC (HEVC를 위한 고성능 다중 모드 2D 변환 블록의 설계)

  • Kim, Ki-Hyun;Ryoo, Kwang-Ki
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.2
    • /
    • pp.329-334
    • /
    • 2014
  • This paper proposes the hardware architecture of high performance multi-mode 2D forward transform for HEVC which has same number of cycles for processing any type of four TUs and yield high throughput. In order to make the original image which has high pixel and high resolution into highly compressed image effectively, the transform technique of HEVC supports 4 kinds of pixel units, TUs and it finds the optimal mode after performs each transform computation. As the proposed transform engine uses the common computation operator which is produced by analyzing the relationship among transform matrix coefficients, it can process every 4 kinds of TU mode matrix operation with 35cycles equally. The proposed transform block was designed by Verilog HDL and synthesized by using TSMC 0.18um CMOS processing technology. From the results of logic synthesis, the maximum operating frequency was 400MHz and total gate count was 214k gates which has the throughput of 10-Gpels/cycle with the $4k(3840{\times}2160)@30fps$ image.

Multi-mode Radar Signal Sorting by Means of Spatial Data Mining

  • Wan, Jian;Nan, Pulong;Guo, Qiang;Wang, Qiangbo
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.725-734
    • /
    • 2016
  • For multi-mode radar signals in complex electromagnetic environment, different modes of one emitter tend to be deinterleaved into several emitters, called as "extension", when processing received signals by use of existing sorting methods. The "extension" problem inevitably deteriorates the sorting performance of multi-mode radar signals. In this paper, a novel method based on spatial data mining is presented to address above challenge. Based on theories of data field, we describe the distribution information of feature parameters using potential field, and makes partition clustering of parameter samples according to revealed distribution features. Additionally, an evaluation criterion based on cloud model membership is established to measure the relevance between different cluster-classes, which provides important spatial knowledge for the solution of the "extension" problem. It is shown through numerical simulations that the proposed method is effective on solving the "extension" problem in multi-mode radar signal sorting, and can achieve higher correct sorting rate.

Analysis of Pointer Adjustment Jitter Generated in Degraded Mode with Computer Simulation (비정상인 모드에서 발생되는 포인터조정지터의 컴퓨터 시뮬레이션에 의한 분석)

  • Choe, Seung-Guk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.4
    • /
    • pp.561-566
    • /
    • 1995
  • In the degraded mode, there is frequency-misalignment between the node clocks in a synchronous network. Therefore the phase differences between node clocks fluctuate greatly. To keep the phase difference under allowable level the pointer adjustment technique is used Unfortunately these processes cause an inherent pointer adjustment jitter, that accumulates in a chain of pointer adjustment systems. To analyze the jitter, computer simulation is carried and the results is compared with experimental jitter values.

  • PDF

A Clustering Protocol with Mode Selection for Wireless Sensor Network

  • Kusdaryono, Aries;Lee, Kyung-Oh
    • Journal of Information Processing Systems
    • /
    • v.7 no.1
    • /
    • pp.29-42
    • /
    • 2011
  • Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

Linear Sub-band Decomposition-based Pre-processing for Perceptual Video Coding

  • Choi, Kwang Yeon;Song, Byung Cheol
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.5
    • /
    • pp.366-373
    • /
    • 2016
  • This paper proposes a pre-processing algorithm to improve the coding efficiency of perceptual video coding. First, an input image is decomposed into multiple sub-bands through linear sub-band decomposition. Then, the sub-bands that have low visual sensitivity are suppressed by assigning small gains to them. Experimental results show that if the proposed algorithm is adopted for pre-processing in a High Efficiency Video Coding (HEVC) encoder, it can provide significant bit-saving effects of approximately 12% in low delay mode and 9.4% in random access mode.

Multiscale self-coordination of bidimensional empirical mode decomposition in image fusion

  • An, Feng-Ping;Zhou, Xian-Wei;Lin, Da-Chao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.4
    • /
    • pp.1441-1456
    • /
    • 2015
  • The bidimensional empirical mode decomposition (BEMD) algorithm with high adaptability is more suitable to process multiple image fusion than traditional image fusion. However, the advantages of this algorithm are limited by the end effects problem, multiscale integration problem and number difference of intrinsic mode functions in multiple images decomposition. This study proposes the multiscale self-coordination BEMD algorithm to solve this problem. This algorithm outside extending the feather information with the support vector machine which has a high degree of generalization, then it also overcomes the BEMD end effects problem with conventional mirror extension methods of data processing,. The coordination of the extreme value point of the source image helps solve the problem of multiscale information fusion. Results show that the proposed method is better than the wavelet and NSCT method in retaining the characteristics of the source image information and the details of the mutation information inherited from the source image and in significantly improving the signal-to-noise ratio.

An Efficient 2-dimensional Addressing Mode for Image Processor (영상처리용 프로세서를 위한 이차원 어드레스 지정 기법)

  • 고윤호;조경석;김성대
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.1105-1108
    • /
    • 1999
  • In this paper, we propose a new addressing mode, which can be used for programmable image processor to perform image- processing algorithms effectively. Conventional addressing modes are suitable for one-dimensional data processing such as voice, but the proposed addressing mode consider two-dimensional characteristics of image data. The proposed instruction for two-dimensional addressing requires two operands to specify a pixel and doesn't require any change of memory architecture. Combining several instructions to load a pixel-data from an external memory to a register, the proposed instruction reduces code size so that satisfy hish performance and low power requirements of image processor. In addition, it uses inherent two-dimensional characteristics of image data and offers user-friendly instruction to assembler programmer.

  • PDF

Comparison of wavelet-based decomposition and empirical mode decomposition of electrohysterogram signals for preterm birth classification

  • Janjarasjitt, Suparerk
    • ETRI Journal
    • /
    • v.44 no.5
    • /
    • pp.826-836
    • /
    • 2022
  • Signal decomposition is a computational technique that dissects a signal into its constituent components, providing supplementary information. In this study, the capability of two common signal decomposition techniques, including wavelet-based and empirical mode decomposition, on preterm birth classification was investigated. Ten time-domain features were extracted from the constituent components of electrohysterogram (EHG) signals, including EHG subbands and EHG intrinsic mode functions, and employed for preterm birth classification. Preterm birth classification and anticipation are crucial tasks that can help reduce preterm birth complications. The computational results show that the preterm birth classification obtained using wavelet-based decomposition is superior. This, therefore, implies that EHG subbands decomposed through wavelet-based decomposition provide more applicable information for preterm birth classification. Furthermore, an accuracy of 0.9776 and a specificity of 0.9978, the best performance on preterm birth classification among state-of-the-art signal processing techniques, were obtained using the time-domain features of EHG subbands.