Simplified logical conversion of binary integers to binary coded decimal

By simplifying the logic conversion process and adding multiplier stages, the problem of large number of logic gates and low performance in the binary integer to binary coded decimal conversion in the prior art is solved, and more efficient conversion efficiency is achieved.

CN119013899APending Publication Date: 2024-11-22INTERNATIONAL BUSINESS MACHINE CORPORATION
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202380029797.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2022-03-25
Filing Date
2023-03-21
Publication Date
2024-11-22

AI Technical Summary

Technical Problem

When converting binary integers into binary coded decimal, the number of logic gates is large and the performance is low, resulting in low conversion efficiency.

Method used

By simplifying the logic conversion process, using multiple multiplier stages and carry logic, reducing the number of logic gates, increasing the number of doubling operations per clock cycle, and implementing binary integers using the intermediate format and logic flow described in Figures 1 and 4. Simplified logical conversion to binary encoded decimal.

Benefits of technology

The number of logic gates is reduced, the number of doubling operations per clock cycle is increased, the performance of the computing system is improved, and the conversion efficiency is improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119013899A_ABST
    Figure CN119013899A_ABST
Patent Text Reader

Abstract

Simplified logical conversion of binary integers to binary coded decimal, including: generating from an input binary integer an intermediate value including all zero digits coded in an intermediate format (802); until each bit of the input binary integer is shifted into the intermediate value: shifting the bits of the input binary integer into the intermediate value (804); doubling (806) the intermediate value; converting the intermediate value into a binary coded decimal output (104); and wherein, for each number of the intermediate value, the intermediate format comprises a plurality of bits corresponding to a plurality of even weights, a first bit corresponding to a weight, and a second bit corresponding to an inverse of the weight (808).
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to data processing, or more particularly, to methods, apparatus and products for simplified logical conversion of binary integers to binary coded decimal. Background Art

[0002] The development of the EDVAC computer system in 1948 is often considered the beginning of the computer age. Since then, computer systems have evolved into extremely complex devices. Today's computers are much more complex than earlier systems (such as the EDVAC). Computer systems typically include a combination of hardware and software components, application programs, operating systems, processors, buses, memory, input / output devices, etc. As advances in semiconductor processing and computer architecture have driven computers to higher and higher performance, more complex computer software has been developed to take advantage of the higher performance of the hardware, resulting in today's computer systems being much more powerful than just a few years ago.

[0003] In programming languages ​​such as COBOL, numbers can be encoded in various formats such as hexadecimal, binary integers, and binary coded decimal. Some operations require converting numbers from one format to another. As an example, a binary integer can be converted to binary coded decimal in order to be displayed in a human-readable format. Summary of the invention

[0004] The foregoing and other objects, features and advantages of the invention will become apparent from the following more particular description of exemplary embodiments of the invention as illustrated in the accompanying drawings, wherein like reference numerals generally refer to like parts of exemplary embodiments of the invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0005] Figure 1 A block diagram illustrating an example logic flow for a simplified logic conversion of a binary integer to binary coded decimal according to some embodiments of the present disclosure.

[0006] Figure 2 A table showing an intermediate numeric encoding format for converting a binary integer to binary coded decimal according to an embodiment known in the art.

[0007] Figure 3A A multiplexer for converting a binary integer to binary coded decimal is shown according to embodiments known in the art.

[0008] Figure 3B Multiplier logic for converting a binary integer to binary coded decimal is shown according to embodiments known in the art.

[0009] Figure 4A table showing an intermediate digital encoding format for simplified logical conversion of a binary integer to binary coded decimal according to some embodiments of the present disclosure is shown.

[0010] Figure 5 is an exemplary multiplier logic for simplified logic conversion of binary integers to binary coded decimal according to some embodiments of the present invention.

[0011] Fig. 6A is an example carrier logic for simplified logical conversion of a binary integer to binary coded decimal according to some embodiments of the present disclosure.

[0012] Figure 6B is an exemplary inverse carrier logic for simplified logical conversion of a binary integer to binary coded decimal according to some embodiments of the present disclosure.

[0013] Figure 7 A block diagram of an example computer for simplified logical conversion of binary integers to binary coded decimal is shown in accordance with some embodiments of the present disclosure.

