# US 2009/0289663 A1 · Circuit for comparing two n-digit binary data words

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

- Number: US 2009/0289663 A1
- Document ID: US20090289663A1
- Status: Published application
- Kind: A1
- Application number: 11/909,148
- Filed: 2006-01-26
- Published: 2009-11-26
- Earliest claimed: 2005-03-24
- Assignees: Wired Connections LLC
- Inventors: Egor Sogomonyan; Michael Gössel
- Web page: https://patentgrep.com/patent/US20090289663A1

## CPC

- G06F 7/02: Comparing digital values (G06F7/06, {G06F7/22,} G06F7/38 take precedence)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The invention relates to a circuit for comparing two n-digit binary data words x[1](t), . . . , x[n](t) and x′[1](t), . . . , x′[n](t), which in the error-free case are either identical or inverted bit-by-bit with respect to each other, with a series connection of a combinatorial circuit for implementing a first combinatorial function, a controllable register and a combinatorial circuit for implementing another combinatorial function.

## Claims

### Claim 1

A circuit for comparing two n-digit binary data words x[1](t), . . . , x[n](t) and x′[1](t), . . . , x′[n](t), which in the error-free case are either identical or inverted bit-by-bit with respect to each other, comprising a series connection of a conmbinatorial circuit for implementing a combinatorial function f, a controllable register and a combinatorial circuit for implementing a combinatorial function g,
wherein the combinatorial circuit for implementing the combinatorial function f comprises:
2n+1 inputs, I11, I11′, . . . , I1n′, I1(n+1) configured so that each component x[j](t) of a first binary data word x[1](t), . . . , x[n](t) is available at the input I1j for j=1, . . . , n and each component x′[j](t) of a second binary data word x′[1](t), . . . , x′[n](t) is available at the input I1j′ for j=1, . . . , n and a binary control signal is available at the input I1(n+1); and
n outputs for the output signals y[1](t), . . . , y[n](t) configured so that for j=1, . . . , n,
y[j](t)=x[j](t)⊕x′[j](t)⊕x[0]⊕i[f]
holds true, where ⊕ is addition modulo 2 and i[f] is a binary constant, and wherein the controllable register comprises:
n flip-flops, FF1, . . . , FFn, configured to assume binary states z[1](t), . . . , z[n](t) at a time t;
n multiplexers, MUX1, . . . , MUXn each comprising two data inputs, a first control input configured to carry a binary control signal s, and an output; and
an external input, configured to carry a signal E(t) and connected to a second data input of the multiplexer MUXn;
and wherein for j=1, . . . , n a first data input of the multiplexer MUXj is connected to the j-th output of the combinatorial circuit that carries the signal y[j](t), for implementing the combinatorial function f; and
each respective output of the multiplexers MUX1, . . . , MUXn is connected to a corresponding data input of flip-flops FF1, . . . , FFn, where for k=2, . . . , n one output of the flip-flop FFk is connected to a second data input of the multiplexer MUX(k−1)and to a k-th input of the combinatorial circuit for implementing the combinatorial function g;
and wherein in the combinatorial circuit for implementing the combinatorial function g,
the combinatorial function g is implemented by n variables with a specific value c[g] at an output of the combinatorial circuit; and
a first input is connected to the output of the flip-flop FF1, where the output of the flip-flip FF1 is also connected to the external output of the controllable register, said output carrying an output value A(t).

### Claim 2 (depends on 1)

The circuit as in claim 1, wherein
the circuit for implementing the combinatorial function g is configured as a circuit for implementing a combinatorial function gv[0] and comprising
a second control input which configured to carry a binary control signal v[0], and which implements a Boolean function with a determining value c[gv[0]] such that c[g0]≠c[g1].

### Claim 3 (depends on 1)

The circuit as in claim 1, wherein
the circuit for implementing the combinatorial function g is a circuit implementing the function AND with a determining value c[AND]=0.

### Claim 4 (depends on 2)

The circuit as in claim 2 wherein:
the circuit for implementing the combinatorial function gv[0] comprises a first AND gate with n inputs and a parallel connected first NOR gate with n inputs;
an output of the first AND gate is connected to a first input of a second AND gate having two inputs and one output;
an output of the first NOR gate is connected to a first input of a second NOR gate comprising two inputs and one output;
the second control input of the circuit for implementing the function g is connected to a second input of the second AND gate and the second NOR gate;
an output of the second AND gate is connected to a first input of an OR gate; and
an output of the second NOR gate is connected to a second input of the OR gate, whose output forms the circuit output.

### Claim 5 (depends on 2)

A circuit as in claim 2 wherein the input I1(n+1) of the circuit for implementing the combinatorial function f and the second control input of the circuit for implementing the combinatorial function gv[0] are connected together directly or by means of an inverter.

### Claim 6 (depends on 1)

A circuit as in claim 1, wherein the data inputs I11′, . . . I1n′ are each connected to a first input of a corresponding logic gate and a third control input is connected to a second input of each logic gate and wherein each logic gate is configured so that the corresponding data input is modified to a predetermined output determining value when the third control input is equal to the predetermined output value and the corresponding data input is not modified when the third control input is not equal to the predetermined output value.

### Claim 7 (depends on 1)

A circuit as in claim 1, wherein in the controllable register a series connection of a multiplexer and a flip-flop element is formed as an integrated scan flip-flop.
