• Title/Summary/Keyword: Key equation solver

Search Result 14, Processing Time 0.032 seconds

Design of an Area-efficient DCME Algorithm for High-speed Reed-Solomon Decoder (고속 Reed-Solomon 복호기를 위한 면적 효율적인 DCME 알고리즘 설계)

  • Kang, Sung Jin
    • Journal of the Semiconductor & Display Technology
    • /
    • v.13 no.4
    • /
    • pp.7-13
    • /
    • 2014
  • In this paper, an area-efficient degree-computationless modified Euclidean (DCME) algorithm is presented and implemented for high-speed Reed-Solomon (RS) decoder. The DCME algorithm can be used to solve the key equation in Reed-Solomon decoder to get the error location polynomial and the error value polynomial. A pipelined recursive structure is adopted for reducing the area of key equation solver (KES) block with sacrifice of an amount of decoding latency. For comparisons, KES block for RS(255,239,8) decoder with the proposed architecture is implemented using Verilog HDL and synthesized using Synopsys design tool and 65nm CMOS technology. The synthesis results show that the proposed architecture can be implemented with less gate counts than other existing DCME architectures.

A fast adaptive numerical solver for nonseparable elliptic partial differential equations

  • Lee, June-Yub
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.2 no.1
    • /
    • pp.27-39
    • /
    • 1998
  • We describe a fast numerical method for non-separable elliptic equations in self-adjoin form on irregular adaptive domains. One of the most successful results in numerical PDE is developing rapid elliptic solvers for separable EPDEs, for example, Fourier transformation methods for Poisson problem on a square, however, it is known that there is no rapid elliptic solvers capable of solving a general nonseparable problems. It is the purpose of this paper to present an iterative solver for linear EPDEs in self-adjoint form. The scheme discussed in this paper solves a given non-separable equation using a sequence of solutions of Poisson equations, therefore, the most important key for such a method is having a good Poison solver. High performance is achieved by using a fast high-order adaptive Poisson solver which requires only about 500 floating point operations per gridpoint in order to obtain machine precision for both the computed solution and its partial derivatives. A few numerical examples have been presented.

  • PDF

Design of Degree-Computationless Modified Euclidean Algorithm using Polynomial Expression (다항식 표현을 이용한 DCME 알고리즘 설계)

  • Kang, Sung-Jin;Kim, Nam-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.10A
    • /
    • pp.809-815
    • /
    • 2011
  • In this paper, we have proposed and implemented a novel architecture which can be used to effectively design the modified Euclidean (ME) algorithm for key equation solver (KES) block in high-speed Reed-Solomon (RS) decoder. With polynomial expressions of newly-defined state variables for controlling each processing element (PE), the proposed architecture has simple input/output signals and requires less hardware complexity because no degree computation circuits are needed. In addition, since each PE circuit is independent of the error correcting capability t of RS codes, it has the advantage of linearly increase of the hardware complexity of KES block as t increases. For comparisons, KES block for RS(255,239,8) decoder is implemented using Verilog HDL and synthesized with 0.13um CMOS cell library. From the results, we can see that the proposed architecture can be used for a high-speed RS decoder with less gate count.

High-Speed Low-Complexity Reed-Solomon Decoder using Pipelined Berlekamp-Massey Algorithm and Its Folded Architecture

  • Park, Jeong-In;Lee, Ki-Hoon;Choi, Chang-Seok;Lee, Han-Ho
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.10 no.3
    • /
    • pp.193-202
    • /
    • 2010
  • This paper presents a high-speed low-complexity pipelined Reed-Solomon (RS) (255,239) decoder using pipelined reformulated inversionless Berlekamp-Massey (pRiBM) algorithm and its folded version (PF-RiBM). Also, this paper offers efficient pipelining and folding technique of the RS decoders. This architecture uses pipelined Galois-Field (GF) multipliers in the syndrome computation block, key equation solver (KES) block, Forney block, Chien search block and error correction block to enhance the clock frequency. A high-speed pipelined RS decoder based on the pRiBM algorithm and its folded version have been designed and implemented with 90-nm CMOS technology in a supply voltage of 1.1 V. The proposed RS(255,239) decoder operates at a clock frequency of 700 MHz using the pRiBM architecture and also operates at a clock frequency of 750 MHz using the PF-RiBM, respectively. The proposed architectures feature high clock frequency and low-complexity.

Size Effect of Integral Surface of FW-H Equations on Prediction of Aeroacoustic Noise (FW-H 방정식에서 적분표면의 크기가 유동소음 해석결과에 미치는 영향)

  • Yoo, Seung-Won;Lee, Jong-Soo;Min, Oak-Key
    • Proceedings of the KSME Conference
    • /
    • 2001.06e
    • /
    • pp.416-421
    • /
    • 2001
  • This paper presents the numerical prediction of sound generated by viscous flow past a circular cylinder. The two dimensional flow field is predicted using FEM based Reynolds-averaged Navier-Stokes solver, and the calculated unsteady fluid field values are utilized by an acoustic code that implements Ffowcs Willianms-Hawkings(FW-H) equation. The integration surface used in acoustic analysis is extended from the cylinder surface to permeable surfaces. The 2D based CFD calculations overpredict the acoustic amplitude, however, if adequate correlation length is used, the predicted acoustic amplitude agrees well with experiment. The predictions using extended integral surface in FW-H equation show results that contain the characteristics of quadrupole - volume integration - noise term, and do not vary seriously with the integral surface location.

  • PDF