[0014] Figure 8 A flow chart illustrating an example method for simplified logical conversion of a binary integer to binary coded decimal according to some embodiments of the present disclosure is shown. DETAILED DESCRIPTION

[0015] In programming languages ​​such as COBOL, numbers can be encoded in various formats such as hexadecimal, binary integers, and binary coded decimal. Some operations require converting numbers from one format to another. As an example, a binary integer can be converted to binary coded decimal in order to be displayed in a human-readable format.

[0016] For this reason, from Figure 1 Initially, exemplary methods, apparatus, and products for converting binary integer reduced logic to binary coded decimal according to the present invention are described with reference to the accompanying drawings. Figure 1 An example process flow for simplified logical conversion of a binary integer to binary coded decimal according to some embodiments of the present disclosure is shown. Figure 1 The exemplary processing flow of can be implemented in a chip or other semiconductor device, for example. Such a chip or semiconductor device can be included in a device or apparatus such as a server, a personal computer, a mobile device, a set-top box, etc.

[0017] like Figure 1As shown, an input 102 encoded as a binary integer is converted to an output 104 encoded as a binary coded decimal value. Therefore, the input 102 includes a plurality of bits, where each bit corresponds to a particular power of 2. In other words, for an n-bit binary integer, each bit corresponds to a power of 2. n-1 To 2 0 Since the output 104 is a binary coded decimal value, the output 104 includes a plurality of digits, each of which is represented using the binary encoding of the digits 0 to 9. In other words, each digit of the output 104 can be represented using at least four bits for encoding the corresponding 0 to 9 digits.

[0018] To convert the input 102 binary integer into a binary coded decimal output 104, an intermediate value 106 is generated. The intermediate value 106 includes a plurality of digits, each of which is equal to 0. Each digit in the intermediate value 106 is encoded using a plurality of bits and using an intermediate format that will be described in further detail below. As shown, Figure 1 The logic flow of 108a-n includes a plurality of multiplier stages 108a-n. At each multiplier stage, the most significant bit of the input 102 is shifted into the intermediate value 106. That is, the bits of the intermediate value 106 are shifted left, and the most significant bit of the input 102 that remains to be shifted in is appended to the intermediate value 106 as the least significant bit. Then, as shown in the multiplication stages 108a-n, the intermediate value 106 is doubled. Since the logic flow includes a plurality of multiplier stages 108a-n, the shifting of the bits of the input 102 and the doubling of the intermediate value 106 can be performed multiple times in the same clock cycle.

[0019] The bits from the input 102 are shifted into the intermediate value 106, and for each bit in the input 102, the intermediate value 106 is doubled until each bit of the input 102 is shifted into the intermediate value 106 and the doubling operation is performed. Each digit of the resulting intermediate value 106 is then converted into a corresponding binary coded decimal digit of the output 104.

[0020] Existing solutions for converting a binary integer to a binary coded decimal value use something like Figure 1 , whereby bits are repeatedly shifted to an intermediate value 106, and the intermediate value 106 is doubled and finally converted to a binary coded decimal output 104. In contrast to the embodiments of the present invention, Figure 2 The intermediate format of the existing solution is described in Table 200. The first column of Table 200 shows each possible binary coded number 0 to 9. In the second column, the decimal encoding of the binary code of each number is shown for reference.

[0021] The third column of Table 200 shows the encoding of each number in the previous intermediate format using the existing solution. In the existing intermediate format, each number is encoded using 6 bits. Each of the five most significant bits of the previous intermediate format corresponds to a specific even-numbered weight, arranged in descending order from 8 to 0. The sixth most significant bit corresponds to a weight of 1. In order to calculate a specific number, the weights whose corresponding bits are set to 1 are added together. As an example, in order to calculate the number 3, the bits of weights 2 and 1 are set. As another example, in order to calculate the number 7, the bits of weights 6 and 1 are set. Using the previous intermediate format, at least one of the five most significant bits corresponding to the even-numbered weights must be set to 1. Therefore, a bit of 0 weight is set for the encoding of the number 0, and 0 and 1 weights are set for the encoding of the number 1.

