No label defined (Q3329401)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3861075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3861075 |
Statements
1984
0 references
Optimal binary coding of decimal numbers
0 references
hardware
0 references
realization of arithmetic operations
0 references
weighted binary coding
0 references
negative weights
0 references
logic equations
0 references
0.7103128433227539
0 references
0.7064462900161743
0 references
0.7064459919929504
0 references
[For the entire collection see Zbl 0537.00023.] Optimal binary coding of decimal numbers is studied with respect to minimum cost for hardware and time for the realization of arithmetic operations over n-digit decimal numbers. Using weighted binary coding involving negative weights, \(a_ i=\sum^{4}_{j=1}a_{ij}g_ j,\) where \(a_ i\) is a decimal representation and the \(a_{ij}\) are binary representations, there exist 13 self-complementary codes with one negative weight. Further restrictions lead to the investigation of two such codes only, namely 631-1 and 64-21. These codes are analysed and compared with each other and with positively weighted codes, especially with respect to the corresponding logic equations. It is shown that the code 64-21 is practically equivalent to the standard code 8421 with respect to all characteristics.
0 references