• Title/Summary/Keyword: Parity

Search Result 1,098, Processing Time 0.024 seconds

A Symbiotic Evolutionary Design of Error-Correcting Code with Minimal Power Consumption

  • Lee, Hee-Sung;Kim, Eun-Tai
    • ETRI Journal
    • /
    • v.30 no.6
    • /
    • pp.799-806
    • /
    • 2008
  • In this paper, a new design for an error correcting code (ECC) is proposed. The design is aimed to build an ECC circuitry with minimal power consumption. The genetic algorithm equipped with the symbiotic mechanism is used to design a power-efficient ECC which provides single-error correction and double-error detection (SEC-DED). We formulate the selection of the parity check matrix into a collection of individual and specialized optimization problems and propose a symbiotic evolution method to search for an ECC with minimal power consumption. Finally, we conduct simulations to demonstrate the effectiveness of the proposed method.

  • PDF

A Modified Deterministic Boltzmann Machine Learning Algorithm for Networks with Quantized Connection (양자화 결합 네트워크를 위한 수정된 결정론적 볼츠만머신 학습 알고리즘)

  • 박철영
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.7 no.3
    • /
    • pp.62-67
    • /
    • 2002
  • From the view point of VLSI implementation, a new teaming algorithm suited for network with quantized connection weights is desired. This paper presents a new teaming algorithm for the DBM(deterministic Boltzmann machine) network with quantized connection weight. The performance of proposed algorithm is tested with the 2-input XOR problem and the 3-input parity problem through computer simulations. The simulation results show that our algorithm is efficient for quantized connection neural networks.

  • PDF

The Concatenated Coding Scheme for OFDM system over burst noise channel

  • Byung-Hyun, Moon;Sang-Min, Choi
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.9 no.2
    • /
    • pp.17-22
    • /
    • 2004
  • In this paper, a concatenated RS and Turbo code is proposed for OFDM system over burst error channel. The concatenated code used in this study is a RS(255,202) code and a rate 1/2 turbo code. The turbo code uses 2 recursive systematic convolutional (RSC) code as the constituent codes and the parity bit are punctured to get the desired code rate. It is shown by simulation that the conventional OFDM system fails when there exists burst noise. The concatenated RS and turbo code obtains at least 5dB gain over the turbo code at the bit error probability of 10/sup -3/.

  • PDF

Comparative Study on Predictors of Maternal Confidence between Primipara and Multipara (초산모와 경산모의 모성역할 자신감에 대한 영향요인 비교)

  • Chung, Sung-Suk;Joung, Kyoung-Hwa
    • Child Health Nursing Research
    • /
    • v.17 no.3
    • /
    • pp.181-189
    • /
    • 2011
  • Purpose: This study was done to investigate the predictors of maternal confidence between primipara and multipara mothers. Methods: The participants enrolled in this study were 145 mothers between 2 and 5 days postpartum. Data were collected using a questionnaire and analyzed using descriptive analysis, t-test, $X^2$ test, ANOVA, Pearson correlation coefficients, and stepwise multiple regression. Results: The predictors of maternal confidence among primipara mothers were social support, self-esteem, mode of delivery ($R^2$=.287, p<.001). Whereas, gender of baby, antenatal fetal attachment, and educational status explained maternal confidence among multipara mothers ($R^2$=.270, p<.001). Conclusion: The results indicate that when nurses develop programs to encourage maternal confidence for new mothers, they should take into account the differences between predictors of maternal confidence according to the mothers' experience of birth.

Long-Run Exchange Rates, Price Levels, and Purchasing Power Parity: Cointegration Tests of Five Korea Trading Partners' Currencies

  • Gong, Jai-Sik
    • The Korean Journal of Financial Studies
    • /
    • v.6 no.1
    • /
    • pp.313-334
    • /
    • 2000
  • In this paper, we obtained some supportive evidence for the long-run PPP relationship concerning the Korean Won currency. Previous tests of PPP in the bilateral exchange rates of the Korean Won rate vis-a-vis the U.S. Dollar have been exposed to the lack of power problem. We argue that their failure to find PPP relation in Korean Won rates was due to the low power of Augmented Dickey-Fuller tests or the Engle-Granger two-step tests applied to the Korean exchange rate data with short sample period. En attempting to alleviate this low power problem, we used the error-correction model test and the Johansen test for bilateral long-run equilibrium relationships between exchange rates and price indices from Korea's major trading partners. It is surprising that our evidence supporting for long-run PPP in Korean Won rate contrasts sharply with Bahmani-Oskooee, Moshen and Rhee, Hyun-Jae(1992)'s.

  • PDF

