Method and device for checking whether binary number is multiple of three, and checking chip thereof

Abstract

The invention provides a method for testing whether a binary digit is a mulriple of three. The method comprises the following steps: whether the binary digit is larger than the specified digit of N (N is larger than one) is determined, if yes, the binary digit is split into two parts of a low byte and a high byte; a lookup table which consists of all the numbers from 0 to 2<N> which can be divided by three is preset; if the difference value between the sum of all the numbers at the odd number position and the sum of all the numbers at the even number position is larger than zero, the number represented by the low byte minus the difference to obtain an execution result; if the execution result is smaller than zero, the number represented by the low byte is taken as a minuend, the absolute value of the difference is moved leftwards for one digit, and the execution result of the binary digit is obtained; the execution result of the binary digit is looked up in the lookup table, if so, the binary digit is determined as the mulriple of three. The method of the invention avoids the shortcomings of complicated numbering system conversion, longer subtracter bitwidth and multiple times of interations, when determining whether the binary digit is the mulriple of three in the prior art. Therefore, the determination can be realized with the least resource and the highest efficiency.

Description

technical field [0001] The invention relates to the field of integrated circuit design, in particular to a method and device for checking whether a binary number is a multiple of three, and a check chip. Background technique [0002] In integrated circuit design, in many applications such as ECC (Error Checking and Correcting, error checking and correction) algorithm, it is necessary to judge whether a number is a multiple of three, but the existing digital circuits are basically switching circuits. It is relatively easy to judge whether a number is a multiple of two, but it is more difficult to judge whether a number is a multiple of three. [0003] At present, there are mainly two methods for judging whether a number is a multiple of three: [0004] Method 1: Convert the binary input data into a decimal number, and then add the data on each "weight" bit, if the result of the sum is a multiple of three, then the number is a multiple of three. For example, (1111_1111) 2 =...

AI Technical Summary

Problems solved by technology

But the main defect of this method is: the process of converting from binary to decimal is more complicated, the conversion efficiency is low, and, when the target number is large, such as a 20-bit number, it needs to use a very long subtractor, The bit width of the subtractor is too wide, which will lead to an increase in the chip area.

The main defect of this method is: this method requires that the bit width of the subtractor will be very wide, so it will also cause a large chip area to be occupied; moreover, in the actual judgment, more iterations are required, which may lead to Timing requirements cannot be met

[0006] In view of this, a technical problem that needs to be solved urgently by those skilled in the art is: to provide a multiple of three inspection device, thereby overcoming the chip area caused by the complicated numerical conversion and the long bit width of the required subtractor in the prior art. Relatively large, low work efficiency and other defects, so that it can use less resources and faster calculation efficiency to judge whether a binary number, especially a larger number, is a multiple of 3

Images