Approximate computation in digital systems using bit partitioning
US-11914447-B1 · Feb 27, 2024 · US
US10185545B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10185545-B2 |
| Application number | US-201816029058-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 6, 2018 |
| Priority date | Jan 17, 2014 |
| Publication date | Jan 22, 2019 |
| Grant date | Jan 22, 2019 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A trailing/leading zero counter is described which comprises a plurality of hardware logic blocks, each of which calculates one bit of the output value (i.e. the number of trailing/leading zeros depending on whether it is a trailing/leading zero counter). Each hardware logic block comprises two blocks of section hardware logic which each receive a section of an input string and generate one or two outputs from this section of bits. Combining logic then combines the outputs of the section hardware logic to generate the bit of the output value. For hardware logic blocks which calculate bits other than the least significant bit of the output, the hardware logic blocks also comprise one or more OR reduction stages which reduces the length of the input string by pairwise combining of bits using OR gates before the resultant string is divided into two sections and input to the section hardware logic.
Opening claim text (preview).
What is claimed is: 1. A zero counter comprising a plurality of hardware logic blocks each arranged to calculate one bit of an output value, the output value corresponding to a number of trailing or leading zeros in an input string, wherein at least one hardware logic block in the plurality of hardware logic blocks is arranged to calculate a bit of index i of the output value and comprises: i OR reduction stages arranged in series, a first OR reduction stage arranged to receive the input string and comprising one or more OR gates arranged to combine adjacent bits in the input string to generate an output string and any subsequent OR reduction stages arranged to receive the output string from a preceding OR reduction stage and comprising one or more OR gates arranged to combine adjacent bits in the received string to generate a further output string; and combining logic arranged to combine outputs derived from a last OR reduction in the series and generate a bit of index i of the output value. 2. The zero counter according to claim 1 , wherein the zero counter comprises a trailing zero counter and the output value corresponds to a number of trailing zeros. 3. The zero counter according to claim 2 , wherein the at least one hardware logic block in the plurality of hardware logic blocks comprises: a low section hardware logic block arranged to generate two outputs, the first output, D(v L ), being equal to one if there is no trailing one in an even column of the received section and the second output, B(v L ), being equal to one if there is a one in an odd indexed column of the received section, and a high section hardware logic block arranged to generate one output, G(v H ), being equal to one if there is a trailing one in an odd indexed column of the received section, and wherein the combining logic is arranged to generate the bit of the output value by combining the outputs of the high and low section hardware logic blocks using: D ( v L )·( B ( v L )+ G ( v H )) where: . represents an AND function, and + represents an OR function. 4. The zero counter according to claim 2 , wherein at least one hardware logic block in the plurality of hardware logic blocks comprises: a low section hardware logic block in each of the plurality of hardware logic blocks is arranged to generate two outputs, the first output, D(v L ), being equal to one if there is no trailing one in an even column of the received section and the second output, B(v L ), being equal to one if there is a one in an odd indexed column of the received section, and wherein the high section hardware logic block in each of the plurality of hardware logic blocks is arranged to generate one output, G(v H ), being equal to one if there is a trailing one in an odd indexed column of the received section, and wherein the combining logic each of the plurality of hardware logic blocks is arranged to generate the bit of the output value by combining the outputs of the high and low section hardware logic blocks using: D ( v L )·( B ( v L )+ G ( v H )) where: . represents an AND function, and + represents an OR function. 5. The zero counter according to claim 2 , wherein at least one hardware logic block in the plurality of hardware logic blocks comprises: a low section hardware logic block arranged to generate two outputs, the first output, G(v L ), being equal to one if there is a trailing one in an odd indexed column of the received section and the second output, A(v L ), being equal to one if there is not a one in any even indexed column of the received section, and a high section hardware logic block arranged to generate one output, G(v H ), being equal to one if there is a trailing one in an odd indexed column of the received section, and wherein the combining logic in the same one of the plurality of hardware logic blocks is arranged to generate the bit of the output value by combining the outputs of the high and low section hardware logic blocks using: G ( v L )+( G ( v H )· A ( v L )). 6. The zero counter according to claim 2 , wherein at least one hardware logic block in the plurality of hardware logic blocks comprises: a low subsection hardware logic block comprising inputs arranged to receive bits from a first subsection of a section of a string, the first subsection including a least significant bit in the section and one or more logic gates arranged to combine the received bits and generate at least one output; a high subsection hardware logic block comprising inputs arranged to receive bits from a second subsection of a section of a string, the second subsection including a most significant bit in the section and one or more logic gates arranged to combine the received bits and generate at least one output, wherein the first and second subsections of the section are non-overlapping and comprise all the bits in the section; and combining logic arranged to combine the output of the two subsection hardware logic blocks and generate an output of the section hardware logic block. 7. The zero counter according to claim 6 , wherein a low subsection hardware logic block in one of the high or low section hardware logic blocks is arranged to generate two outputs, the first output, D(v LS ), being equal to one if there is no trailing one in an even column of the received subsection and the second output, B(v LS ), being equal to one if there is a one in an odd indexed column of the received subsection, and wherein a high subsection hardware logic block in the same one of the high or low section hardware logic blocks is arranged to generate one output, G(v HS ), being equal to one if there is a trailing one in an odd indexed column of the received subsection, and wherein the combining logic in the same one of the high or low section hardware logic blocks is arranged to generate the output of the section hardware logic block by combining the outputs of the high and low subsection hardware logic blocks using: D ( v LS )·( B ( v LS )+ G ( v HS )). 8. The zero counter according to claim 6 , wherein a low subsection hardware logic block in one of the high or low hardware section logic blocks is arranged to generate two outputs, the first output, G(v LS ), being equal to one if there is a trailing one in an odd indexed column of the received subsection and the second output, A(v LS ), being equal to one if there is not a one in any even indexed column of the received subsection, and wherein a high subsection hardware logic block in the same one of the high or low section hardware logic blocks is arranged to generate one output, G(v HS ), being equal to one if there is a trailing one in an odd indexed column of the received subsection, and wherein the combining logic in the same one of the high or low section hardware logic blocks is arranged to generate the bit of the output of the section hardware logic block by combining the outputs of the high and low subsection hardware logic blocks using: G ( v LS )+( G ( v HS )· A ( v LS )). 9. The zero counter according to claim 6 , wherein at least one of the high or low subsection hardware logic blocks comprises: a further low subsection hardware logic block comprising inputs arranged to receive bits from a first further subsection of a subsection of a string, the first further subsection including a least significant bit in the subsection and one or more logic gates arranged to combine the received bits and generate at least one output; a further high subsection hardware logic block comprising inputs arranged to receive bits from a second further subsection of the subsection of a string, the second further subsection including a most significant b
Logical and Boolean instructions, e.g. XOR, NOT · CPC title
Selecting or encoding within a word the position of one or more bits having a specified value, e.g. most or least significant one or zero detection, priority encoders {(with shifting G06F5/01)} · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.