• 제목/요약/키워드: Parallel coding

검색결과 161건 처리시간 0.033초

시계열 예측을 위한 DNA코딩 기반의 신경망 진화 (Evolutionary Neural Network based on DNA Coding Method for Time Series Prediction)

  • 이기열;이동욱;심귀보
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
    • /
    • pp.224-227
    • /
    • 2000
  • In this Paper, we prepose a method of constructing neural networks using bio-inspired emergent and evolutionary concepts. This method is algorithm that is based on the characteristics of the biological DNA and growth of plants. Here is, we propose a constructing method to make a DNA coding method for production rule of L-system. L-system is based on so-called the parallel rewriting mechanism. The DNA coding method has no limitation in expressing the production rule of L-system. Evolutionary algorithms motivated by Darwinian natural selection are population based searching methods and the high performance of which is highly dependent on the representation of solution space. In order to verify the effectiveness of our scheme, we apply it to one step ahead prediction of Mackey-Glass time series, Sun spot data and KOSPI data.

  • PDF

DNA 코딩방법을 이용한 이중도립진자의 퍼지제어 (Fuzzy Control of Double Inverted Pendulum using DNA coding Method)

  • 임태우;권양원;최용선;안태천
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 하계학술대회 논문집 D
    • /
    • pp.2633-2635
    • /
    • 2000
  • In this paper, a new DNA coding method, namely modified DNA coding method based on the biological DNA and the evolution mechanism of genetic algorithm. In order to evaluate the propose algorithms, for an example, they are applied to the fuzzy control of parallel double inverted pendulum system. Simulation result show the method is effective in finding the fuzzy control rules and is more excellent than conventional methods in control the system.

  • PDF

Evolvable Neural Networks Based on Developmental Models for Mobile Robot Navigation

  • Lee, Dong-Wook;Seo, Sang-Wook;Sim, Kwee-Bo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제7권3호
    • /
    • pp.176-181
    • /
    • 2007
  • This paper presents evolvable neural networks based on a developmental model for navigation control of autonomous mobile robots in dynamic operating environments. Bio-inspired mechanisms have been applied to autonomous design of artificial neural networks for solving practical problems. The proposed neural network architecture is grown from an initial developmental model by a set of production rules of the L-system that are represented by the DNA coding. The L-system is based on parallel rewriting mechanism motivated by the growth models of plants. DNA coding gives an effective method of expressing general production rules. Experiments show that the evolvable neural network designed by the production rules of the L-system develops into a controller for mobile robot navigation to avoid collisions with the obstacles.

Multipath Routing and Spectrum Allocation for Network Coding Enabled Elastic Optical Networks

  • Wang, Xin;Gu, Rentao;Ji, Yuefeng
    • Current Optics and Photonics
    • /
    • 제1권5호
    • /
    • pp.456-467
    • /
    • 2017
  • The benefits of network coding in all-optical multicast networks have been widely demonstrated. In this paper, we mainly discuss the multicast service efficiently provisioning problem in the network coding enabled elastic optical networks (EONs). Although most research on routing and spectrum allocation (RSA) has been widely studied in the elastic optical networks (EONs), rare research studies RSA for multicast in the network coding enabled EON, especially considering the time delay constraint. We propose an efficient heuristic algorithm, called Network Coding based Multicast Capable-Multipath Routing and Spectrum Allocation (NCMC-MRSA) to solve the multipath RSA for multicast services in the network coding enabled EON. The well-known layered graph approach is utilized for NCMC-MRSA, and two request ordering strategies are utilized for multiple multicast requests. From the simulation results, we observe that the proposed algorithm NCMC-MRSA performs more efficient spectrum utilization compared with the benchmark algorithms. NCMC-MRSA utilizing the spectrum request balancing (SRB) ordering strategy shows the most efficient spectrum utilization performance among other algorithms in most test networks. Note that we also observe that the efficiency of NCMC-MRSA shows more obvious than the benchmark algorithm in large networks. We also conduct the performance comparisons of two request ordering strategies for NCMC-MRSA. Besides, we also evaluate the impact of the number of the linkdisjoint parallel w paths on the spectrum utilization performance of the proposed algorithm NCMC-MRSA. It is interesting to find that the change of the parameter w in a certain range has a significant impact on the performance of NCMC-MRSA. As the parameter w increases to a certain value, the performances of NCMC-MRSA cannot be affected by the change of w any more.

비휘발성 메모리를 위한 병렬 BCH 인코딩/디코딩 방법 및 VLSI 설계 (Parallel BCH Encoding/decoding Method and VLSI Design for Nonvolatile Memory)

  • 이상혁;백광현
    • 대한전자공학회논문지SD
    • /
    • 제47권5호
    • /
    • pp.41-47
    • /
    • 2010
  • 본 논문에서는 SSD (solid state disk)에 쓰이는 NAND flash 메모리 에러 정정에 관한 오류정정 방법 중에서 Parallel BCH(Bose-Chaudhuri-Hocquenghem) 방법 및 VLSI 설계를 제안하였다. 제안된 설계는 에러 정정 능력(t=18, 8) 을 가변적으로 하여 사용빈도수의 증가로 높은 에러 율을 가진 데이터 공간에 신뢰성을 높였고, 디코더의 병렬처리 비트 수를 인코더의 처리 비트 수에 2배로 하여 디코더의 수행시간을 줄였고 이에 따르는 latency도 기존 회로에 비해 1/2로 감소함을 확인 하였다.