Robustness Improvement and Assessment of EARSM k-ω Model for Complex Turbulent Flows

  • Zhang, Qiang;Li, Dian;Xia, ZhenFeng;Yang, Yong
    • International Journal of Aerospace System Engineering
    • /
    • v.2 no.2
    • /
    • pp.67-72
    • /
    • 2015
  • The main concern of this study is to integrate the EARSM into an industrial RANS solver in conjunction with the $k-{\omega}$ model, as proposed by Hellsten (EARSMKO2005). In order to improve the robustness, particular limiters are introduced to turbulent conservative variables, and a suitable full-approximation storage (FAS) multi-grid (MG) strategy is designed to incorporate turbulence model equations. The present limiters and MG strategy improve both robustness and efficiency significantly but without degenerating accuracy. Two discretization approachs for velocity gradient on cell interfaces are implemented and compared with each other. Numerical results of a three-dimensional supersonic square duct flow show that the proper discretization of velocity gradient improves the accuracy essentially. To assess the capability of the resulting EARSM $k-{\omega}$ model to predict complex engineering flow, the case of Common Research Model (CRM, Wing-Body) is performed. All the numerical results demonstrate that the resulting model performs well and is comparable to the standard two-equation models such as SST $k-{\omega}$ model in terms of computational effort, thus it is suitable for industrial applications.

Large eddy simulation of turbulent flow using the parallel computational fluid dynamics code GASFLOW-MPI

  • Zhang, Han;Li, Yabing;Xiao, Jianjun;Jordan, Thomas
    • Nuclear Engineering and Technology
    • /
    • v.49 no.6
    • /
    • pp.1310-1317
    • /
    • 2017
  • GASFLOW-MPI is a widely used scalable computational fluid dynamics numerical tool to simulate the fluid turbulence behavior, combustion dynamics, and other related thermal-hydraulic phenomena in nuclear power plant containment. An efficient scalable linear solver for the large-scale pressure equation is one of the key issues to ensure the computational efficiency of GASFLOW-MPI. Several advanced Krylov subspace methods and scalable preconditioning methods are compared and analyzed to improve the computational performance. With the help of the powerful computational capability, the large eddy simulation turbulent model is used to resolve more detailed turbulent behaviors. A backward-facing step flow is performed to study the free shear layer, the recirculation region, and the boundary layer, which is widespread in many scientific and engineering applications. Numerical results are compared with the experimental data in the literature and the direct numerical simulation results by GASFLOW-MPI. Both time-averaged velocity profile and turbulent intensity are well consistent with the experimental data and direct numerical simulation result. Furthermore, the frequency spectrum is presented and a -5/3 energy decay is observed for a wide range of frequencies, satisfying the turbulent energy spectrum theory. Parallel scaling tests are also implemented on the KIT/IKET cluster and a linear scaling is realized for GASFLOW-MPI.

A Design of RS Decoder for MB-OFDM UWB (MB-OFDM UWB 를 위한 RS 복호기 설계)

  • Choi, Sung-Woo;Shin, Cheol-Ho;Choi, Sang-Sung
    • Proceedings of the Korea Electromagnetic Engineering Society Conference
    • /
    • 2005.11a
    • /
    • pp.131-136
    • /
    • 2005
  • UWB is the most spotlighted wireless technology that transmits data at very high rates using low power over a wide spectrum of frequency band. UWB technology makes it possible to transmit data at rate over 100Mbps within 10 meters. To preserve important header information, MB-OFDM UWB adopts Reed-Solomon(23,17) code. In receiver, RS decoder needs high speed and low latency using efficient hardware. In this paper, we suggest the architecture of RS decoder for MB-OFDM UWB. We adopts Modified-Euclidean algorithm for key equation solver block which is most complex in area. We suggest pipelined processing cell for this block and show the detailed architecture of syndrome, Chien search and Forney algorithm block. At last, we show the hardware implementation results of RS decoder for ASIC implementation.

  • PDF

Architecture of RS decoder for MB-OFDM UWB

  • Choi, Sung-Woo;Choi, Sang-Sung;Lee, Han-Ho
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.195-198
    • /
    • 2005
  • UWB is the most spotlighted wireless technology that transmits data at very high rates using low power over a wide spectrum of frequency band. UWB technology makes it possible to transmit data at rate over 100Mbps within 10 meters. To preserve important header information, MBOFDM UWB adopts Reed-Solomon(23,17) code. In receiver, RS decoder needs high speed and low latency using efficient hardware. In this paper, we suggest the architecture of RS decoder for MBOFDM UWB. We adopts Modified-Euclidean algorithm for key equation solver block which is most complex in area. We suggest pipelined processing cell for this block and show the detailed architecture of syndrome, Chien search and Forney algorithm block. At last, we show the hardware implementation results of RS decoder for ASIC implementation.

  • PDF

Design of a RS(23,17) Reed-Solomon Decoder (RS(23,17) 리드-솔로몬 복호기 설계)

  • Kang, Sung-Jin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.12
    • /
    • pp.2286-2292
    • /
    • 2008
  • In this paper, we design a RS(23,17) decoder for MB-OFDM(Multiband-Orthogonal Frequency Division Multiplexing) system, in which Modified Euclidean(ME) algorithm is adopted for key equation solver block. The proposed decoder has been optimized for MB-OFDM system so that it has less latency and hardware complexity. Additionally, we have implemented the proposed decoder using Verilog HDL and synthesized with Samsung 65nm library. From synthesis results, it can operate at clock frequency of 250MHz, and gate count is 20,710.