Abstract
An example is given of a static BCD to binary code convertor with 4 decades input and 14 binary outputs. It is shown that the table look-up principle leads to a ROM with about 140 k bits, and that the use of smaller ROMS becomes complicated, leading to many circuits in cascade and a rather long delay. The cellular array of adders is described and some simplifications are discussed. By taking into account “don't happen” situations, using a tree structure a circuit as simple as possible (half adders and OR gates as a replacement for full adders) an economical and quick solution is found.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
