WO2003107538A1 - Decoding logic for generating a n-bit binary output signal on the basis of an intermediate n-bit gray signal - Google Patents

Decoding logic for generating a n-bit binary output signal on the basis of an intermediate n-bit gray signal Download PDF

Info

Publication number
WO2003107538A1
WO2003107538A1 PCT/IB2003/002385 IB0302385W WO03107538A1 WO 2003107538 A1 WO2003107538 A1 WO 2003107538A1 IB 0302385 W IB0302385 W IB 0302385W WO 03107538 A1 WO03107538 A1 WO 03107538A1
Authority
WO
WIPO (PCT)
Prior art keywords
gate
bit
input
output signal
binary output
Prior art date
Application number
PCT/IB2003/002385
Other languages
French (fr)
Inventor
Peter C. S. Scholtens
Original Assignee
Koninklijke Philips Electronics N.V.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Koninklijke Philips Electronics N.V. filed Critical Koninklijke Philips Electronics N.V.
Priority to AU2003232411A priority Critical patent/AU2003232411A1/en
Publication of WO2003107538A1 publication Critical patent/WO2003107538A1/en

Links

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/14Conversion to or from non-weighted codes
    • H03M7/16Conversion to or from unit-distance codes, e.g. Gray code, reflected binary code
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M5/00Conversion of the form of the representation of individual digits
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/14Conversion to or from non-weighted codes
    • H03M7/16Conversion to or from unit-distance codes, e.g. Gray code, reflected binary code
    • H03M7/165Conversion to or from thermometric code

Definitions

  • the outputs of the logic units of the first and second kind are fed to the inputs of the succeeding logic units of the first and second kind.
  • the bit B n-m+ ⁇ is fed to a first input of the first NAND- gate 14.1 and the inverted bit G n-m is fed to a second input of the first NAND-gate 14.1. Furthermore, the inverted bit B n . m+1 is fed to a first input of the second NAND-gate 14.2 and the bit Gn-m is fed to a second input of the second NAND-gate 14.2. In this way a logic unit of the first kind 18.m is realized which generates the bit B n-m at the output of the third NAND-gate 14.3.

Abstract

The invention relates to a decoding logic for generating a n-bit binary output signal (4) on the basis of an intermediate n-bit Gray signal (6), comprising a first series connection of respective logic units of a first kind (8) for generating respective bits of the n-bit binary output signal (4), wherein the nth bits of the respective signals are the most significant bits and wherein the 1th bits of the respective signals are the least significant bits of the respective signals, and wherein, in use, the mth logic unit of the first kind, wherein m=1 ,..., (n-1), generates the (n-m)th bit of the n-bit binary output signal (4) on the basis of the (n-m+1)th bit of the binary output signal and the (n-m)th bit of the Gray signal (6), wherein the mth logic unit of the first kind (8) consists of one or more AND-gates, one or more NAND-gates, and/or an OR-gate.

Description

