• Title/Summary/Keyword: dual code

Search Result 216, Processing Time 0.027 seconds

ADDITIVE SELF-DUAL CODES OVER FIELDS OF EVEN ORDER

  • Dougherty, Steven T.;Kim, Jon-Lark;Lee, Nari
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.2
    • /
    • pp.341-357
    • /
    • 2018
  • We examine various dualities over the fields of even orders, giving new dualities for additive codes. We relate the MacWilliams relations and the duals of ${\mathbb{F}}_{2^{2s}}$ codes for these various dualities. We study self-dual codes with respect to these dualities and prove that any subgroup of order $2^s$ of the additive group is a self-dual code with respect to some duality.

ON THE CONSTRUCTION OF SELF-DUAL CODES OVER GF(2m) USING SYMMETRIC GENERATOR MATRICES

  • HAN, SUNGHYU
    • Journal of applied mathematics & informatics
    • /
    • v.39 no.5_6
    • /
    • pp.703-715
    • /
    • 2021
  • There are several methods for constructing self-dual codes. Among them, the building-up construction is a powerful method. Recently, Kim and Choi proposed special building-up constructions which use symmetric generator matrices for self-dual codes over GF(q), where q is odd. In this paper, we study the same method when q is even.

An Efficient Programmable Memory BIST for Dual-Port Memories (이중 포트 메모리를 위한 효율적인 프로그램 가능한 메모리 BIST)

  • Park, Young-Kyu;Han, Tae-Woo;Kang, Sung-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.49 no.8
    • /
    • pp.55-62
    • /
    • 2012
  • The development of memory design and process technology enabled the production of high density memory. As the weight of embedded memory within aggregate Systems-On-Chips(SoC) gradually increases to 80-90% of the number of total transistors, the importance of testing embedded dual-port memories in SoC increases. This paper proposes a new micro-code based programmable memory Built-In Self-Test(PMBIST) architecture for dual-port memories that support test various test algorithms. In addition, various test algorithms including March based algorithms and dual-port memory test algorithms are efficiently programmed through the proposed algorithm instruction set. This PMBIST has an optimized hardware overhead, since test algorithm can be implemented with the minimum bits by the optimized algorithm instructions.

A DSP-Based Dual Loop Digital Controller Design and Implementation of a High Power Boost Converter for Hybrid Electric Vehicles Applications

  • Ellabban, Omar;Mierlo, Joeri Van;Lataire, Philippe
    • Journal of Power Electronics
    • /
    • v.11 no.2
    • /
    • pp.113-119
    • /
    • 2011
  • This paper presents a DSP based direct digital control design and implementation for a high power boost converter. A single loop and dual loop voltage control are digitally implemented and compared. The real time workshop (RTW) is used for automatic real-time code generation. Experimental results of a 20 kW boost converter based on the TMS320F2808 DSP during reference voltage changes, input voltage changes, and load disturbances are presented. The results show that the dual loop control achieves better steady state and transient performance than the single loop control. In addition, the experimental results validate the effectiveness of using the RTW for automatic code generation to speed up the system implementation.

Numerical Analysis of Viscous Flow on the Periodic Oscillating Flat Plate using Unsteady CFD Code (비정상 CFD 코드를 이용한 주기성 하모닉 진동 평판 위의 점성유동 수치해석)

  • Lee, Eunseok
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2017.05a
    • /
    • pp.1000-1002
    • /
    • 2017
  • Here, the unsteady Navier-Stokes solver has been developed using implicit dual time stepping method. The implicit dual time stepping method introduced the pseudo time step for solving the new residual including the steady state residual and real time derivative. For the validation of code, Stokes 2nd problem, the laminar flow on the oscillating flat plate was selected and compare the calculating results with analytic solutions. The calculating velocity profile and skin friction has a good agreement with analytic solutions.

  • PDF

CONSTRUCTION FOR SELF-ORTHOGONAL CODES OVER A CERTAIN NON-CHAIN FROBENIUS RING

  • Kim, Boran
    • Journal of the Korean Mathematical Society
    • /
    • v.59 no.1
    • /
    • pp.193-204
    • /
    • 2022
  • We present construction methods for free self-orthogonal (self-dual or Type II) codes over ℤ4[v]/〈v2 + 2v〉 which is one of the finite commutative local non-chain Frobenius rings of order 16. By considering their Gray images on ℤ4, we give a construct method for a code over ℤ4. We have some new and optimal codes over ℤ4 with respect to the minimum Lee weight or minimum Euclidean weight.

Voice Activity Detection Algorithm base on Radial Basis Function Networks with Dual Threshold (Radial Basis Function Networks를 이용한 이중 임계값 방식의 음성구간 검출기)

  • Kim Hong lk;Park Sung Kwon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12C
    • /
    • pp.1660-1668
    • /
    • 2004
  • This paper proposes a Voice Activity Detection (VAD) algorithm based on Radial Basis Function (RBF) network using dual threshold. The k-means clustering and Least Mean Square (LMS) algorithm are used to upade the RBF network to the underlying speech condition. The inputs for RBF are the three parameters in a Code Exited Linear Prediction (CELP) coder, which works stably under various background noise levels. Dual hangover threshold applies in BRF-VAD for reducing error, because threshold value has trade off effect in VAD decision. The experimental result show that the proposed VAD algorithm achieves better performance than G.729 Annex B at any noise level.

SIMPLE-ROOT NEGACYCLIC CODES OF LENGTH 2pnm OVER A FINITE FIELD

  • SHARMA, ANURADHA
    • Journal of the Korean Mathematical Society
    • /
    • v.52 no.5
    • /
    • pp.965-989
    • /
    • 2015
  • Let p, ${\ell}$ be distinct odd primes, q be an odd prime power with gcd(q, p) = gcd(q,${\ell}$) = 1, and m, n be positive integers. In this paper, we determine all self-dual, self-orthogonal and complementary-dual negacyclic codes of length $2p^{n{\ell}m}$ over the finite field ${\mathbb{F}}_q$ with q elements. We also illustrate our results with some examples.