Determining Optimal Installed Capacity and the Interconnected Bus of Renewable Energy Sources Considering the Cost of Energy Not Supplied (정전비용을 고려한 신재생에너지원의 최적 연계 용량 및 연계 위치 결정에 관한 연구)

  • Kim, Sung-Yul;Lee, Sung-Hun;Kim, Jin-O
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.10
    • /
    • pp.1393-1398
    • /
    • 2012
  • Due to environmental regulation and technical improvements, renewable energy sources (RES) are increasingly penetrated and operated in power systems. Clean energy technologies have become cost-competitive with conventional power systems, and in the near future, the generation cost of RES is expected to approach grid parity. In this situation, it should be considered an extraordinarily important issue to be maximized resulting in utilization of RES as well as to develop technologies for efficiency improvement of RES. Therefore, in this paper, the method for determining an optimal installed capacity and interconnected location of RES is proposed in order to minimize the cost of energy not supplied, which can contribute to improve distribution reliability.

A NEW MEAN VALUE RELATED TO D. H. LEHMER'S PROBLEM AND KLOOSTERMAN SUMS

  • Han, Di;Zhang, Wenpeng
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.1
    • /
    • pp.35-43
    • /
    • 2015
  • Let q > 1 be an odd integer and c be a fixed integer with (c, q) = 1. For each integer a with $1{\leq}a{\leq}q-1$, it is clear that the exists one and only one b with $0{\leq}b{\leq}q-1$ such that $ab{\equiv}c$ (mod q). Let N(c, q) denote the number of all solutions of the congruence equation $ab{\equiv}c$ (mod q) for $1{\leq}a$, $b{\leq}q-1$ in which a and $\bar{b}$ are of opposite parity, where $\bar{b}$ is defined by the congruence equation $b\bar{b}{\equiv}1$ (modq). The main purpose of this paper is using the mean value theorem of Dirichlet L-functions to study the mean value properties of a summation involving $(N(c,q)-\frac{1}{2}{\phi}(q))$ and Kloosterman sums, and give a sharper asymptotic formula for it.

PRIMITIVE IDEMPOTENTS IN THE RING F4[x]/〈xpn-1〉 AND CYCLOTOMIC Q CODES

  • Batra, Sudhir;Mathur, Rekha
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.3
    • /
    • pp.971-997
    • /
    • 2018
  • The parity of cyclotomic numbers of order 2, 4 and 6 associated with 4-cyclotomic cosets modulo an odd prime p are obtained. Hence the explicit expressions of primitive idempotents of minimal cyclic codes of length $p^n$, $n{\geq}1$ over the quaternary field $F_4$ are obtained. These codes are observed to be subcodes of Q codes of length $p^n$. Some orthogonal properties of these subcodes are discussed. The minimal cyclic codes of length 17 and 43 are also discussed and it is observed that the minimal cyclic codes of length 17 are two weight codes. Further, it is shown that a Q code of prime length is always cyclotomic like a binary duadic code and it seems that there are infinitely many prime lengths for which cyclotomic Q codes of order 6 exist.

SKEW CYCLIC CODES OVER 𝔽p + v𝔽p + v2𝔽p

  • Mousavi, Hamed;Moussavi, Ahmad;Rahimi, Saeed
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.6
    • /
    • pp.1627-1638
    • /
    • 2018
  • In this paper, we study an special type of cyclic codes called skew cyclic codes over the ring ${\mathbb{F}}_p+v{\mathbb{F}}_p+v^2{\mathbb{F}}_p$, where p is a prime number. This set of codes are the result of module (or ring) structure of the skew polynomial ring (${\mathbb{F}}_p+v{\mathbb{F}}_p+v^2{\mathbb{F}}_p$)[$x;{\theta}$] where $v^3=1$ and ${\theta}$ is an ${\mathbb{F}}_p$-automorphism such that ${\theta}(v)=v^2$. We show that when n is even, these codes are either principal or generated by two elements. The generator and parity check matrix are proposed. Some examples of linear codes with optimum Hamming distance are also provided.

차세대 통신 시스템을 위한 오류 정정 부호

  • Park, Ho-Seong;No, Jong-Seon
    • Information and Communications Magazine
    • /
    • v.29 no.8
    • /
    • pp.26-33
    • /
    • 2012
  • 차세대 통신 시스템에서는 고속 데이터 전송을 위해 다수의 송신자와 수신자가 네트워크를 구성하여 정보를 주고 받는 다자간 협력 통신을 가정한다. 이러한 상황에 적합한 오류 정정 부호로 이미 탁월한 오류 정정 능력을 검증 받은 저밀도 패리티 체크 (low-density parity-check, LDPC)부호, 이진 입력 이산 비기억 (discrete memoryless) 채널에서 무한한 길이에 대하여 채널 용량 (channel capacity)을 달성하는 것으로 알려진 극 부호 (polar code), 아직은 많이 개발되지 않았지만 보다 높은 전송률을 달성할 수 있는 다중점 (multiple point) 채널에서의 새로운 부호 등이 거론될 수 있다. 본고에서는 이러한 차세대 통신 시스템을 위한 오류 정정 부호들에 대해서 기본 이론과 최근 연구 동향, 그리고 향후 연구 방향 등을 소개하도록 한다.