Decoding logic for generating a n-bit binary output signal on the basis of an intermediate n- bit Gray signal
The invention relates to a decoding logic for generating a n-bit binary output signal on the basis of an intermediate n-bit Gray signal, comprising a first series connection of respective logic units of a first kind for generating respective bits of the n-bit binary output signal, wherein the nth bits of the respective signals are the most significant bits and wherein the ll bits of the respective signals are the least significant bits of the respective signals, and wherein, in use, the mth logic unit of the first kind, wherein m= 1 ,..., (n-1), generates the (n- m)th bit of the n-bit binary output signal on the basis of the (n-m+l) h bit of the binary output signal and the (n-m)th bit of the Gray signal.
Decoding logics of this kind are known in practice and are used in flash A/D converters. In these flash A/D converters, in a first step, a thermometer signal is generated on the basis of signals originating from an array of comparators. Subsequently, in a second step, an intermediate Gray signal is generated on the basis of the thermometer signal. Then, in a third step, a binary output signal is generated on the basis of the intermediate Gray signal. The second step is applied in order to reduce converting errors which can arise in a direct conversion from the thermometer signal to the binary output signal.
In the known decoding logic for generating the binary output signal the logic units of the first kind are exclusive-or (EXOR)-gates. Although the mathematical formulation of the decoding logic in terms of EXOR- functions is the most simple formulation, a direct implementation of this formulation does not lead a topology for a fast operating decoding logic. This is a consequence of the fact that the known EXOR-gates are, due to their complexity, not very fast operating logical hardware components.
It is an object of the invention to provide a decoding logic with an efficient and relatively fast topology. For this, the required transformation from the Gray signal to the binary output signal is re-formulated in terms of mathematical functions which correspond with fast operating logical hardware components. This yields a decoding logic according to the invention which is characterised in that the mth logic unit of the first kind consists of one or more AND-gates, one or more NAND-gates and/or an OR-gate. In this way, the logic units of the first kind are only built op with fast gates, yielding a relatively fast decoding logic. It is noted that the decoding logic according to the invention can also be provided with gates serving as delay-elements for timing purposes.
A first embodiment of the decoding logic according to the invention is th characterised in that the m logic unit of the first kind comprises a first NAND-gate, a second NAND-gate and a third NAND-gate, wherein the output of the first NAND-gate is connected with a first input of the third NAND-gate and wherein the output of the second NAND-gate is connected with a second input of the third NAND-gate, wherein, in use, the (n-m+1 )th bit of the binary output signal is fed to a first input of the first NAND-gate and the inverted (n-m)th bit of the Gray signal is fed to a second input of the first NAND-gate, and wherein the inverted (n-m+1 )th bit of the binary output signal is fed to a first input of the second NAND- gate and the (n-m)th bit of the Gray signal is fed to a second input of the second NAND-gate, wherein the output of the third NAND-gate is the (n-m)th bit of the n-bit binary output signal. The topology of the decoding logic wherein each logic unit of the first kind comprises three NAND-gates is functionally equivalent with the topology of the known decoding logic wherein each logic unit of the first kind comprises a known EXOR-gate. However, the topology of decoding logic according to the invention is matched with advantageous logic hardware components and thus can operate considerably faster than the known decoding logic.
A second embodiment according to the invention is characterised in that the mth logic unit of the first kind comprises a first AND-gate, a second AND-gate and an OR- gate, wherein the output of the first AND-gate is connected with a first input of the OR-gate and wherein the output of the second AND-gate is connected with a second input of the OR- gate, wherein, in use, the (n-m+1 )th bit of the binary output signal is fed to a first input of the first AND-gate and the inverted (n-m) bit of the Gray signal is fed to a second input of the first AND-gate, and wherein the inverted (n-m+1 )th bit of the binary output signal is fed to a first input of the second AND-gate and the (n-m) h bit of the Gray signal is fed to a second input of the second AND-gate, wherein the output of the OR-gate is the (n-m)th bit of the n- bit binary output signal. The topology of the two AND-gates and the OR-gate in the logic units of the first kind is functionally equivalent with an EXOR-function, but the decoding logic according to the second embodiment can operate considerably faster than the known decoding logic which is provided with a known EXOR-gate.
Both in the first embodiment and the second embodiment the mth logic unit of the first kind has to be fed with the (n-m+1 )th inverted bit of the binary output signal (m=l,...,n-l). Herewith, the 1th logic unit of the first kind can be fed with the inverted n' inverted bit of the Gray signal since the nth bit of the n bit binary output signal is equal to the nth bit of the n bit Gray signal. The (n-p)th inverted bit (p=l,...,n-2) of the binary output signal can be generated in principle in two different ways.
A first way of generating the (n-p)th inverted bit (p=l,...,n-2) of the binary output signal is to connect an inverter between succeeding logic units of the first kind for generating the inverted bit of the binary output signal on the basis of the output of a preceding logic unit of the first kind. An advantage of the this is that it yields a relatively simple and cheap topology. A disadvantage is that the inverter is connected in series with the logic units of the first kind, such that it introduces an extra time delay. According to a second way a relatively fast topology for the decoding logic according to the invention is achieved wherein the inverted (n-m+1 )th bit of the binary output signal is calculated in parallel with the (n-m+1 )th bit of the binary output signal. For this, an embodiment according to the invention is characterised in that the decoding logic also comprises a second series connection of respective logic units of a second kind, wherein the pth logic unit of the second kind, wherein p= 1 ,..., (n-2), comprises a first NOR-gate, a second NOR-gate and a third NOR-gate, wherein the output of the first NOR-gate is connected with a first input of the third NOR-gate and wherein the output of the second NOR-gate is connected with a second input of the third NOR-gate, and wherein the output of the third NOR-gate is connected with an input of the (p+l)th logic unit of the first kind, wherein, in use, the (n-p+1) bit of the binary output signal is fed to a first input of the first NOR-gate and the inverted (n-p) bit of the Gray signal is fed to a second input of the first NOR-gate, and wherein the inverted (n-p+1) bit of the binary output signal is fed to a first input of the second NOR-gate and the (n-p)th bit of the Gray signal is fed to a second input of the second NOR-gate, wherein the output of the third NOR-gate is the inverted (n-p)th bit of the n-bit binary output signal which is fed to the (p+l)th logic unit of the first kind. In this embodiment the (n-m)' bit of the binary output signal is calculated by the mth logic unit of the first kind while the inverted (n-p)th bit of the binary output signal is calculated in parallel th by the (p=m) logic unit of the second kind. Next, the outputs of the logic units of the first and second kind are fed to the inputs of the succeeding logic units of the first and second kind.
In the accompanying drawings in which certain modes for carrying out the present invention are shown for illustrative purposes: Figure 1 is a schematic diagram of a decoding logic according to the invention for generating a n-bit binary output signal on the basis of an intermediate n-bit Gray signal;
Figure 2 A is a schematic diagram of a first embodiment of a logic unit of the first kind of the decoding logic of figure 1; Figure 2B is a schematic diagram of a second embodiment of a logic unit of the first kind of the decoding logic of figure 1;
Figure 3 is a schematic diagram of a first embodiment of a logic unit of the second kind of the decoding logic of figure 1.
Figure 1 schematically shows a decoding logic 2 which can be used in a flash
A/D converter for generating a n-bit binary output signal 4 on the basis of an (intermediate) n-bit Gray signal 6. The decoding logic 2 has a recursive structure and comprises a first series connection of respective logic units of a first kind 8.m, m=l,...,n-l for generating the respective bits of the n-bit binary output signal 4. Hereinafter, the following notation will be applied. The n bit binary output signal 4 is notated as (Bn, Bn-1,..., Bi), wherein the bit Bn is the most significant bit and Bj is the least significant bit. In an analogous way, the Gray signal 6 is notated as (Gn, Gn-ι,..., Gi). The (n-k)th bit of the n-bit binary output signal is Bn-k and the inverted (n-k)th bit of the n-bit binary output signal is notated as R n-k (k=0,...,n-l). Furthermore, the (n-k)th bit of the Gray signal is Gn-k and the inverted (n-k)th bit of the Gray signal is notated as G n-k (k=0,...,n-l). With the notation according to the preceding paragraph the transformation from the intermediate n bit Gray signal to the n-bit binary output signal can be written with the following (recursive) formulas (I):
Figure imgf000005_0001
wherein <£> is the mathematical exclusive-or function. A direct implementation of (I) would yield a relatively slow circuitry. This is a consequence of the fact that an EXOR-gate has a relatively complex topology as a consequence of which it is a relatively slow operating logical hardware component. In contrast, NAND-gates, AND-gates, OR-gates and NOR- gates have simple topologies and are fast operating logical hardware components. For achieving a relatively fast operating decoding logic 2 according to the invention, the equations (I) have to be re-formulated in terms of mathematical functions which can be performed by relatively fast logical hardware components. This re-formulation according to the invention yields two possible sets of equations (II) and (III) and thus two advantageous topologies for the logic unit of the first kind. The first set of equations (II) is:
Figure imgf000006_0001
wherein • is the logical mathematical AND function and wherein the bars over the mathematical entities are mathematical inversion functions. The second set of equations (II) is:
Figure imgf000006_0002
wherein + is the logical mathematical OR function. Later on, it will be explained how the respective sets of equations (11) and (III) relate to the respective first and second embodiments of logic units of the first kind.
The decoding logic 2 receives the Gray signal 6 (Gn, Gn-1,..., Gi) for generating the n bit binary output signal (B„, Bn-1,..., Bj). From figure 1 it is clear that the logic units 8.m (m=l,...,n-l) of the first kind have to be fed both with the bits of the Gray signal 6 and with the inverted bits of the Gray signal. In principle, the decoding unit 2 can generate the inversed bits 10 of the Gray signal in a straightforward way by inverting the bits of the Gray signal 6. However, in this case the decoding logic 2 can be directly provided with these inverted bits (G n, G n-ι,—,G ι) 10 of the Gray signal 6 (see figure 1) since the decoding unit 2 is used in a configuration in which the inverted bits of the Gray signal 10 are already generated at the outputs of flip-flops of this configuration. Accordingly, logical inversion gates are saved such that unnecessary time delays are prevented which yields a faster decoding logic 2. The bits of the Gray signal 6 and the inverted bits 10 of the Gray signal can be distributed via the connection 12 to the respective logic units of the first kind 8.m (m=l,...,n-l).
As shown in figure 1, the logic units of the first kind are part of a recursive first series connection. Figures 2 A and 2B show that the mth logic unit of the first kind 8.m (m=l,...,n-l) can generate the bit Bn-m on the basis of bit Bn-m+ι, the inverted bit R n-m+ι, the bit Gn-m and the inverted bit G n-m- For the initialization of the logic unit 8.1 the equations Bn=Gn and R n=G n are used. The logic unit of the first kind 8.1 can generate the bit Bn-ι on the basis of the bits Gn, Gn-ι, G „ and G n-ι-
Hereinafter two possible topologies for the logic units of the first kind 8.m (m=l,...,n-l) according to the invention are discussed and described with reference to the figures 2 A and 2B. For each of these logic units of the first kind a circuitry is applied which only comprises one or more NAND-gates, one or more AND-gates and/or an OR-gate. With these gates it is possible to realize a decoding logic which can operate considerably faster than the known logic unit which comprises a logical hardware component such as an EXOR- gate.
Figure 2 A is a first embodiment of the mth logic unit 8.m of the first kind which is based on the set of equations (II), wherein m=l,...,n-l. The mth logic unit of the first kind comprises a first NAND-gate 14.1, a second NAND-gate 14.2 and a third NAND-gate 14.3. An output of the first NAND-gate 14.1 is connected with a first input of the third NAND-gate 14.3 and an output of the second NAND-gate 14.2 is connected with a second input of the third NAND-gate 14.3. The bit Bn-m+ι is fed to a first input of the first NAND- gate 14.1 and the inverted bit G n-m is fed to a second input of the first NAND-gate 14.1. Furthermore, the inverted bit B n.m+1 is fed to a first input of the second NAND-gate 14.2 and the bit Gn-m is fed to a second input of the second NAND-gate 14.2. In this way a logic unit of the first kind 18.m is realized which generates the bit Bn-m at the output of the third NAND-gate 14.3.
Figure 2B is a second embodiment of the mth logic unit 8.m of the first kind which is based on the set of equations (III), wherein m=l,...,n-l. The mth logic unit 8.m of the first kind comprises a first AND-gate 16.1, a second AND-gate 16.2 and an OR-gate 18. An output of the first AND-gate 16.1 is connected with a first input of the OR-gate 18 and an output of the second AND-gate 16.2 is connected with a second input of the OR-gate 18. The bit Bn-m+ι is fed to a first input of the first AND-gate 16.1 and the inverted bit G a.m is fed to a second input of the first AND-gate 16.1. Furthermore, the bit B n-m+ι is fed to a first input of the second AND-gate 16.2 and the bit Gn-m is fed to a second input of the second AND- gate 16.2. Finally, the bit Bn-m is generated by the OR-gate 18.
It follows from the set of equations (I) that the bit Bn=Gn and that the inverted bit B n= G n such that the logic unit 8.1 can generate the bit Bn-1 solely on the basis of the bits Gn, Gn-1, G n , G n-i- hi a way the logic unit 8.1 of the first kind initializes the (recursive) first series connection of logic units of the first kind.
In Figure 1 it is shown that the decoding logic 2 also comprises a second series connection of logic units of a second kind 20.p (p=l,...,n-2), wherein the logic units of the second kind can be provided with the bits of the Gray signal 6 and the inverted bits 10 of the Gray signal 6 via the connection 12. The logic unit 20. p of the second kind generates the inverted bit Bn_p which can be used both by the succeeding logic unit of the first kind 8.(p+l) and the succeeding logic unit of the second kind 20.(p+l), (p=l,...,n-2). In figure 3 it is shown that the logic unit 20.p comprises a first NOR-gate 22.1, a second NOR-gate 22.2 and a third NOR-gate 22.3. The output of the first NOR-gate 22.1 is connected with a first input of the third NOR-gate 22.3 and the output of the second NOR-gate 22.2 is connected with a second input of the third NOR-gate 22.3. The first input of the first NOR-gate 22.1 can be fed with the bit G n p and the second input of the first NOR-gate 22.1 can be fed with the bit Bn- p+1. Furthermore, the bit B n-p+1 can be fed to a first input of the second NOR-gate 22.2 and the bit Gn-p can be fed to a second input of the second NOR-gate 22.2. Finally, the bit B n-p is generated by the third NOR-gate 22.3. The thus generated bit B n-p can be fed to the logic unit of the first kind 8.(p+l) and to the logic unit of the second kind 20.(p+l). The first series of logic units of the first kind 8.m are disposed in parallel with the second series of logic units of the second kind 20.p (m=l,...,n-l; p=l,...,n-l). Consequently, the bits Bn-mand B n-p (wherein, in this case, m=p) can be generated in parallel such that a relatively fast decoding logic is realized for generating the n bit binary output signal 4 in a relatively short time.
The invention has been described according to a few embodiments. However, it should be noted that the invention can be practised with embodiments provided with modifications and variations otherwise than as specifically illustrated and described without departing from its spirit or scope. Such a modification is an embodiment of the decoding logic which comprises inverters instead of the second series, wherein the inverters are connected between succeeding logic units of the first kind for inverting the bits of the binary output signal. Another modification is an embodiment of the decoding logic which comprises functionally void logic units for timing purposes.

