Code Converters - BCD (8421) To - From Excess-3 - GeeksforGeeks

8/23/2020 Code Converters - BCD(8421) to/from Excess-3 - GeeksforGeeks
Code Converters – BCD(8421) to/from Excess-3

Last Updated: 25-11-2019
Prerequisite – Number System and base conversions
Excess-3 binary code is a unweighted self-complementary BCD code.

Self-Complementary property means that the 1’s complement of an excess-3 number is the
excess-3 code of the 9’s complement of the corresponding decimal number. This property is
useful since a decimal number can be nines’ complemented (for subtraction) as easily as a binary
number can be ones’ complemented; just by inverting all bits.
For example, the excess-3 code for 3(0011) is 0110 and to nd the excess-3 code of the
complement of 3, we just need to nd the 1’s complement of 0110 -> 1001, which is also the
excess-3 code for the 9’s complement of 3 -> (9-3) = 6.
Converting BCD(8421) to Excess-3 –
As is clear by the name, a BCD digit can be converted to it’s corresponding Excess-3 code by
simply adding 3 to it.
Let be the bits representing the binary numbers, where is the LSB
and is the MSB, and
Let be the bits representing the gray code of the binary numbers, where
is the LSB and is the MSB.
The truth table for the conversion is given below. The X’s mark don’t care conditions.
We use cookies to ensure you have the best browsing experience on our website. By using our site, you Got It !
acknowledge that you have read and understood our Cookie Policy & Privacy Policy
https://www.geeksforgeeks.org/code-converters-bcd8421-to-from-excess-3/ 1/9
To nd the corresponding digital circuit, we will use the K-Map technique for each of the Excess-3
code bits as output with all of the bits of the BCD number as input.
Corresponding minimized Boolean expressions for Excess-3 code bits –
The corresponding digital circuit-
Converting Excess-3 to BCD(8421) –

▲
Excess-3 code can be converted back to BCD in the same manner.
Let be the bits representing the binary numbers, where is the LSB
and is the MSB, and
Let be the bits representing the gray code of the binary numbers, where
is the LSB and is the MSB.
The truth table for the conversion is given below. The X’s mark don’t care conditions.
K-Map for D-
K-Map for C-
K-Map for B-
K-Map for A-
<img src="
Corresponding minimized boolean expressions for Excess-3 code bits –
The corresponding digital circuit –

Here correspond to and ▲
correspond to .
References-
Digital Design, 5th edition by Morris Mano and Michael Ciletti

Excess-3 – Wikipedia
This article is contributed by Chirag Manwani. If you like GeeksforGeeks and would like to
contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to
contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and
help other Geeks.
Please write comments if you nd anything incorrect, or you want to share more information about
the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA
Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
Code Converters - Binary to/from Gray Code
Need for Intermediate Code and Code Optimization
Three address code in Compiler
Code Optimization in Compiler Design
VHDL code for AND and OR Logic Gates
Hamming Code in Computer Network
Register Allocations in Code Generation
Introduction of Object Code in Compiler Design
Intermediate Code Generation in Compiler Design
Computer Organization | Locality and Cache friendly code
Compiler Design | Detection of a Loop in Three Address Code
Difference between Hierarchical, Network and Relational Data Model
Application of Syntax Directed Translation
Difference between Binary Semaphore and Mutex
Improved By : thesid01
Article Tags : Digital Electronics & Logic Design GATE CS

6
3.5
To-do Done
Based on 2 vote(s)
Feedback/ Suggest Improvement Improve Article
Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.
▲
Writing code inacknowledge
comment? that
Please
you use
haveide.geeksforgeeks.org,
read and understood ourgenerate link and
Cookie Policy sharePolicy
& Privacy the link here.
Load Comments
5th Floor, A-118,

 Sector-136, Noida, Uttar Pradesh - 201305
 feedback@geeksforgeeks.org
Company Learn
About Us Algorithms
Careers Data Structures
Privacy Policy Languages
Contact Us CS Subjects
Video Tutorials
Practice Contribute
Courses Write an Article
Company-wise Write Interview Experience
Topic-wise Internships
How to begin? Videos
@geeksforgeeks , Some rights reserved

Code Converters - BCD (8421) To - From Excess-3 - GeeksforGeeks

Uploaded by

Copyright:

Available Formats

Code Converters - BCD (8421) To - From Excess-3 - GeeksforGeeks

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Code Converters - BCD (8421) To - From Excess-3 - GeeksforGeeks

Uploaded by

Copyright:

Available Formats

8/23/2020 Code Converters - BCD(8421) to/from Excess-3 - GeeksforGeeks

Code Converters – BCD(8421) to/from Excess-3

Prerequisite – Number System and base conversions

Excess-3 binary code is a unweighted self-complementary BCD code.

Converting BCD(8421) to Excess-3 –

Corresponding minimized Boolean expressions for Excess-3 code bits –

The corresponding digital circuit-

Converting Excess-3 to BCD(8421) –

Corresponding minimized boolean expressions for Excess-3 code bits –

The corresponding digital circuit –

Digital Design, 5th edition by Morris Mano and Michael Ciletti

Article Tags : Digital Electronics & Logic Design GATE CS

Feedback/ Suggest Improvement Improve Article

5th Floor, A-118,

@geeksforgeeks , Some rights reserved

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.