论文部分内容阅读
通常对BCD基数进行计算的最方便的方法是将BCD输入变换成二进制数,按正常的二进制数格式进行计算,然后把这二进制数计算结果变换回BCD符号。但是对于某些计算,例如像加法,就可以方便和更有效地将BCD数直接相加,而不必采用二进制变换。图1中方框图表示了在FPGA中如何实现BCD加法程序的。 BCD的二个输入A和B就是二个12位的基数,它们代表000～999之间的一个十进数。你首先用12位二进制数加法程序将这二个基数相加得出和数E,并且通过加法运
The most convenient way to calculate the BCD radix is to convert the BCD input to a binary number, calculate it in the normal binary format, and then convert the result of the binary number back to the BCD symbol. But for some calculations, such as addition, it is easier and more efficient to add BCD numbers directly without having to resort to binary transforms. The block diagram in Figure 1 shows how to implement the BCD summing program in an FPGA. The two inputs B and B, A and B, are two 12-bit radixes that represent a decimal number between 000 and 999. You first sum the two radixes by the 12-bit binary number addition program to get the sum E, and by adding