• Title/Summary/Keyword: Parity Mechanism

Search Result 14, Processing Time 0.03 seconds

An Anti Collision Algorithm using Parity Mechanism in RFID Systems (RFID 시스템에서 패리티 메카니즘을 이용한 충돌방지 알고리즘)

  • Kim, Sung-Soo;Kim, Yong-Hwan;Ahn, Kwang-Seon
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.5
    • /
    • pp.389-396
    • /
    • 2009
  • In RFID systems, identifying the tag attached to the subject begins with the request from a reader. When the reader sends a request, multiple tags in the reader's interrogation zone simultaneously respond to it, resulting in collision. The reader needs the anti collision algorithm which can quickly identify all the tags in the interrogation zone. We propose the Anti Collision Algorithm using Parity Mechanism(ACPM). In ACPM, a collision can be prevented because the tags which match with the prefix of the reader's request respond as followings; the group of tags with an even number of 1's in the bits to the prefix + 2nd bits responds in slot '0', while the group of tags with an odd number of 1's responds in slot '1'. The ACPM generates the request prefix so that the only existing tags according to the response in the corresponding slot. If there are two collided bits in tags, then reader identify tags by the parity mechanism. That is, it decreases the tag identification time by reducing the overall number of requests.

Genetic Algorithm with the Local Fine-Tuning Mechanism (유전자 알고리즘을 위한 지역적 미세 조정 메카니즘)

  • 임영희
    • Korean Journal of Cognitive Science
    • /
    • v.4 no.2
    • /
    • pp.181-200
    • /
    • 1994
  • In the learning phase of multilyer feedforword neural network,there are problems such that local minimum,learning praralysis and slow learning speed when backpropagation algorithm used.To overcome these problems, the genetic algorithm has been used as learing method in the multilayer feedforword neural network instead of backpropagation algorithm.However,because the genetic algorith, does not have any mechanism for fine-tuned local search used in backpropagation method,it takes more time that the genetic algorithm converges to a global optimal solution.In this paper,we suggest a new GA-BP method which provides a fine-tunes local search to the genetic algorithm.GA-BP method uses gradient descent method as one of genetic algorithm's operators such as mutation or crossover.To show the effciency of the developed method,we applied it to the 3-parity bit problem with analysis.

Reliability-Based Iterative Proportionality-logic Decoding of LDPC Codes with Adaptive Decision

  • Sun, Youming;Chen, Haiqiang;Li, Xiangcheng;Luo, Lingshan;Qin, Tuanfa
    • Journal of Communications and Networks
    • /
    • v.17 no.3
    • /
    • pp.213-220
    • /
    • 2015
  • In this paper, we present a reliability-based iterative proportionality-logic decoding algorithm for two classes of structured low-density parity-check (LDPC) codes. The main contributions of this paper include: 1) Syndrome messages instead of extrinsic messages are processed and exchanged between variable nodes and check nodes, which can reduce the decoding complexity; 2) a more flexible decision mechanism is developed in which the decision threshold can be self-adjusted during the iterative process. Such decision mechanism is particularly effective for decoding the majority-logic decodable codes; 3) only part of the variable nodes satisfying the pre-designed criterion are involved for the presented algorithm, which is in the proportionality-logic sense and can further reduce the computational complexity. Simulation results show that, when combined with factor correction techniques and appropriate proportionality parameter, the presented algorithm performs well and can achieve fast decoding convergence rate while maintaining relative low decoding complexity, especially for small quantized levels (3-4 bits). The presented algorithm provides a candidate for those application scenarios where the memory load and the energy consumption are extremely constrained.

Empirical Analysis on Exchange Rate Determination in Global Foreign Exchange Markets : The Case of 10 Major Countries (글로벌 외환시장의 환율 결정구조 분석에 관한 실증연구 : 주요 10개국을 중심으로)

  • Rhee, Hyun-Jae
    • International Area Studies Review
    • /
    • v.14 no.3
    • /
    • pp.221-246
    • /
    • 2010
  • The paper is basically attempted to reveal a mechanism of exchange rate determination in global foreign exchange markets. For a theoretical framework, uncovered interest rate parity(UIRP), covered interest rate parity(CIRP), and real interest rate parity(RIRP) are tentatively adapted, and GARCH-M model is employed for an econometric methodology. Empirical evidence shows that the UIRP is superior to others, and the RIRP is better than the CIRP in explaining how exchange rates are determined in global exchange markets. All of them, however, is not fully supported by economic theories. Following Frankel(1989), country premium, volatility premium, and currency premium are evaluated to see if which premium is a crucial in disturbing the RIRP, and it is found that country and currency premiums are a major components in disturbing the RIRP. To this end, market-oriented and market-determined systems has to be built to avoid currency disputes which is undergoing hot issue in global foreign exchange market.

XOR-based High Quality Information Hiding Technique Utilizing Self-Referencing Virtual Parity Bit (자기참조 가상 패리티 비트를 이용한 XOR기반의 고화질 정보은닉 기술)

  • Choi, YongSoo;Kim, HyoungJoong;Lee, DalHo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.156-163
    • /
    • 2012
  • Recently, Information Hiding Technology are becoming increasingly demanding in the field of international security, military and medical image This paper proposes data hiding technique utilizing parity checker for gray level image. many researches have been adopted LSB substitution and XOR operation in the field of steganography for the low complexity, high embedding capacity and high image quality. But, LSB substitution methods are not secure through it's naive mechanism even though it achieves high embedding capacity. Proposed method replaces LSB of each pixel with XOR(between the parity check bit of other 7 MSBs and 1 Secret bit) within one pixel. As a result, stego-image(that is, steganogram) doesn't result in high image degradation. Eavesdropper couldn't easily detect the message embedding. This approach is applying the concept of symmetric-key encryption protocol onto steganography. Furthermore, 1bit of symmetric-key is generated by the self-reference of each pixel. Proposed method provide more 25% embedding rate against existing XOR operation-based methods and show the effect of the reversal rate of LSB about 2% improvement.

A study on the mechanism for reduction of lead-induced toxicity in nervous system by aloe vera (Aloe vera의 연 유도성 신경계 독성 저감 기전에 관한 연구)

  • 정명규;곽영규
    • Journal of Environmental Health Sciences
    • /
    • v.22 no.3
    • /
    • pp.8-16
    • /
    • 1996
  • Effects of water extract of aloe vera on lead-induced neurotoxicity were investigated in sciatic nerve isolated from rat. The mechanism on toxicity reduction by measuring activities of axonal enzymes, metabolism of myo-inositol in nerve, lead concentration in several organs and so on were further examimed. In the lead-treated rats, the transport rate of axonal enzyme, such as acetyl cholinesterase and choline acetyltransferase, was reduced by from 50% to 30% respectively. Reduction in myo-inositol concentration and $Na^+/K^+$ ATPase activity were also observed in sciatic nerve from lead-treated rat. However, the aloe extract administration significantly eliminated the impairment and maintained myo-inositol concentration to about 85% of normal level. Also aloe extract promoted the excretion rate of lead which is accumulated in blood, sciatic nerve and kidney. These results suggest that lead-induced neurotoxicity was significantly reduced by administration of aloe extract and the mechanism might be partly increase in kidney excretion rate of lead and parity normalization of $Na^+/K^+$ ATPase activity which is critical factor in order to keep nerve maintaining normal myo-inositol level.

  • PDF

Design and Performance Evaluation of Software RAID for Video-on-Demand Servers (주문형 비디오 서버를 위한 소프트웨어 RAID의 설계 및 성능 분석)

  • Koh, Jeong-Gook
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.3 no.2
    • /
    • pp.167-178
    • /
    • 2000
  • Software RAID(Redundant Arrays of Inexpensive Disks) is defined as a storage system that provides capabilities of hardware RAID, and guarantees high reliability as well as high performance. In this paper, we propose an enhanced disk scheduling algorithm and a scheme to guarantee reliability of data. We also design and implement software RAID by utilizing these mechanism to develop a storage system for multimedia applications. Because the proposed algorithm improves a defect of traditional GSS algorithm that disk I/O requests arc served in a fixed order, it minimizes buffer consumption and reduces the number of deadline miss through service group exchange. Software RAID also alleviates data copy overhead during disk services by sharing kernel memory. Even though the implemented software RAID uses the parity approach to guarantee reliability of data, it adopts different data allocation scheme. Therefore, we reduce disk accesses in logical XOR operations to compute the new parity data on all write operations. In the performance evaluation experiments, we found that if we apply the proposed schemes to implement the Software RAID, it can be used as a storage system for small-sized video-on-demand servers.

  • PDF

A Message Transfer Scheme for Efficient Message Passing in the Highly Parallel Computer SPAX (고속병렬컴퓨터(SPAX)에서의 효율적인 메시지 전달을 위한 메시지 전송 기법)

  • 모상만;신상석;윤석한;임기욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.9
    • /
    • pp.1162-1170
    • /
    • 1995
  • In this paper, we present a message transfer scheme for efficient message passing in the hierarchically structured multiprocessor computer SPAX(Scalable Parallel Architecture computer based on X-bar network). The message transfer scheme provides interface not only with operating system but also with end users. In order to transfer two types of control message and data message efficiently, it supports both of memory-mapped transfer and DMA-based transfer. Dual-port RAMs are used as message buffers, and control and status registers provide efficient programming interface. Interlaced parity scheme is adopted for error control. If any error is detected at receiving node, errored packet is resent by sender according to retry mechanism. In conjunction with retry mechanism, watchdog timers are used to protect infinite waiting and repeated retry. The proposed message transfer scheme can be applied to input/output nodes and communication connection nodes as well as processing nodes in the SPAX.

  • PDF

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

Partial Preconditioning Approach for the Solution of Detailed Kinetics Problems Based on Sensitivity Analysis (효율적인 상세 반응 기구 해석을 위한 민감도 기반의 부분 음해법)

  • Kang, K.H.;Moon, S.Y.;Noh, J.H.;Won, S.H.;Choi, J.Y.
    • Journal of the Korean Society of Combustion
    • /
    • v.13 no.1
    • /
    • pp.17-22
    • /
    • 2008
  • A partly implicit/quasi-explicit method is introduced for the solution of detailed chemical kinetics with stiff source terms based on the standard fourth-order Runge-Kutta scheme. Present method solves implicitly only the stiff reaction rate equations, whereas the others explicitly. The stiff equations are selected based on the survey of the chemical Jaconian matrix and its Eigenvalues. As an application of the present method constant pressure combustion was analyzed by a detailed mechanism of hydrogen-air combustion with NOx chemistry. The sensitivity analysis reveals that only the 4 species in NOx chemistry has strong stiffness and should be solved implicitly among the 13 species. The implicit solution of the 4 species successfully predicts the entire process with same accuracy and efficiency at half the price.

  • PDF