Claims

CLAIMS:
1. A decoding logic (2) for generating a n-bit binary output signal (4) on the basis of an intermediate n-bit Gray signal (6), comprising a first series connection of respective logic units of a first kind (8) for generating respective bits of the n-bit binary output signal (4), wherein the nth bits of the respective signals are the most significant bits and wherein the 1 bits of the respective signals are the least significant bits of the respective signals, and wherein, in use, the mth logic unit of the first kind (8), wherein m= 1 ,..., (n-l), generates the (n-m)th bit of the n-bit binary output signal (4) on the basis of the (n-m+1 )th bit of the binary output signal (8) and the (n-m)th bit of the Gray signal (6), characterised in that, the ml logic unit of the first kind (8) consists of one or more AND- gates, one or more NAND-gates, and/or an OR-gate.
2. decoding logic according to claim 1, characterised in that, the mth logic unit of the first kind (8S)) ccoommppririsseess aa first NAND-gate, a second NAND-gate and a third NAND- gate, wherein the output of the first NAND-gate is connected with a first input of the third NAND-gate and wherein the output of the second NAND-gate is connected with a second input of the third NAND-gate, wherein, in use, the (n-m+1 )th bit of the binary output signal 4 is fed to a first input of the first NAND-gate and the inverted (n-m)th bit of the Gray signal 6 is fed to a second input of the first NAND-gate, and wherein the inverted (n-m+1 )th bit of the binary output signal (4) is fed to a first input of the second NAND-gate and the (n-m)th bit of the Gray signal (6) is fed to a second input of the second NAND-gate, wherein the output of the third NAND-gate is the (n-m)th bit of the n-bit binary output signal (4).
3. A decoding logic according to claim 1, characterised in that, the mth logic unit of the first kind (8) comprises a first AND-gate, a second AND-gate and an OR-gate, wherein the output of the first AND-gate is connected with a first input of the OR-gate and wherein the output of the second AND-gate is connected with a second input of the OR-gate, wherein, th in use, the (n-m+1) bit of the binary output signal (4) is fed to a first input of the first AND- gate and the inverted (n-m)th bit of the Gray signal (6) is fed to a second input of the first AND-gate, and wherein the inverted (n-m+1)' bit of the binary output signal is fed to a first input of the second AND-gate and the (n-m)th bit of the Gray signal 6 is fed to a second input of the second AND-gate, wherein the output of the OR-gate is the (n-m)th bit of the n-bit binary output signal (4).
4. A decoding logic according to one of the claims 1-3, characterised in that, the decoding logic comprises inverters which are connected between succeeding logic units of the first kind.
5. A decoding logic according to one of the claims 1-3, characterised in that, the decoding logic also comprises a second series connection of respective logic units of a second kind (20), wherein the pth logic unit of the second kind (20), wherein p= 1 ,..., (n-2), comprises a first NOR-gate, a second NOR-gate and a third NOR-gate, wherein the output of the first NOR-gate is connected with a first input of the third NOR-gate and wherein the output of the second NOR-gate is connected with a second input of the third NOR-gate, and wherein the output of the third NOR-gate is connected with an input of the (p+l)th logic unit of the first kind, wherein, in use, the (n-p+1 )th bit of the binary output signal is fed to a first input of the first NOR-gate and the inverted (n-p)th bit of the Gray signal (6) is fed to a second input of the first NOR-gate, and wherein the inverted (n-p+1 )th bit of the binary output signal is fed to a first input of the second NOR-gate and the (n-p)th bit of the Gray signal (6) is fed to a second input of the second NOR-gate, wherein the output of the third
NOR-gate is the inverted (n-p)th bit of the n-bit binary output signal which is fed to the (p+l)th logic unit of the first kind.
PCT/IB2003/002385 2002-06-14 2003-05-27 Decoding logic for generating a n-bit binary output signal on the basis of an intermediate n-bit gray signal WO2003107538A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2003232411A AU2003232411A1 (en) 2002-06-14 2003-05-27 Decoding logic for generating a n-bit binary output signal on the basis of an intermediate n-bit gray signal

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP02077387 2002-06-14
EP02077387.5 2002-06-14