[0022] The fourth column of table 200 shows the doubling encoding of the corresponding digits using the previous intermediate format. For example, for the digit 3, the fourth column shows the encoding for the doubled value 6. Although not shown, the doubling of the digits 5 to 9 will result in a carry bit that will be added to the adjacent more significant digit. It is clear from table 200 that each bit value of the doubled digits of weights 8 to 2 can be represented by selecting one of a pair of bit values ​​from the original encoding under the previous intermediate format, and the selection is based on the value of the bit with a weight of 1. This is the use of Figure 3A 300 is shown, where any bit value X of the doubled number can be determined by selecting bit value A or bit value B from the non-doubled number based on a selection bit S, where S corresponds to a bit value of 1 weight.

[0023] As an example, for any doubled digit, the 8-weighted bit value may be selected to be either the 4-weighted or 8-weighted bit value from the undoubled digit, which is selected based on the 1-weighted bit value. Figure 3A , a bit value X may correspond to a weight of 8 for the doubled number, a bit value A may correspond to a weight of 8 for the undoubled number, a bit value B may correspond to a weight of 4 for the undoubled number, and a bit value S may correspond to a weight of 1 for the undoubled number. As another example, for any doubled bit, a bit value of 6 weight may be selected as a bit value of 2 weight or 8 weight from the undoubled number, which is selected based on the bit value of 1 weight. In other words, according to Figure 3A , bit value X may correspond to a weight of 6 for a doubled number, bit value A may correspond to a weight of 2 for an undoubled number, bit value B may correspond to a weight of 8 for an undoubled number, and bit value S may correspond to a weight of 1 for an undoubled number.

[0024] Figure 3A The multiplexer 300 can be used Figure 3B The multiplier logic 350 is implemented as Figure 3B As shown, the undoubled digital bit values ​​A and S are provided to a first AND gate. The undoubled digital bit value B and the output of an inverter that accepts the undoubled digital bit value of S as input are provided to a second AND gate. The output of the AND gate is then provided to an OR gate to generate a doubled digital bit value X. Those skilled in the art will appreciate that a chip or device implementing the multiplier logic 350 may include a plurality of multiplier logics 350, each corresponding to a particular bit of the intermediate value being doubled.

[0025] and Figure 2 , 3A Compared with the existing solution shown in 3B, using Figure 1 The logical flow and Figure 4 The intermediate format described in Table 400 of 200 is used to implement a simplified logical conversion of binary integers to binary coded decimal. The intermediate format of Table 400 is similar to the previous intermediate format of Table 200, except that the intermediate format of Table 400 uses an additional seventh bit for each digit. The 7th bit (e.g., the least significant bit) of each digit encodes the inverse of the bit value of the 1 weight. The doubled digits of the intermediate format are shown in the fourth column of Table 200. The fifth and sixth columns show the values ​​of the carry and inverse carry bits used for the doubling operation, which can be combined into more effective adjacent digits during the doubling process.

[0026] Further with Figure 2 , 3A In contrast to the existing solution shown in 3B, it is possible to use Figure 5 The multiplier logic 500 is used to represent the bit value of the doubled digital weight 8 to 2. Here, instead of passing the bit value S (e.g., the bit value of the weight of 1) through an inverter before being provided to the AND gate, the bit value of the inverse S weight (e.g., the bit value of the inverse of the weight of 1) is directly provided to the AND gate. Therefore, fewer logic gates are required to perform the doubling operation for the intermediate value, thereby allowing more doubling operations to be performed per clock cycle, thereby improving performance. It will be appreciated by those skilled in the art that a chip or device implementing the multiplier logic 500 may include multiple multiplier logics 500, each corresponding to a specific bit of the intermediate value 106 being doubled.

[0027] Fig. 6A Shows that when Figure 4 Carry logic 600 for calculating the value of the carry bit when a doubling operation is performed on a number encoded in the intermediate format of . Here, the bit values ​​of 8 weight and 6 weight are provided to the OR gate. The bit values ​​of 4 weight and 1 weight are provided to the AND gate, and the output of the AND gate is also provided to the OR gate. The output of the OR gate is the value of the carry bit of the number being doubled.

