# US 2019/0171415 A1 · Partially and Fully Parallel Normaliser

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0171415 A1
- Document ID: US20190171415A1
- Status: Published application
- Kind: A1
- Application number: 16/252,367
- Filed: 2019-01-18
- Published: 2019-06-06
- Earliest claimed: 2013-12-20
- Assignees: Imagination Technologies Limited
- Applicants: Imagination Technologies Limited
- Inventors: Theo Alan Drane
- Web page: https://patentgrep.com/patent/US20190171415A1

## CPC

- G06F 5/01: for shifting, e.g. justifying, scaling, normalising {(digital stores in which the information is moved stepwise, e.g. shift-registers G11C19/00; digital stores in which the information circulates G11C21/00)}
- G06F 7/74: 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)}
- G06F 2205/003: Reformatting, i.e. changing the format of data representation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Hardware logic arranged to normalise (or renormalise) an n-bit input number is described in which at least a proportion of a left shifting operation is performed in parallel with a leading zero count operation. In various embodiments the left shifting and the leading zero count are performed independently. In various other embodiments, a subset of the bits output by a leading zero counter are input to a left shifter and the output from the left shifter is input to a renormalisation block which completes the remainder of the left shifting operation independently of any further input from the leading zero counter.

## Claims

### Claim 1

Hardware logic arranged to normalize or renormalize a binary number, the hardware logic comprising:
a zero counter arranged to determine a number of leading or trailing zeros in the binary number; and
normalization logic arranged to perform normalization or renormalization of the binary number;
wherein at least a portion of the normalization logic is arranged to operate independently of the zero counter.

### Claim 2 (depends on 1)

Hardware logic according to claim 1, wherein the at least a portion of the normalization logic is arranged to operate without input from the zero counter.

### Claim 3 (depends on 1)

Hardware logic according to claim 1, wherein all of the normalization logic is arranged to operate independently of the zero counter.

### Claim 4 (depends on 1)

Hardware logic according to claim 1, wherein the at least a portion of the normalization logic comprises a normalizer block arranged to operate independently of the zero counter.

### Claim 5 (depends on 4)

Hardware logic according to claim 4, wherein the normalizer block comprises hardware logic arranged to combine pairs of bits in the binary number according to:
rij:j=αj·αj−n+1+i
where:
· represents an AND logic function,
n is a number of bits in the binary number,
j is a bit index associated with each of the n-bits in the binary number,
αj is the jth bit in the binary number, and
i is a bit index associated with each bit ri output by the normalizer block.

### Claim 6 (depends on 5)

Hardware logic according to claim 5, wherein the normalizer block further comprises hardware logic arranged to combine values rij:j in the form of a tree of logic elements to compute output bits rin−1:0 based on at least one of:
rij:k=rij:t+Bj:trit−1:k and
rij:k=(rij:t+Bj:t)(rij:t+rit−1:k)
where:
+ represents an OR logic function,
t and k are natural numbers, and
Bj:t=αj·αj+1 . . . αt+1·αt.

### Claim 7 (depends on 1)

Hardware logic according to claim 1, wherein the normalization logic comprises:
a shifter arranged to receive a subset of the bits, starting from a most significant bit, generated by the zero counter and to shift the binary number based on the received bits; and
a normalizer block arranged to receive an output from the shifter and to generate an output comprising a normalised version of the binary number.

### Claim 8 (depends on 7)

Hardware logic according to claim 7, wherein the normalizer block comprises hardware logic arranged to combine pairs of input bits according to:
rij:j=α′j·α′j−n+1+i
where:
· represents an AND logic function,
n is a number of bits in the binary number,
j is a bit index associated with each of the n-bits in the binary number,
α′j is the jth bit in the number output by the shifter, and
i is a bit index associated with each bit ri output by the normalizer block.

### Claim 9 (depends on 6)

Hardware logic according to claim 6, wherein the normalizer block further comprises hardware logic arranged to combine values rij:j in the form of a tree of logic elements to compute output bits rin−1:n+1−2a−h based on at least one of:
rij:k=rij:t+Bj:trit−1:k and
rij:k=(rij:t+Bj:t)(rij:t+rit−1:k)
where:
+ represents an OR logic function,
t and k are natural numbers,
α=└log2n┘+1,
the subset of bits received from the zero counter comprises h bits, and
Bj:t=αj·αj+1 . . . αt+1·αt.

### Claim 10

A method of normalizing or renormalizing a binary number, the method comprising:
determining, by hardware logic a number of leading or trailing zeros in the binary number in a zero counter; and
normalizing or renormalizing the binary number in normalization logic, and wherein at least a portion of the normalization logic is arranged to operate independently of the zero counter.

### Claim 11 (depends on 10)

The method according to claim 10, wherein the at least a portion of the normalization logic is arranged to operate without input from the zero counter.

### Claim 12 (depends on 10)

The method according to claim 10, wherein all of the normalization logic is arranged to operate independently of the zero counter.

### Claim 13

A non-transitory computer readable storage medium having stored thereon computer executable program code that when executed causes at least one processor to
determine a number of leading or trailing zeros in a binary number in a zero counter; and
normalizing or renormalizing the binary number, wherein at least a portion of the normalization or renormalization is performed independently of the zero counter.

### Claim 14 (depends on 13)

The non-transitory computer readable storage medium according to claim 13, wherein at least a portion of the normalization or renormalization operation is performed without input from the zero counter.

### Claim 15 (depends on 13)

The non-transitory computer readable storage medium according to claim 13, wherein all of the normalization or renormalization is performed independently of the zero counter.

### Claim 16

A non-transitory computer readable storage medium having stored thereon computer executable program code that, when executed at a computer system for generating a representation of a digital circuit from definitions of circuit elements and data defining rules for combining those circuit elements, cause the computer system to generate hardware logic arranged to normalise or renormalize a binary number, the hardware logic comprising:
a zero counter arranged to determine a number of leading or trailing zeros in the binary number; and
normalization logic arranged to perform normalization or renormalization of the binary number,
wherein at least a portion of the normalization logic is arranged to operate independently of the zero counter.

### Claim 17 (depends on 16)

The non-transitory computer readable storage medium according to claim 16, wherein the at least a portion of the normalization logic is arranged to operate without input from the zero counter.

### Claim 18 (depends on 16)

The non-transitory computer readable storage medium according to claim 16, wherein all of the normalization logic is arranged to operate independently of the zero counter.
