Using Codes with Summation of Weighted Bits to Organize Checking of Combinational Logical Devices


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

This article analyzes the peculiarities of applying weighted sum codes in tasks of building logical device check circuits for weighing of bits via random weighting coefficients, with check bits limited in number by the number of check bits of classical Berger codes. Important regularities typical of weighted sum codes are discovered. Weighted codes belong to codes that detect unidirectional errors (UED codes). The presented technique of synthesizing weighted sum codes allows creating the simplest structures of these devices based on the standard circuits of full adders and half adders of units. The main properties of weighted sum codes via error detection in information vectors and in outputs of combinational check circuits are confirmed via experiment.

作者简介

D. Efanov

Russian University of Transport

编辑信件的主要联系方式.
Email: TrES-4b@yandex.ru
俄罗斯联邦, Moscow, 127994

V. Sapozhnikov

Emperor Alexander I Saint Petersburg State Transport University

Email: port.at.pgups@gmail.com
俄罗斯联邦, Saint Petersburg, 190031

Vl. Sapozhnikov

Emperor Alexander I Saint Petersburg State Transport University

编辑信件的主要联系方式.
Email: port.at.pgups@gmail.com
俄罗斯联邦, Saint Petersburg, 190031

补充文件

附件文件
动作
1. JATS XML

版权所有 © Allerton Press, Inc., 2019