Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Excess-3

From Wikipedia, the free encyclopedia
Variation to BCD-code where three (11) is added to a binary representation
"XS-3" redirects here. For the experimental aircraft, seeDouglas XS-3 Stiletto.
"Shifted binary" redirects here. For the general concept, seeOffset binary. For binary shifts, seeBit shifting.

Stibitz code
Digits4[1]
Tracks4[1]
Digit values8  4 −2 −1
Weight(s)1..3[1]
ContinuityNo[1]
CyclicNo[1]
Minimum distance1[1]
Maximum distance4
Redundancy0.7
Lexicography1[1]
Complement9[1]

Excess-3,3-excess[1][2][3] or10-excess-3binary code (often abbreviated asXS-3,[4]3XS[1] orX3[5][6]),shifted binary[7] orStibitz code[1][2][8][9] (afterGeorge Stibitz,[10] who built a relay-based adding machine in 1937[11][12]) is a self-complementarybinary-coded decimal (BCD) code andnumeral system. It is abiased representation. Excess-3 code was used on some older computers as well as in cash registers and hand-held portable electronic calculators of the 1970s, among other uses.

Representation

[edit]

Biased codes are a way to represent values with a balanced number of positive and negative numbers using a pre-specified numberN as a biasing value. Biased codes (andGray codes) are non-weighted codes. In excess-3 code, numbers are represented as decimal digits, and each digit is represented by fourbits as the digit value plus 3 (the "excess" amount):

  • The smallest binary number represents the smallest value (0 − excess).
  • The greatest binary number represents the largest value (2N+1 − excess − 1).
Excess-3, and Stibitz code
DecimalExcess-3StibitzBCD 8-4-2-1Binary3-of-6CCITT
extension[13][1]
4-of-8Hamming
extension[1]
00011001100000000100011
10100010000010001111011
20101010100100010100101
30110011000110011100110
40111011101000100001000
51000100001010101110111
61001100101100110101001
71010101001110111101010
81011101110001000000100
91100110010011001101100

To encode a number such as 127, one simply encodes each of the decimal digits as above, giving (0100, 0101, 1010).

Excess-3 arithmetic uses differentalgorithms than normal non-biased BCD or binarypositional system numbers. After adding two excess-3 digits, the raw sum is excess-6. For instance, after adding 1 (0100 in excess-3) and 2 (0101 in excess-3), the sum looks like 6 (1001 in excess-3) instead of 3 (0110 in excess-3). To correct this problem, after adding two digits, it is necessary to remove the extra bias by subtracting binary 0011 (decimal 3 in unbiased binary) if the resulting digit is less than decimal 10, or subtracting binary 1101 (decimal 13 in unbiased binary) if anoverflow (carry) has occurred. (In 4-bit binary, subtracting binary 1101 is equivalent to adding 0011 and vice versa.)[14]


Advantage

[edit]

The primary advantage of excess-3 coding over non-biased coding is that a decimal number can benines' complemented[1] (for subtraction) as easily as a binary number can beones' complemented: just by inverting all bits.[1] Also, when the sum of two excess-3 digits is greater than 9, the carry bit of a 4-bit adder will be set high. This works because, after adding two digits, an "excess" value of 6 results in the sum. Because a 4-bit integer can only hold values 0 to 15, an excess of 6 means that any sum over 9 will overflow (produce a carry-out).

Another advantage is that the codes 0000 and 1111 are not used for any digit. A fault in a memory or basic transmission line may result in these codes. It is also more difficult to write the zero pattern to magnetic media.[1][15][11]

Example

[edit]

BCD 8-4-2-1 to excess-3 converter example inVHDL:

entitybcd8421xs3isport(a:instd_logic;b:instd_logic;c:instd_logic;d:instd_logic;an:bufferstd_logic;bn:bufferstd_logic;cn:bufferstd_logic;dn:bufferstd_logic;w:outstd_logic;x:outstd_logic;y:outstd_logic;z:outstd_logic);endentitybcd8421xs3;architecturedataflowofbcd8421xs3isbeginan<=nota;bn<=notb;cn<=notc;dn<=notd;w<=(anandbandd)or(aandbnandcn)or(anandbandcanddn);x<=(anandbnandd)or(anandbnandcanddn)or(anandbandcnanddn)or(aandbnandcnandd);y<=(anandcnanddn)or(anandcandd)or(aandbnandcnanddn);z<=(ananddn)or(aandbnandcnanddn);endarchitecturedataflow;-- of bcd8421xs3

Extensions

[edit]
3-of-6 extension
Digits6[1]
Tracks6[1]
Weight(s)3[1]
ContinuityNo[1]
CyclicNo[1]
Minimum distance2[1]
Maximum distance6
Lexicography1[1]
Complement(9)[1]
4-of-8 extension
Digits8[1]
Tracks8[1]
Weight(s)4[1]
ContinuityNo[1]
CyclicNo[1]
Minimum distance4[1]
Maximum distance8
Lexicography1[1]
Complement9[1]
  • 3-of-6 code extension: The excess-3 code is sometimes also used for data transfer, then often expanded to a 6-bit code perCCITT GT 43 No. 1, where 3 out of 6 bits are set.[13][1]
  • 4-of-8 code extension: As an alternative to theIBMtransceiver code[16] (which is a 4-of-8 code with aHamming distance of 2),[1] it is also possible to define a 4-of-8 excess-3 code extension achieving a Hamming distance of 4, if only denary digits are to be transferred.[1]