[0028] Figure 6B Shows that when Figure 4 The inverse carry logic 650 is used to calculate the value of the inverse carry bit when performing a doubling operation on a number encoded in the intermediate format of . Here, the bit values ​​of 0 and 2 weights are provided to the OR gate. The bit values ​​of 4 weights and inverse 1 weights are provided to the AND gate, and the output of the AND gate is also provided to the OR gate. The output of the OR gate is the value of the inverse carry bit of the number being doubled.

[0029] The simplified logical conversion of binary integers to binary coded decimal according to the present application is usually implemented using a computer (i.e., using an automatic computing machine). Therefore, for further explanation, Figure 7 A block diagram of computing machinery is shown including an exemplary computer 700 configured to perform a binary integer reduction logic conversion to binary coded decimal according to certain embodiments. Figure 7 The computer 700 includes at least one computer processor 702 or “CPU” and random access memory 704 (“RAM”) connected to the processor 702 and the other components of the computer 700 via a high-speed memory bus 706 and a bus adapter 708 .

[0030] Stored in RAM 704 is an operating system 710. Operating systems useful in computers configured for simplified logical conversion of binary integers to binary coded decimal according to some embodiments include UNIX TM , Linux TM , Microsoft Windows TM And other operating systems that will occur to those skilled in the art. Figure 7 Operating system 710 in the example of FIG. 7 is shown in RAM 704 , but many components of such software are also typically stored in non-volatile memory, for example on data storage 712 such as a disk drive.

[0031] Figure 7The computer 700 includes a disk drive adapter 716, which is coupled to the processor 702 and other components of the computer 700 through an expansion bus 718 and a bus adapter 708. The disk drive adapter 716 connects non-volatile data storage to the computer 700 in the form of data storage 712. According to certain embodiments, disk drive adapters useful in computers configured for simplified logical conversion of binary integers to binary coded decimal include integrated drive electronics ("IDE") adapters, small computer system interface ("SCSI") adapters, and other adapters that will occur to those skilled in the art. In some embodiments, the non-volatile computer memory is implemented as an optical disk drive, an electrically erasable programmable read-only memory (so-called "EEPROM" or "flash memory"), a RAM drive, etc., as will occur to those skilled in the art.

[0032] Figure 7 The example computer 700 includes one or more input / output ("I / O") adapters 720. The I / O adapters implement user-oriented input / output through, for example, software drivers and computer hardware to control output to a display device such as a computer display screen, and user input from user input devices 722 such as a keyboard and mouse. Figure 7 The example computer 700 includes a video adapter 724, which is an example of an I / O adapter specifically designed to output graphics to a display device 726, such as a display screen or computer monitor. Video adapter 724 is connected to processor 702 through a high-speed video bus 728, bus adapter 708, and front-side bus 730, which is also a high-speed bus.

[0033] Figure 7 The exemplary computer 700 includes a communication adapter 732 for data communications with other computers and for data communications with a data communications network. Such data communications are performed serially via an RS-232 connection, via an external bus such as a universal serial bus ("USB"), via a data communications network such as an IP data communications network, and / or in other ways that will occur to those skilled in the art. The communication adapter implements the hardware level of data communications by which one computer sends data communications to another computer directly or via a data communications network. Examples of communication adapters useful in computers configured for simplified logical conversion of binary integers to binary coded decimals according to certain embodiments include modems for wired dial-up communications, Ethernet (IEEE 802.3) adapters for wired data communications, and 802.11 adapters for wireless data communications.

[0034] To further illustrate, Figure 8A flow chart illustrating an example method for simplified logical conversion of a binary integer to binary coded decimal according to some embodiments of the present disclosure is shown. Figure 8 The method may be performed, for example, in chip 800 or another semiconductor device, as may be appreciated. Figure 8 The method may also be performed in a device or apparatus such as a computing device as described herein including the chip 800 or a semiconductor device.

[0035] Figure 8 The method includes generating 802 an intermediate value 106 from an input binary integer (shown as input 102) including all zero digits encoded using an intermediate format. The intermediate format includes Figure 4 The intermediate format described in Table 400 of 106 includes a bit for inverse one weight as the least significant bit in each digit. Each digit of the intermediate value 106 is initially encoded as a zero digit using this intermediate format.