A Study on Parallel Processing System for Automatic Segmentation of Moving Object in Image Sequences

  • Lee, Hyung;Park, Jong-Won
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -1
    • /
    • pp.429-432
    • /
    • 2000
  • The new MPEG-4 video coding standard enables content-based functionalities. In order to support the philosophy of the MPEG-4 visual standard, each frame of video sequences should be represented in terms of video object planes (VOP’s). In other words, video objects to be encoded in still pictures or video sequences should be prepared before the encoding process starts. Therefore, it requires a prior decomposition of sequences into VOP’s so that each VOP represents a moving object. A parallel processing system is required an automatic segmentation to be processed in real-time, because an automatic segmentation is time consuming. This paper addresses the parallel processing: system for an automatic segmentation for separating moving object from the background in image sequences. The proposed parallel processing system comprises of processing elements (PE’s) and a multi-access memory system (MAMS). Multi-access memory system is a memory controller to perform parallel memory access with the variety of types: horizontal, vertical, and block access way. In order to realize these ways, a multi-access memory system consists of a memory module selection module, data routing modules, and an address calculation and routing module. The proposed system is simulated and evaluated by the CADENCE Verilog-XL hardware simulation package.

  • PDF

Efficient LDPC coding using a hybrid H-matrix

  • Kim Tae Jin;Lee Chan Ho;Yeo Soon Il;Roh Tae Moon
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 학술대회지
    • /
    • pp.473-476
    • /
    • 2004
  • Low-Density Parity-Check (LDPC) codes are recently emerged due to its excellent performance to use. However, the parity check matrices (H) of the previous works are not adequate for hardware implementation of encoders or decoders. This paper proposes a hybrid parity check matrix for partially parallel decoder structures, which is efficient in hardware implementation of both decoders and encoders. Using proposed methods, the encoding design can become practical while keeping the hardware complexity of partially parallel decoder structures.

  • PDF

Full Search Equivalent Motion Estimation Algorithm for General-Purpose Multi-Core Architectures

  • Park, Chun-Su
    • 반도체디스플레이기술학회지
    • /
    • 제12권3호
    • /
    • pp.13-18
    • /
    • 2013
  • Motion estimation is a key technique of modern video processing that significantly improves the coding efficiency significantly by exploiting the temporal redundancy between successive frames. Thread-level parallelism is a promising method to accelerate the motion estimation process for multithreading general-purpose processors. In this paper, we propose a parallel motion estimation algorithm which parallelizes the motion search process of the current H.264/AVC encoder. The proposed algorithm is implemented using the OpenMP application programming interface (API) and can be easily integrated into the current encoder. The experimental results show that the proposed parallel algorithm can reduce the processing time of the motion estimation up to 65.08% without any penalty in the rate-distortion (RD) performance.

GPGPU를 이용한 H.264/AVC 디코더 (Implementation of IQ/IDCT in H.264/AVC Decoder Using GPGPU)

  • 김동한;이광엽
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2010년도 춘계학술대회
    • /
    • pp.162-164
    • /
    • 2010
  • ITU-T와 ISO가 공동 제정한 동영상 압축 표준 H.264는 기존 동영상 압축 표준에 비해 높은 압축성능과 유연성을 가진다. 본 논문에서는 병렬 처리에 효과적인 GPGPU(General-Purpose computing on Graphics Processing Units)를 이용하여 H.264/AVC 복호화 알고리즘에서 병렬 처리가 가능한 IQ/IDCT (Inverse Quantization/ Inverse Discrete Cosine Transform) 연산을 고속으로 수행하기 위한 효율적인 구조와 방법을 제안한다.

  • PDF

Exact Decoding Probability of Random Linear Network Coding for Tree Networks

  • Li, Fang;Xie, Min
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권2호
    • /
    • pp.714-727
    • /
    • 2015
  • The hierarchical structure in networks is widely applied in many practical scenarios especially in some emergency cases. In this paper, we focus on a tree network with and without packet loss where one source sends data to n destinations, through m relay nodes employing random linear network coding (RLNC) over a Galois field in parallel transmission systems. We derive closed-form probability expressions of successful decoding at a destination node and at all destination nodes in this multicast scenario. For the convenience of computing, we also propose an upper bound for the failure probability. We then investigate the impact of the major parameters, i.e., the size of finite fields, the number of internal nodes, the number of sink nodes and the channel failure probability, on the decoding performance with simulation results. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. When failure decoding probabilities are given, the operation is simple and its complexity is low in a small finite field.