See also

[edit]

References

[edit]
  1. ^abcdefghijklmnopqrstuvwxyzaaabacadaeafagahaiSteinbuch, Karl W., ed. (1962). Written at Karlsruhe, Germany.Taschenbuch der Nachrichtenverarbeitung (in German) (1 ed.). Berlin / Göttingen / New York:Springer-Verlag OHG. pp. 71–73,1081–1082.LCCN 62-14511.
  2. ^abSteinbuch, Karl W.; Weber, Wolfgang; Heinemann, Traute, eds. (1974) [1967].Taschenbuch der Informatik – Band II – Struktur und Programmierung von EDV-Systemen (in German). Vol. 2 (3 ed.). Berlin, Germany:Springer Verlag. pp. 98–100.ISBN 3-540-06241-6.LCCN 73-80607.{{cite book}}:|work= ignored (help)
  3. ^Richards, Richard Kohler (1955).Arithmetic Operations in Digital Computers. New York, USA:van Nostrand. p. 182.
  4. ^Kautz, William H. (June 1954)."Optimized Data Encoding for Digital Computers".Convention Record of the I.R.E. 1954 National Convention, Part 4: Electronic Computers and Information Technology.2. Stanford Research Institute, Stanford, California, USA:The Institute of Radio Engineers, Inc.:47–57. Session 19: Information Theory III - Speed and Computation. Retrieved2020-05-22. (11 pages)
  5. ^Schmid, Hermann (1974).Decimal Computation (1 ed.). Binghamton, New York, USA:John Wiley & Sons, Inc. p. 11.ISBN 0-471-76180-X. Retrieved2016-01-03.
  6. ^Schmid, Hermann (1983) [1974].Decimal Computation (1 (reprint) ed.). Malabar, Florida, USA: Robert E. Krieger Publishing Company. p. 11.ISBN 0-89874-318-4. Retrieved2016-01-03. (NB. At least some batches of this reprint edition weremisprints with defective pages 115–146.)
  7. ^Stibitz, George Robert; Larrivee, Jules A. (1957). Written at Underhill, Vermont, USA.Mathematics and Computers (1 ed.). New York, USA / Toronto, Canada / London, UK:McGraw-Hill Book Company, Inc. p. 105.LCCN 56-10331. (10+228 pages)
  8. ^Dokter, Folkert; Steinhauer, Jürgen (1973-06-18).Digital Electronics. Philips Technical Library (PTL) / Macmillan Education (Reprint of 1st English ed.). Eindhoven, Netherlands:The Macmillan Press Ltd. /N. V. Philips' Gloeilampenfabrieken. pp. 42, 44.doi:10.1007/978-1-349-01417-0.ISBN 978-1-349-01419-4.SBN 333-13360-9. Retrieved2018-07-01.[permanent dead link] (270 pages) (NB. This is based on a translation of volume I of the two-volume German edition.)
  9. ^Dokter, Folkert; Steinhauer, Jürgen (1975) [1969].Digitale Elektronik in der Meßtechnik und Datenverarbeitung: Theoretische Grundlagen und Schaltungstechnik. Philips Fachbücher (in German). Vol. I (improved and extended 5th ed.). Hamburg, Germany:Deutsche Philips GmbH. pp. 48, 51, 53, 58, 61, 73.ISBN 3-87145-272-6. (xii+327+3 pages) (NB. The German edition of volume I was published in 1969, 1971, two editions in 1972, and 1975. Volume II was published in 1970, 1972, 1973, and 1975.)
  10. ^Stibitz, George Robert (1954-02-09) [1941-04-19]."Complex Computer". Patent US2668661A. Retrieved2020-05-24.[1] (102 pages)
  11. ^abMietke, Detlef (2017) [2015]."Binäre Codices".Informations- und Kommunikationstechnik (in German). Berlin, Germany. Exzeß-3-Code mit Additions- und Subtraktionsverfahren.Archived from the original on 2017-04-25. Retrieved2017-04-25.
  12. ^Ritchie, David (1986).The Computer Pioneers. New York, USA:Simon and Schuster. p. 35.ISBN 067152397X.
  13. ^abComité Consultatif International Téléphonique et Télégraphique (CCITT), Groupe de Travail 43 (1959-06-03).Contribution No. 1. CCITT, GT 43 No. 1.{{cite book}}: CS1 maint: numeric names: authors list (link)
  14. ^Hayes, John P. (1978).Computer Architecture and Organization. McGraw-Hill International Book Company. p. 156.ISBN 0-07-027363-4.
  15. ^Bashe, Charles J.; Jackson, Peter Ward; Mussell, Howard A.; Winger, Wayne David (January 1956). "The Design of the IBM Type 702 System".Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.74 (6):695–704.doi:10.1109/TCE.1956.6372444.S2CID 51666209. Paper No. 55-719.
  16. ^IBM (July 1957).65 Data Transceiver / 66 Printing Data Receiver.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Excess-3&oldid=1252687289"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp