Publication number | US3718863 A |

Publication type | Grant |

Publication date | Feb 27, 1973 |

Filing date | Oct 26, 1971 |

Priority date | Oct 26, 1971 |

Publication number | US 3718863 A, US 3718863A, US-A-3718863, US3718863 A, US3718863A |

Inventors | Fletcher J, Perlman M |

Original Assignee | Fletcher J, Perlman M |

Export Citation | BiBTeX, EndNote, RefMan |

Patent Citations (2), Referenced by (36), Classifications (15) | |

External Links: USPTO, USPTO Assignment, Espacenet | |

US 3718863 A

Abstract

A family of m-ary linear feedback shift registers with binary logic is disclosed. Each m-ary linear feedback shift register with binary logic generates a binary representation of a nonbinary recurring sequence, producable with a m-ary linear feedback shift register without binary logic in which m is greater than 2. The state table of a m-ary linear feedback shift register without binary logic, utilizing sum modulo m feedback, is first tabulated for a given initial state. The entries in the state table are coded in binary and the binary entries are used to set the initial states of the stages of a plurality of binary shift registers. A single feedback logic unit is employed which provides a separate feedback binary digit to each binary register as a function of the states of corresponding stages of the binary registers. The stages of the binary registers which are fed back depend upon the stages which are fed back through nonzero multipliers in the m-ary linear feedback shift register, utilizing sum modulo-m feedback.

Claims available in

Description (OCR text may contain errors)

United States Patent 1 Fletcher et al. 1 Feb. 27, 1973 [54] M-ARY LINEAR FEEDBACK SHIFT [57] ABSTRACT REGISTER WITH BINARY LOGIC A family of m-ary linear feedback shift registers with [76] Inventors: James C. Fletcher, Administrator of binary logic is disclosed. Each m-ary linear feedback the National Aeronautics and Space shift register with binary logic generates a binary Administration with respect to an representation of a nonbinary recurring sequence, invention of; Marvin Perlman, 1100 producable with a m-ary linear feedback shift register Dem se Ave., Granada Hills, Calif. without binary lo ic in which m is reater than 2. The

P Y g 8 91344 state table of a m-ary linear feedback shift re ister h b" l '1' d l f d wit out mary ogre, utiizmg sum mo uo m ee [22] Flled 1971 back, is first tabulated for a given initial state. The en- [21] Appl. No.: 192,101 tries in the state table are coded in binary and the binary entries are used to set theinitial states of the stages of a plurality of binary shift registers. A single [52] U.S.Cl. ..328/37, 307/221 R,332288//l6817, feedback logic unit is employed which provides a separate feedback binary digit to each binary register 2; l as a function of the states of corresponding stages of 1 o earcv the binary registers. The stages of the binary registers which are fed back dependupon the stages which are [56] References cued fed back through nonzero multipliers in the m-ary UNITED STATES PATENTS linear feedback shift register, utilizing sum modulo-m feedback. 3,069,657 12/1962 Green, Jr. et a1. ..307/221 R 3,439,279 4/1969 Guanella ..328/37 X 11 Claims, 12 Drawing Figures Primary Examiner-John Zazworsky Att0meyMonte F. Mott et a1.

PATENTEDFEBZ'HQ'IS SHEET 2 BF 6 ATTORNEYS PATENTED FEBZ 7 I973 SHEET 3 [IF 6 WFWW ATTORNEYS PATENTED 3,718,863

SHEET I 0F 6 F l G. 7

+modulo IO Fl G. 50

FEEDBACK LOGIC UNIT 32 Fl G. 6

k k-l k-I k-I k-l k-Z k-2 k-2 k-2 k "k k k o'o-o"o||oo| 0000 I O O O O O O O l O O O I 2 O O O I O O O O O O O l 3 O O O I O O O I O O l O 4 O O I O O O O I O O I I 5 O O I l O O l O O l O l e o 1 o I o o I o o o T I O O O O l O I O O l I 8 O O I I I O O O O O O I 9 O O O l O O I I O I O 0 IO 0 l O O O O O l O I O I INVENTOR.

ATTORNEYS PATENTED BZ 7 973 SHEET 8 OF 6 Fl 6. IO

k-l k-2 MARVIN PERLMAN INVENTOR.

M-ARY LINEAR FEEDBACK SHIFT REGISTER WITH BINARY LOGIC ORIGIN OF INVENTION The invention described herein was made in the performance of work under a NASA contract and is subject to the provisions of Section 305 of the National Aeronautics and Space Act of 1958, Public Law 85-568 (72 Stat. 435; 42 U.S.C. 2457).

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention is generally directed to linear feedback shift registers and, more particularly, to improvements therein.

2. Description of the Prior Art The availability of high speed and reliable two-state or binary devices, such as flip-flops or binary storage cores, has led to the development of presently known binary linear feedback shift registers which provide binary recurring sequences. Briefly, a binary linear feedback shift register, hereafter often referred to as a binary LFSR, comprises a plurality of stages, definable as r, and a feedback unit which performs the modulo-2 addition on selected outputs of the stages. It feeds back the modulo-2 sum to the registers input stage. When proper stages are selected for feedback the length of the resulting sequence is 21 and is referred to as a maximal length sequence. In the above expression 2 m, which is the number of states which each stage can assume.

Mathematically the present-day binary LFSR in which m=2, is one type of a large class of possible LFSRs in which m is equal to an integer greater than 1, i.e., m 2, 3, etc. The entire class can bedescribed generally as an m-ary linear feedback shift register or r stages with modulo-m feedback. Selected ones of the r stages are fed back through separate multipliers which multiply the stages outputs by appropriate factors of through (m 1). Clearly, when m 2, the m-ary linear feedback shift register is a binary LFSR. Hereafter a mary linear feedback shift register which will be referred to as a m-ary LFSR is one in which m is greater than 2, thereby excluding therefrom the binary LFSR case. In the m-ary LFSR when m is equal to p, a prime integer, by proper selection of the feedback stages and the multiplication factors, a maximal length sequence p"l can be generated for any p. When m is not a prime, shorter than maximal length sequences can be realized.

Whenever m is greater than 2, the resulting sequences are nonbinary recurring sequences. Such sequences have well understood properties and have wide potential use. Potential applications include ranging codes, error-detecting and error-correcting codes, counting scaling, prescribed sequence generation, memory paging, and associative memory organization.

To date nonbinary sequences have received little attention, since physical devices do not exist that are high speed and reliable and that are capable of assuming more than two states. Despite such hardware limitations the ability to generate nonbinary recurring sequences would represent a great advance in the state of the art.

OBJECTS AND SUMMARY OF THE INVENTION It is a primary object of the present invention to provide means for generating nonbinary recurring sequences.

Another object of the present invention is to provide nonbinary recurring sequences with state-of-the-art storage devices.

A further object of the invention is to provide a mary linear feedback shift register for generating nonbinary recurring sequences with binary logic elements.

Still a further object of the invention is to provide a novel method of generating a nonbinary recurring sequence with binary logic elements.

These and other objects of the invention are achieved by coding in binary the state of each register stage which may assume any of m states and the feedback digit which also may be of any one of m values of a m-ary LFSR, where m 2. The binary coded values provide a state or truth table used to design a plurality of parallel binary shift registers with interdependent feedback which simulate the behavior or the original m-ay LFSR. Generally the number of parallel shift registers is the number of binary bits needed for the binary representation of m. When m is the product of primes, the number of parallel binary registers is the sum of the numbers of binary digits required to represent the various primes.

The novel features of the invention are set forth with particularity in the appended claims. The invention will best be understood from the following description when read in conjunction with the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. l is a simple block diagram of a general linear feedback shift register;

FIG. 2 is a simple block diagram of a ternary LFSR without binary logic;

FIG. 3 is a state table of the register shown in FIG. 2 and its corresponding table in a binary code;

FIG. 4 is a block diagram of a ternary LFSR with binary logic in accordance with the present invention;

FIG. 5 is a state table of a lO-ary LFSR with sum modulo- 1 0 feedback;

' FIG. 5a is a block diagram of a IO-ary LFSR without binary logic, utilizing sum modulo-l0 feedback;

FIG. 6 is a table in which the entries at k 0 through k 10 in the table of FIG. 5 are coded in binary;

FIG. 7 is one embodiment of a 10-ary LFSR with binary logic;

FIG. 8 is a diagram useful in explaining another embodiment of a lO-ary LFSR;

FIGS. 9 and 10 recited state tables of the linear feedback shift registers 33 and 35 respectively shown in FIG. 8; and

FIG. 11 is a practical implementation of a 5-ary LFSR with binary logic, corresponding to register 35 of FIG. 8.

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention may best be understood by first describing a general linear feedback shift register, in which each register stage is capable of assuming any one ofm states, defined as states 0, l, m-l. Such a register is shown in FIG. 1. The register comprises r stages, a a,, connected through multipliers Cl Cr to a modulo-m feedback unit 12. Each of the multipliers may multiply the output of the state supplied thereto by any value from 0 to m 1. As is known the register is clocked by clock pulses from a clock to thereby cycle the LFSR through the states associated with a desired sequence. To simplify the following figures, the clock 15 is deleted from the rest of the figures. As is further known the length of the sequence depends on r, m and the multiplication factors of multipliers C1 through Cr, as well as the initial states of the stages of the register.

Clearly, if m is 2 the arrangement shown in FIG. 1 is a conventional linear feedback shift register in which each register stage stores a binary value, either a 0 or a l and is either connected or not connected to unit 12 which is a modulo-2 unit. That is, the arrangement of FIG. 1 is a binary LFSR. If, however, m is an integer, greater than 2, the arrangement of FIG. 1 can be thought of as a m-ary linear feedback shift register or simply a m-ary LFSR, since any stage can assume any of m states, and unit 12 is a modulo-m summer unit. Herebefore an m-ary LFSR could not be reduced to practice since to date there is no physical device which is capable of assuming any one of m states where m is greater than 2 yet be fast and reliable, as known binary devices.

The advantages of a m-ary LFSR if one could be built should be appreciated by those familiar with the art. A m-ary LFSR can provide nonbinary recurring sequences, not feasible with binary LFSRs. Also, sequences of lengths which fall between maximal length binary sequences can be generated with a m-ary LFSR. For example, with binary LFSRs of 3, 4, 5, 6, 7 and 8 stages, maximal length sequences of 7, 15, 31, 63, 127 and 255 states can be generated based on the formula 2'1, where r is the number of register stages. Yet, with a m-ary LFSR, in which m is a prime (m =p), maximal length sequences, falling between these values, could be generated. For example with m p 3, the maximal length sequence is 3' 1. Thus, with registers of 2, 3, 4 and 5 stages, sequences of 8, 26, 80 and 242 states can be generated. Clearly, with different values of m and r and different feedback connections, the number of sequences which could be generated is very great. However, herebefore none of these were practical due to the 2-state limitation of practical devices.

These limitations are eliminated by the present invention which enables the simulation of a m-ary LFSR with binary devices. The basic principles of the invention may best be highlighted with a specific example. Let it be assumed that it is desired to simulate the performance of a three stage ternary LFSR, such as the one shown in FIG. 2, wherein the three stages of register are designated as a a and a Therein, a represents the feedback digit from a mod-3 unit 22. Stage a is connected directly to unit 22 through C1 which provides a multiplication factor of l and a is connected through C3 which provides a multiplication factor of 2. Stage a,, of register 20 is not fed back to unit 22. Theoretically it can be thought of as being connected to unit 22 through a multiplier C2 (not shown) with a multiplication factor of zero.

The ternary linear recurrence relation can be expressed as:

a =a 2a,, mod 3.

5 The theoretical state table for such a ternary LFSR is charted in the first five columns from the left in FIG. 3. It is thus seen that for an initial state at 002 at time k 0, a maximal length sequence of 26 (0-25) can be theoretically generated.

In accordance with the present invention the state of each register stage and the feedback digit 0,, are coded in binary for each times k 0 through k 25. Since m 3 a 2-bit code is needed. The coded states and feedback digits are listed in the five columns from the right of FIG. 3. The entries under x and y represent the 2 binary digits of the entries under a x and y for the a entries, x and y,, for the a entries and x y for the a entries. Therein the xs entries represent the higher order digits and the ys entries the lower order digits of the binary representation.

In accordance with the present invention two parallel 3-bit binary shift registers X and Y are provided as shown in FIG. 4. The stages of register X are designated x x and x while those of register Y are designated y y and y The outputs of stages of the two registers, which correspond to stages of register 20 which are connected to unit 22 through multipliers with nonzero factors, i.e., through nonzero multipliers, are supplied to a feedback logic unit 25. The outputs of unit 25 are the feedbacks x and y to registers X and Y, respectively. Since in register 20 only stages a and a are fed back through nonzero multiplication factors, only stages x and x of register X and stages y,,., and y of register Y are fed back to unit 25 It is thus seen that x and y are functions of only four of the six stages of the two registers. They are provided by the logic unit 25 as a function of the combined states of these four stages, i.e., x x y and y,, For example, x is made a 1 only when the combined states of these four stages are in any one of 9 combinations at times k=4, 7,13, l4,l5,l8,l9, 21 and 23 and is O in all the others. Similarly, y is a 1 only for given combinations of these four stages and is a 0 for all others. It should be apparent to logic designers that x and y can be generated by considering each of the 26 combinations of the states of x x,. y and y separately. Preferably however, the states can be plotted on a Karnaugh chart or map to simplify the logic implementation.

It should be appreciated that the binary values of x and y, can be recoded by a coder 26 to generate the nonbinary recurring sequence a,,, while the outputs of corresponding stages of the two registers, such as x,, and y x and y and x and y,, can be recoded separately by coders 27, 28 and 29 to provide the nonbinary values of a a and a,,

It is thus seen that the arrangement, shown in FIG. 4', truly generates the sequence which would have been generated by the ternary LFSR, shown in FIG. 2, except that herein it is generated with two binary registers and with interconnected binary logic feedback. Therefore the arrangement shown in FIG. 4 can be thought of as a ternary LFSR with binary logic.

It should be appreciated that the invention is not limited to the single arrangement shown in FIG. 4. It is applicable to the simulation of any m-ary LFSR. Based on the desired sequence the state table for the m-ary LFSR is charted. Then it is coded in binary to determine successive stages associated with the sequence as well as the feedback digits which are then generated by a feedback logic control unit, designed to provide the proper feedback to each of the registers.

Mathematically it can be shown that when m is a product of two or more distinct primes, i.e., p -p etc., the selected recurrence relation for m can be decomposed into separate p recurrence relations which can be treated separately. For example, for m 10, a 10- ary LFSR can be implemented with four parallel binary registers, since 2 10 2, and with a single interconnected feedback unit with four feedback outputs, in a manner analogous to that of FIG. 4. However, since 10 2 X 5, the same sequence can be derived with one 2- ary LFSR, Le, a simple binary LFSR and with one 5- ary LFSR with binary logic, consisting of three parallel registers (2 5 2 with interconnected feedback. The latter arrangement may in some instances be preferred to simplify the complexity of the feedback logic.

These aspects may further be explained with specific examples. Assuming a cycle structure or nonbinary recurrence relation or sequence a a,, a,, mod-l and an initial state of 19, i.e., a l, a ,=9, it is clear that a state table can be provided therefore as shown in FIG. 5. Theoretically this nonbinary recurrence relation can be generated by a 10-ary LFSR 30 as shown in FIG. a wherein A represents a two-stage register, each stage capable of assuming any of states. Each of the stages is connected directly (multiplication factor of I to a feedback modulo-l0 summer 31.

The analogous sequence can be generated by coding each state and each feedback digit in binary, as represented in FIG. 6 shown only for k 0 through k 10. Each state is coded into a four-bit binary representation mnpq. Four registers M, N, P and Q are employed as shown in FIG. 7 with a feedback unit 32 which provides m n,,, p,, and q;, feedbacks to the four registers, to generate the binary coded sequence. Since in the theoretical lO-ary LFSR 30, shown in FIG. 5a, each of the stages of register A is fed back through a nonzero multiplier to the modulo-l0 summer 31, each of the stages of each of registers M, N, P and Q is fed back to unit 32. It is clear that unit 32 provides the feedbacks as a function of eight Boolean or state-variables.

This arrangement can be simplified by generating a cycle structure b,, b b mod-2 and a cycle structure d d,, +d,, mod-5 with an arrangement as shown in FIG. 8. The binary cycle structure is provided by a binary LFSR 33, consisting of a B register and a modulo-2 summer 34 and the cycle structure d,, d d,, mod-5 is theoretically provided by a 5-ary LFSR 35. The latter consists of a two stage register D, each stage capable of assuming any of 5 states and a modulo-5 summer 36. Since in the theoretically 10-ary LFSR of FIG. 5a each of the stages of register A are connected to the modulo-l0 summer, each of the two stages of each of registers B and D is connected to its associated summer. Each digit of the initial state 19 of register A is reduced modulo-2 to provide an initial state 11 for register B and is reduced modulo-5 to provide an initial state of 14 for register D.

The resulting truth table of the binary cycle of the binary LFSR 33 is shown in FIG. 9 and the state table of the S-ary LFSR 35 with its corresponding binary coded states and feedback digits are shown in FIG. 10. The S- ary LFSR 35 is implemented with binary registers X, Y and Z as shown in FIG. 11, and with a feedback unit 38 which provides only three feedbacks x y and z,,, as a function of only 6 states or values (of registers X, Y and Z). Thus, it is simpler than unit 32 of FIG. 7, which provides four outputs as a function of eight state-variables.

Attention is again directed to FIG. 5. The entries under a represent 60 steps or states of the infinite sequenceO,l,1,2,3,5,8,l3,21,34,55....kn0wnas the Fibonacci sequence, reduced modulo-10. According to the present invention, these states of the Fibonacci sequence may be generated by either the embodiment shown in FIG. 7 or by the 5-ary LFSR with binary logic, shown in FIG. 1 1, together with the binary LFSR 33 shown in FIG. 8. In either embodiment the feedback digits can be recoded into decimal digits to provide the various values of the Fibonacci sequence.

As is known the Fibonacci sequence has many useful properties. Among some of its applications are random number generation and sort merge strategy for data by means of a general, purpose digital computer. Thus the present invention provides means for generating a significant number of states in the Fibonacci sequence with binary logic elements.

Summarizing the foregoing description in accordance with the present invention, m-ary LFSRs with binary logic elements are provided to generate nonbinary recurring sequences. Based on the desired nonbinary recurring sequence which is theoretically producable by a register of r stages, each capable of assuming any of m states, with feedback of selected stages through nonzero multipliers which are modulom added to provide a feedback digit to the register, the sequences state table is produced. Each state therein and the feedback digit are coded in binary to provide a corresponding binary-coded sequence. A plurality of binary registers, equal in number to or greater than log m, each with r binary stages are employed. The states of corresponding stages of all the registers are supplied to a single feedback logic unit which provides a binary feedback digit to each of the registers. The combination of states of the registers cycles through a sequence of binary states which corresponds to the states associated with the nonbinary recurring sequence. The novel combination with a plurality of registers may also be thought of as a combination of equal length binary shift registers, with a feedback logic unit which provides a separate feedback binary digit to each register which is a function of the states of corresponding stages of all the registers.

The invention may further be summarized by expressing a nonbinary recurring sequence as Such a sequence can be generated theoretically by a m-ary LFSR without binary logic. Therein r represents the number of stages of the register. Each stage a,, is capable of assuming any of m states. a,, is the modulo m of the states of the stages which are fed back through nonzero multipliers c In accordance with the present invention such a sequence is practically implementable by a m-ary LFSR with binary logic. Such an arrangement includes W registers (W 2 log m), each of r binary stages, and a single feedback logic unit. The latter is supplied with corresponding stages of the W registers which correspond to the a,, stages with nonzero multipliers in the theoretical m-ary LFSR without binary logic utilizing sum modulo-m feedback. The single feedback logic unit provides a feedback binary digit to each of the W registers, with all the feedback bits representing a in binary, which can be coded into an m-type representation or code.

Although particular embodiments of the invention have been described and illustrated herein, it is recognized that modifications and variations may readily occur to those skilled in the art and consequently it is intended that the claims be interpreted to cover such modifications and equivalents.

What is claimed is:

l. A binary logic arrangement comprising:

a plurality of binary shift registers, each of r binary stages; and

feedback means coupled to corresponding stages of all of said registers for providing a separate feedback binary digit to each register as a function of the states of the stages coupled to said feedback means.

2. A binary logic arrangement as recited in claim 1 wherein each register stage is settable in a selected initial binary state, and means for clocking said registers stages to provide a binary sequence corresponding to a selected nonbinary recurring sequence.

3. A binary logic arrangement as recited in claim 2 wherein the number of registers is definable as W, W Z log p, wherein p is a distinct prime, greater than 2.

4. A binary logic arrangement as recited in claim 3 wherein the stages of said W registers are settable to selected initial binary states whereby the length of the sequence provided by said arrangement is pl.

5. A binary logic arrangement as recited in claim 2 wherein the number of registers is definable as W, W log m, wherein m is an integer greater than 2.

6. A m-ary linear feedback shift register for providing a recurring sequence, which is analogous to a nonbinary recurring sequence, in binary representation, wherein rn is an integer greater than 2, comprising:

a plurality of binary shift registers, each of r stages, with corresponding stages in said registers settable to initial binary states which are functions of the initial states of said nonbinary recurring sequence;

feedback means coupled to selected stages of said registers, with corresponding stages of said registers being coupled to said feedback means for providing a separate feedback binary digit to each of said registers as a function of the states of the stages connected thereto; and

means for clocking said registers whereby each register advances through a sequence of states, with the states of corresponding stages of said registers representing in binary a nonbinary recurring sequence, modulo-m.

7. The arrangement as recited in claim 6 wherein said nonbinary recurring sequence is definable as a being the sum modulo m of the states of a register, definable as A, of r stages, which are summed modulom through nonzero multipliers c each stage of register A being capable of assuming any of m states and the feedback binary digits provided by said feedback means representing 11,, in binary.

8. The arrangement as recited in claim 7 wherein the number of said binary registers is W, W Z log m, and said feedback means is coupled to corresponding stages of said W registers which correspond to stages a connected through nonzero multipliers for the modulo-m summation.

9. The arrangement as recited in claim 6 wherein m p, p being a prime integer and the nonbinary recurring sequence is definable as r a 2 oa mod 1) a representing the feedback digit from a feedback unit which provides the sum modulo-p of the states of a register definable as A of r stages, connected to the feedback unit through r multipliers, selected ones of said multipliers providing nonzero multiplication factors, each stage of the A register being capable of assuming any of p states, and a,, being fed back as the input to said A register, with the feedback binary digits from said feedback means representing a,, in binary.

10. The arrangement as recited in claim 9 wherein the number of said binary registers is W, W 2 log p, and said feedback means is coupled to the stages of each of said W registers which correspond to the stages of said A register which are connected to the feedback unit. Providing a,,, through nonzero multipliers.

11. The method of providing a binary representation of a nonbinary recurring sequence of the type providable by a m-ary linear feedback shift register comprising a register A of r states, each stage being capable of assuming any of m states and a feedback unit which provides a feedback digit, definable as a, which is a function of the states of selected stages connected to the feedback unit through nonzero multipliers, the steps comprising:

coding in binary states of said r stages and the a,, in

said nonbinary recurring sequence which starts from an initial state to which the r stages of said A register are set;

providing W binary shift registers, each of r states,

corresponding stages of said W registers being set to represent in binary the initial states of the r stages of said A register; and

providing a feedback binary digit to each of said W registers as a function of the states of selected stages of said W registers, whereby the feedback binary digits represent a in binary.

Patent Citations

Cited Patent | Filing date | Publication date | Applicant | Title |
---|---|---|---|---|

US3069657 * | Jun 11, 1958 | Dec 18, 1962 | Sylvania Electric Prod | Selective calling system |

US3439279 * | Nov 25, 1966 | Apr 15, 1969 | Patelhold Patentverwertung | Synchronizing system for random sequence pulse generators |

Referenced by

Citing Patent | Filing date | Publication date | Applicant | Title |
---|---|---|---|---|

US3911330 * | Aug 27, 1974 | Oct 7, 1975 | Nasa | Nonlinear nonsingular feedback shift registers |

US3963905 * | May 2, 1975 | Jun 15, 1976 | Bell Telephone Laboratories, Incorporated | Periodic sequence generators using ordinary arithmetic |

US3971998 * | May 2, 1975 | Jul 27, 1976 | Bell Telephone Laboratories, Incorporated | Recursive detector-oscillator circuit |

US4168582 * | Jan 26, 1976 | Sep 25, 1979 | General Electric Company | Radar terrain signal simulator |

US7002490 | Sep 8, 2004 | Feb 21, 2006 | Ternarylogic Llc | Ternary and higher multi-value digital scramblers/descramblers |

US7218144 | Nov 30, 2004 | May 15, 2007 | Ternarylogic Llc | Single and composite binary and multi-valued logic functions from gates and inverters |

US7355444 | Mar 15, 2007 | Apr 8, 2008 | Ternarylogic Llc | Single and composite binary and multi-valued logic functions from gates and inverters |

US7505589 | Aug 6, 2004 | Mar 17, 2009 | Temarylogic, Llc | Ternary and higher multi-value digital scramblers/descramblers |

US7548092 | Dec 26, 2007 | Jun 16, 2009 | Ternarylogic Llc | Implementing logic functions with non-magnitude based physical phenomena |

US7562106 | Dec 20, 2004 | Jul 14, 2009 | Ternarylogic Llc | Multi-value digital calculating circuits, including multipliers |

US7580472 | Feb 25, 2005 | Aug 25, 2009 | Ternarylogic Llc | Generation and detection of non-binary digital sequences |

US7643632 | Sep 8, 2004 | Jan 5, 2010 | Ternarylogic Llc | Ternary and multi-value digital signal scramblers, descramblers and sequence generators |

US7696785 | Dec 19, 2008 | Apr 13, 2010 | Ternarylogic Llc | Implementing logic functions with non-magnitude based physical phenomena |

US7786905 * | Oct 31, 2008 | Aug 31, 2010 | International Business Machines Corporation | Modulation coding and decoding |

US7786906 * | Oct 31, 2008 | Aug 31, 2010 | International Business Machines Corporation | Modulation coding and decoding |

US7864079 | Aug 26, 2010 | Jan 4, 2011 | Ternarylogic Llc | Ternary and higher multi-value digital scramblers/descramblers |

US8374289 | Jul 14, 2009 | Feb 12, 2013 | Ternarylogic Llc | Generation and detection of non-binary digital sequences |

US8577026 | Dec 29, 2010 | Nov 5, 2013 | Ternarylogic Llc | Methods and apparatus in alternate finite field based coders and decoders |

US8589466 | Feb 15, 2011 | Nov 19, 2013 | Ternarylogic Llc | Ternary and multi-value digital signal scramblers, decramblers and sequence generators |

US20050053240 * | Aug 6, 2004 | Mar 10, 2005 | Peter Lablans | Ternary and higher multi-value digital scramblers/descramblers |

US20050084111 * | Sep 8, 2004 | Apr 21, 2005 | Peter Lablans | Ternary and higher multi-value digital scramblers/descramblers |

US20050184888 * | Feb 25, 2005 | Aug 25, 2005 | Peter Lablans | Generation and detection of non-binary digital sequences |

US20050185796 * | Sep 8, 2004 | Aug 25, 2005 | Peter Lablans | Ternary and multi-value digital signal scramblers, descramblers and sequence generators |

US20050194993 * | Nov 30, 2004 | Sep 8, 2005 | Peter Lablans | Single and composite binary and multi-valued logic functions from gates and inverters |

US20060021003 * | Jun 23, 2005 | Jan 26, 2006 | Janus Software, Inc | Biometric authentication system |

US20060031278 * | Dec 20, 2004 | Feb 9, 2006 | Peter Lablans | Multi-value digital calculating circuits, including multipliers |

US20070110229 * | Jan 2, 2007 | May 17, 2007 | Ternarylogic, Llc | Ternary and Multi-Value Digital Signal Scramblers, Descramblers and Sequence of Generators |

US20070152710 * | Mar 15, 2007 | Jul 5, 2007 | Peter Lablans | Single and composite binary and multi-valued logic functions from gates and inverters |

US20090060202 * | Nov 4, 2008 | Mar 5, 2009 | Peter Lablans | Ternary and Higher Multi-Value Digital Scramblers/Descramblers |

US20090115647 * | Oct 31, 2008 | May 7, 2009 | International Business Machines Corporation | Modulation coding and decoding |

US20090115648 * | Oct 31, 2008 | May 7, 2009 | International Business Machines Corporation | Modulation coding and decoding |

US20090128190 * | Dec 19, 2008 | May 21, 2009 | Peter Lablans | Implementing Logic Functions with Non-Magnitude Based Physical Phenomena |

US20100164548 * | Feb 23, 2010 | Jul 1, 2010 | Ternarylogic Llc | Implementing Logic Functions With Non-Magnitude Based Physical Phenomena |

US20100322414 * | Aug 26, 2010 | Dec 23, 2010 | Ternarylogic Llc | Ternary and higher multi-value digital scramblers/descramblers |

US20110064214 * | Nov 23, 2010 | Mar 17, 2011 | Ternarylogic Llc | Methods and Apparatus in Alternate Finite Field Based Coders and Decoders |

US20110170697 * | Feb 15, 2011 | Jul 14, 2011 | Ternarylogic Llc | Ternary and Multi-Value Digital Signal Scramblers, Decramblers and Sequence Generators |

Classifications

U.S. Classification | 377/67, 377/72, 377/75 |

International Classification | H03M13/00, G06F7/58, H03M13/15 |

Cooperative Classification | G06F2207/583, G06F7/584, G06F2207/581, G06F7/586, G06F2207/582, H03M13/15 |

European Classification | G06F7/58P3, H03M13/15, G06F7/58P1 |

Rotate