Circuit for comparing two n-digit binary data words
AssigneeWired Connections LLC
InventorsEgor Sogomonyan, Michael Gössel
Life of this patent
Estimating the term…
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.
Claims7
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).
Dependencies are inferred from the claim text.