[0036] Figure 8 The method includes shifting 804 bits of an input binary integer (e.g., input 102) into an intermediate value 106. That is, the bits of intermediate value 106 are shifted left by 1, and the most significant bit of input 102 that remains to be shifted in is appended to intermediate value 106 as the least significant bit.

[0037] Figure 8 The method also includes doubling 806 the intermediate value 106. Thus, each digit of the intermediate value 106 is doubled to generate a new intermediate value 106. In some embodiments, doubling 806 the intermediate value 106 includes providing 808 (e.g., for each digit of the intermediate value 106), each multiplier logic 500 in the plurality of multiplier logics 500, a pair of bit values ​​in the plurality of bits (e.g., for each digit), a first bit value corresponding to a weight, and a second bit value corresponding to an inverse of the weight.

[0038] For example, each digit of the doubled intermediate value 106 may correspond to a plurality of multiplier logics 500, wherein each multiplier logic 500 is configured to calculate a bit value of weight 8 to 2 in the doubled digit. Thus, each multiplier logic 500 accepts as input a pair of bit values ​​from the undoubled digit used to calculate a particular bit value of the doubled digit. Each multiplier logic 500 also accepts as input a weighted and anti-weighted bit value from the undoubled digit.

[0039] In some embodiments, doubling 806 the intermediate value 106 further includes calculating 809 a carry bit and an inverse carry bit for each digit of the intermediate value 106 (e.g., using Fig. 6A The carry logic 600 and Figure 6BThen, as part of the doubling operation, the carry bit and the anti-carry bit of a given doubled number may be combined with the doubled number of an adjacent more significant doubled number.

[0040] At step 810, it is determined whether there are more bits of the input binary integer (e.g., input 102) to be shifted in. If so, the process returns to shifting 804 the bits of the input binary integer into the intermediate value 804. Otherwise, once all bits have been shifted in, the intermediate value 106 is converted 812 to a binary coded decimal output 104. That is, each digit of the intermediate value 106 encoded using the intermediate format is converted to a corresponding binary coded decimal. Then, an action may be performed on the output 104, for example, to display the output 104 or to perform other operations.

[0041] In view of the above description, the reader can recognize that the benefits of the simplified logic conversion of binary integers to binary coded decimal according to embodiments of the present invention include improving the performance of the computing system by reducing the number of logic gates required to convert the binary integer to binary coded decimal, increasing the number of multiplier stages executed per cycle, and improving performance.

[0042] Exemplary embodiments of the present invention are described primarily in the context of a fully functional computer system for simplified logical conversion of binary integers to binary coded decimals. However, those skilled in the art will recognize that the present invention may also be embodied in a computer program product that is arranged on a computer-readable storage medium for use with any appropriate data processing system. The computer-readable storage medium may be any storage medium for machine-readable information, including magnetic media, optical media, or other suitable media. Examples of such media include magnetic or floppy disks in hard drives, optical disks for optical drives, tapes, and other media that may occur to those skilled in the art. Those skilled in the art may immediately recognize that any computer system with appropriate programming means will be able to perform the steps of the method of the present invention as embodied in a computer program product. Those skilled in the art may also recognize that, although some exemplary embodiments described in this specification are oriented to software installed and executed on computer hardware, alternative embodiments implemented as firmware or hardware are also within the scope of the present invention.

[0043] The present invention may be a system, method and / or computer program product. The computer program product may include a computer-readable storage medium (or multiple media) having computer-readable program instructions thereon, the computer-readable program instructions being used to cause a processor to perform various aspects of the present invention.

[0044] A computer-readable storage medium may be a tangible device capable of retaining and storing instructions used by an instruction execution device. A computer-readable storage medium may be, for example, but not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of computer-readable storage media includes the following: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanical encoding device such as a punch card or a raised structure in a groove with instructions recorded thereon, and any suitable combination of the foregoing. As used herein, a computer-readable storage medium should not be interpreted as a temporary signal itself, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagated by a waveguide or other transmission medium (e.g., a light pulse by an optical fiber cable), or an electrical signal transmitted by a wire.

[0045] The computer-readable program instructions described herein can be downloaded from a computer-readable storage medium to a corresponding computing / processing device, or downloaded to an external computer or external storage device via a network (e.g., the Internet, a local area network, a wide area network, and / or a wireless network). The network can include copper transmission cables, optical transmission fibers, wireless transmissions, routers, firewalls, switches, gateway computers, and / or edge servers. The network adapter card or network interface in each computing / processing device receives the computer-readable program instructions from the network and forwards the computer-readable program instructions to be stored in a computer-readable storage medium in the corresponding computing / processing device.

[0046] The computer-readable program instructions for performing the operation of the present invention can be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages, including object-oriented programming languages ​​(such as Smalltalk, C++, etc.) and conventional procedural programming languages ​​(such as "C" programming language or similar programming languages). The computer-readable program instructions can be executed completely on the user's computer, partially on the user's computer, executed as an independent software package, partially on the user's computer and partially on a remote computer, or completely on a remote computer or server. In the latter case, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (for example, using an Internet service provider through the Internet). In some embodiments, in order to perform various aspects of the present invention, the electronic circuit including, for example, a programmable logic circuit, a field programmable gate array (FPGA) or a programmable logic array (PLA) can execute the computer-readable program instructions by utilizing the state information of the computer-readable program instructions to personalize the electronic circuit.

[0047] Various aspects of the present invention are described herein with reference to the flow chart and / or block diagram of the method, device (system) and computer program product according to embodiments of the present invention. It will be understood that each frame of the flow chart and / or block diagram and the combination of frames in the flow chart and / or block diagram can be implemented by computer-readable program instructions.

[0048] These computer-readable program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device create a device for implementing the functions / actions specified in one or more boxes of the flowchart and / or block diagram. These computer-readable program instructions can also be stored in a computer-readable storage medium, which can guide the computer, programmable data processing device, and / or other equipment to work in a specific manner, so that the computer-readable storage medium having the instructions stored therein includes an article of manufacture, which includes instructions for implementing various aspects of the functions / actions specified in one or more boxes of the flowchart and / or block diagram.

[0049] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device, so that a series of operational steps are performed on the computer, other programmable apparatus, or other device to produce a computer-implemented process, so that the instructions executed on the computer, other programmable apparatus, or other device implement the functions / actions specified in one or more boxes of the flowchart and / or block diagram.

[0050] Flowchart and block diagram in the accompanying drawings show the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention.In this regard, each frame in flow chart or block diagram can represent the module, segment or part of instruction, and it comprises one or more executable instructions for realizing the logical function of appointment.In some alternative embodiments, the function mentioned in the frame may not occur in the order mentioned in the figure.For example, two frames shown continuously can actually be performed substantially at the same time, or these frames can sometimes be performed in reverse order, depending on the function involved.It will also be noted that the combination of the frame in each frame of block diagram and / or flow chart illustration and block diagram and / or flow chart illustration can be realized by the dedicated hardware-based system of performing a specified function or action or performing a combination of special hardware and computer instruction.

[0051] It will be appreciated from the foregoing description that the various embodiments of the present invention may be modified and altered without departing from the true spirit of the present invention. The descriptions in this specification are for illustrative purposes only and should not be construed as limiting. The scope of the present invention is limited only by the language of the appended claims.

Claims

1. A method for simplified logical conversion of a binary integer to a binary coded decimal, the method comprising: generating an intermediate value from an input binary integer including all zero digits encoded in an intermediate format; Until every bit of the input binary integer is shifted into the intermediate value: shifting bits of the input binary integer into the intermediate value; doubling the intermediate value; converting the intermediate value to a binary coded decimal output; as well as Wherein, for each digit of the intermediate value, the intermediate format includes a plurality of bits corresponding to a plurality of even weights, a first bit corresponding to a weight, and a second bit corresponding to an inverse of the weight.

2. The method according to claim 1, wherein: Shifting the bits of the input binary integer and doubling the intermediate value are performed multiple times within the same clock cycle.

3. The method according to claim 1, wherein: The plurality of even weights include eight weights, six weights, four weights, two weights, and zero weights.

4. The method according to claim 1, wherein: Each bit of the plurality of bits corresponds to a multiplier logic of a plurality of multiplier logics, and wherein doubling the intermediate value comprises providing a pair of bit values ​​of the plurality of bits, the value of the first bit and the value of the second bit, to each multiplier logic of the plurality of multiplier logics.

5. The method according to claim 1, wherein: Each multiplier logic consists of: a first AND gate receiving as input a first bit value from the pair of bit values ​​and a value of the first bit; a second AND gate that accepts as input a second bit value from the pair of bit values ​​and a value of the second bit; and An OR gate accepts as inputs the output from the first AND gate and the output from the second AND gate.

6. The method according to claim 1, wherein: Doubling the intermediate value further includes calculating a carry bit and an anti-carry bit for each digit of the intermediate value.

7. The method according to claim 6, wherein: The value of the first bit and the value of the second bit of a given number correspond to the carry bit and the anti-carry bit of an adjacent number.

8. A chip for simplified logic conversion of binary integers to binary coded decimal, comprising: generating an intermediate value from an input binary integer including all zero digits encoded in an intermediate format; Until every bit of the input binary integer is shifted into the intermediate value: shifting bits of the input binary integer into the intermediate value; doubling the intermediate value; converting the intermediate value to a binary coded decimal output; as well as Wherein, for each digit of the intermediate value, the intermediate format includes a plurality of bits corresponding to a plurality of even weights, a first bit corresponding to a weight, and a second bit corresponding to an inverse of the weight.

9. The chip according to claim 8, wherein: Shifting the bits of the input binary integer and doubling the intermediate value are performed multiple times within the same clock cycle.

10. The chip according to claim 8, wherein: The plurality of even weights include eight weights, six weights, four weights, two weights, and zero weights.

11. The chip according to claim 8, wherein: Each bit of the plurality of bits corresponds to a multiplier logic of a plurality of multiplier logics, and wherein doubling the intermediate value comprises providing a pair of bit values ​​of the plurality of bits, the value of the first bit and the value of the second bit, to each multiplier logic of the plurality of multiplier logics.

12. The chip according to claim 11, wherein: Each multiplier logic consists of: a first AND gate receiving as input a first bit value from the pair of bit values ​​and a value of the first bit; a second AND gate that accepts as input a second bit value from the pair of bit values ​​and a value of the second bit; and An OR gate accepts as inputs the output from the first AND gate and the output from the second AND gate.

13. The chip according to claim 8, wherein: Doubling the intermediate value further includes calculating a carry bit and an anti-carry bit for each digit of the intermediate value.

14. The chip according to claim 13, wherein: The value of the first bit and the value of the second bit of a given number correspond to the carry bit and the anti-carry bit of an adjacent number.

15. An apparatus for simplified logical conversion of binary integers to binary coded decimal, comprising: generating an intermediate value from an input binary integer including all zero digits encoded in an intermediate format; Until every bit of the input binary integer is shifted into the intermediate value: shifting bits of the input binary integer into the intermediate value; doubling the intermediate value; converting the intermediate value to a binary coded decimal output; as well as Wherein, for each digit of the intermediate value, the intermediate format includes a plurality of bits corresponding to a plurality of even weights, a first bit corresponding to a weight, and a second bit corresponding to an inverse of the weight.

16. The device according to claim 15, wherein: Shifting the bits of the input binary integer and doubling the intermediate value are performed multiple times within the same clock cycle.

17. The device according to claim 15, wherein: The plurality of even weights include eight weights, six weights, four weights, two weights, and zero weights.

18. The device according to claim 15, wherein: Each bit of the plurality of bits corresponds to a multiplier logic of a plurality of multiplier logics, and wherein doubling the intermediate value comprises providing a pair of bit values ​​of the plurality of bits, the value of the first bit and the value of the second bit, to each multiplier logic of the plurality of multiplier logics.

19. The device according to claim 18, wherein: Each multiplier logic consists of: a first AND gate receiving as input a first bit value from the pair of bit values ​​and a value of the first bit; a second AND gate that accepts as input a second bit value from the pair of bit values ​​and a value of the second bit; and An OR gate accepts as inputs the output from the first AND gate and the output from the second AND gate.

20. The device according to claim 15, wherein: Doubling the intermediate value further includes calculating a carry bit and an anti-carry bit for each digit of the intermediate value.