Publications (1)

Publication Number Publication Date
WO2003107538A1 true WO2003107538A1 (en) 2003-12-24

Family

ID=29724505

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2003/002385 WO2003107538A1 (en) 2002-06-14 2003-05-27 Decoding logic for generating a n-bit binary output signal on the basis of an intermediate n-bit gray signal

Country Status (2)

Country Link
AU (1) AU2003232411A1 (en)
WO (1) WO2003107538A1 (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE1284456B (en) * 1965-07-29 1968-12-05 Telefunken Patent Circuit arrangement for code conversion Gray-Dual
GB2223369A (en) * 1988-08-18 1990-04-04 Plessey Co Plc Analogue-to-digital converters
US4975698A (en) * 1989-12-08 1990-12-04 Trw Inc. Modified quasi-gray digital encoding technique
US5459466A (en) * 1995-02-23 1995-10-17 Tektronix, Inc. Method and apparatus for converting a thermometer code to a gray code
US5633636A (en) * 1995-10-02 1997-05-27 Analog Devices, Inc. Half-gray digital encoding method and circuitry

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE1284456B (en) * 1965-07-29 1968-12-05 Telefunken Patent Circuit arrangement for code conversion Gray-Dual
GB2223369A (en) * 1988-08-18 1990-04-04 Plessey Co Plc Analogue-to-digital converters
US4975698A (en) * 1989-12-08 1990-12-04 Trw Inc. Modified quasi-gray digital encoding technique
US5459466A (en) * 1995-02-23 1995-10-17 Tektronix, Inc. Method and apparatus for converting a thermometer code to a gray code
US5633636A (en) * 1995-10-02 1997-05-27 Analog Devices, Inc. Half-gray digital encoding method and circuitry

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
JOHNSSON S L ET AL: "ON THE CONVERSION BETWEEN BINARY CODE AND BINARY-REFLECTED GRAY CODE ON BINARY CUBES", IEEE TRANSACTIONS ON COMPUTERS, IEEE INC. NEW YORK, US, vol. 44, no. 1, 1995, pages 47 - 53, XP000526068, ISSN: 0018-9340 *

Also Published As

Publication number Publication date
AU2003232411A1 (en) 2003-12-31

Similar Documents

Publication Publication Date Title
US7814402B2 (en) Method and apparatus for digit-serial communications for iterative digital processing algorithms
US7755530B2 (en) Analog to digital converter with a series of delay units
JP2000278141A (en) Multiplexer
JP6085523B2 (en) Semiconductor device and method of operating semiconductor device
US7064689B2 (en) Encoder, decoder, and data transfer system
JPS6084015A (en) Synchronization up/down counter
CN111404550B (en) Analog-to-digital converter and clock generation circuit thereof
KR100344082B1 (en) A pulse-duration modulation wave generating circuit
JPWO2012120569A1 (en) Time difference digital conversion circuit and time difference digital converter having the same
JP3952274B2 (en) Parallel-series converter circuit and parallel-series converter method
JPWO2013018274A1 (en) Time difference adjusting circuit and time difference digital converter having the same
JP3259725B2 (en) Viterbi decoding device
WO2003107538A1 (en) Decoding logic for generating a n-bit binary output signal on the basis of an intermediate n-bit gray signal
JP3135990B2 (en) Parity addition circuit
JPH0918354A (en) Error detection code generator and error detector for cyclic redundancy checking system
JP2000232346A (en) Pulse width modulation waveform generation circuit
JP4230234B2 (en) Parity prediction circuit for full adder
US7519090B2 (en) Very high speed arbitrary number of multiple signal multiplexer
CN108182161B (en) Data processing system and method
KR20070069288A (en) Circuit for converting gray code
CN114826265A (en) Coarse-fine counting architecture of VCO-ADC (voltage controlled oscillator-analog converter) based on interlocking binary asynchronous counter
JP3418418B2 (en) Format conversion circuit
JP3353543B2 (en) Control signal generation circuit
JP2689539B2 (en) Divider
JPH0536292A (en) Shift register circuit

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PH PL PT RO RU SC SD SE SG SK SL TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP