WO1983003723A1 - Non-linear logic module for increasing complexity of bit sequences - Google Patents

Non-linear logic module for increasing complexity of bit sequences

Info

Publication number
WO1983003723A1
WO1983003723A1 PCT/US1982/000429 US8200429W WO1983003723A1 WO 1983003723 A1 WO1983003723 A1 WO 1983003723A1 US 8200429 W US8200429 W US 8200429W WO 1983003723 A1 WO1983003723 A1 WO 1983003723A1
Authority
WO
Grant status
Application
Patent type
Prior art keywords
register
bit
length
registers
figure
Prior art date
Application number
PCT/US1982/000429
Other languages
French (fr)
Inventor
Inc. Motorola
Edward J. Groth, Jr.
Original Assignee
Motorola Inc
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

Links

Classifications

    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03KPULSE TECHNIQUE
    • H03K3/00Circuits for generating electric pulses; Monostable, bistable or multistable circuits
    • H03K3/84Generating pulses having a predetermined statistical distribution of a parameter, e.g. random pulse generators

Abstract

A logic system for implementation of a feed-forward non-linear generator for producing a plurality of programmable complex sequences from an input bit stream (56).

Description

NON-LINEAR LOGIC MODULE FOR INCREASING COMPLEXITY OF BIT SEQUENCES

Field of the Invention

The invention relates to a non-linear logic module for generating complex bit sequences.

Background of the Invention

Complex binary digital sequences are useful in secure code generators, error correcting code generators, anti-jam circuits and other spread spectrum systems. In Generation of Binary Sequences With Controllable Complexity, IEEE Transactions on Information Theory, Vol. IT-17, No. 3, May 1971, by E.J. Groth, a concept was set forth for generating pseudo random bit strings with controllable complexity by means of combinations of shift registers of variable span combined with multipliers and modulo-two adders. Particular sequencing rules are set out in that paper which provide useful configurations for non-linear generators.

It is desirable in such systems to be able to vary the complexity of the sequences. One means for accomplishing this flexibility is to connect a variety of shift register logic elements to a given shift register by means of a crossbar or other complex switching network, in order to develop a series of different non-linear feed forward generators which meet the criteria of the IEEE Transactions paper, supra. This sort of system suffers when high operating speed is necessary to system requirements. In this case, the complexity of the physical configuration limits system speed and the system becomes inoperable.

Another desirable feature of such a system would allow rapid switching from one complexity or sequence to another. Any switching system incorporating relatively long wire lengths, as in a crossbar switching network, would also be

O restrictive in terms of switching time due to excessive capacitive loading.

A system for meeting optimum system requirements clearly requires the following sub-requirements to be observed:

1) A maximum number of multipliers must be available to the system,

2) Every span used in a given register complex must be unique, and 3) There must be no common connections in the register complex.

Summary of the Invention

The above requirements are met and shortcomings remedied by means of the instant invention by the use of a plurality of a maximum number of variable length - fixed length pairs of registers, each pair having both a serial and multiplied interconnection and all pairs being combined modulo-two at their outputs, meeting the three step criteria, supra, for maximum flexibility and flexibility of control.

It is, therefore, an object of the invention to combine modulo-two the outputs of a plurality of register pairs so that one register of each pair is-of selectable variable length and the other register of the pair is of fixed length and so that no two of the plurality of fixed length registers are of the same length and so that no two of the plurality of -variable length registers are of the same length.

It is another object' of the invention to provide a plurality of register pairs of fixed and variable length wherein the maximum variable length plus the fixed register length in each pair is equal to the same total pair length of every other pair in the system, the output of each pair being added modulo-two with the outputs of all other pairs in the plurality of pairs of registers to form a binary sequence output of variable complexity.

It is still another object of the invention to provid a plurality of register pairs in which the first segment o each pair is of variable length and the second segment of each pair is of fixed length; means being supplied to enable efficient control of the length of each of the variable register segments.

These and other objects of the invention will become more readily understood upon study of the Detailed

Description of the Invention together with the accompanying drawings in which:

FIGURE 1 is a block diagram of a preferred embodiment of the invention utilizing 14 bit length segmented registers?

FIGURE 2 is a table of one-half the permitted sequence combinations for the 14 bit generators of FIGURE 1; and

FIGURE 3 is a partial schematic diagram of the block diagram of FIGURE 1.

Detailed Description of the Invention

Referring first to FIGURE 1, it may be seen that, in block diagram form, the invention comprises segmented programmable registers 10, 16, 22, 28, 34, 40 and 46 (clock inputs not shown) . Each of the segmented registers comprises a fixed length portion and a programmable variable length portion. For example, register 10 comprises variable length portion 12 and fixed length portion 14. Fixed portion 14 determines the span of delay (in clock periods) between the two sequences to be combined in, for example, multiplier 54. Of course, the length of the registers of FIGURE 1 are for example only; the length and number of registers being variable to suit a particular application. Note that fixed length portions 14, 20, 26, 32, 38, 44 and 50 of registers 10, 16, 22, 28, 34, 40 and

O 46 have lengths of 2, 3, 4, 5, 6, 7 and 8 bits, respectively. A bit introduced at node 52 of register 10 produces an immediate input to AND gate 54 and an input delayed by two clock times via register portion 14. In the illustration of FIGURE 1, programmable portion 12 of register 10 is arranged to delay an input bit at node 56 by two clock times at node 52. Of course, other delay times may have been programmed into register portion 12 by using a different output point for wire 58. For example, if eighth stage 60 of register 12 had been utilized for the output into wire 58, the delay in transit of a bit from input node 56 to node 52 through register segment 12 would have been 8 clock times. Similarly, the other programmable register portions 18, 24, 30, 36, 42 and 48 may be programmed by selection of given register stages from which outputs to wires 62, 64, 66, 68, 70 and 72, respectively would be derived. In order to satisfy the complex binary digital number generation scheme according to Generation of Binary Sequences With Controllable Complexity, supra, a different tap point is selected for each of the register portions 12, 18, 24, 30, 36, 42 and 48. Now, looking at register portion 12, part of register 10 of FIGURE 1, it may be seen that there are 12 numbered stages there. Since no two full registers may have a tap point at the twelfth stage there is no need to have any other programmable register portion as long as register 12. Similarly, there is no need for any other programmable register portion to be as long as register portion 18, which has 11 stages. And so forth. Therefor, each register portion 12, 18, 24, 30, 36, 42 and 48 is of a unique length but all lengths from 6 through 12 stages are represented. The shorter length programmable registers are associated with the lengthier fixed length registers and vice versa. This allows all possible combinations of bit timing since the programmable register length sets the position of the first bit of each bit pair in the output word and the fixed register associated with any given programmable register sets the spacing between that bit pair. A bit pair is defined as a given bit and its delayed counterpart. It ma be noted that any given combination of programmable and fixed delay must not exceed the total word length.

Therefore, in the case illustrated in FIGURE 2 (a 14 bit output word), the sum of the maximum programmable register bit delay length and the fixed register bit delay length, therewith associated, need not exceed 14. This may be see more-clearly by inspection of the Table of FIGURE 2. In sequence numbers 1 through 10 (right-hand column 100), bit 1 appears in positions one and three. (Bit 1 refers to the first input bit in the bit stream 74 applied to the inputs of the programmable registers. (See FIGURE 1.) Bit 2 is the second bit in that stream, and so forth.) This means that there is no delay for the first bit of this pair and the second bit of the pair is delayed two clock times. Since every programmable register has at least a one bit delay, the delay generated if the first output bit is tapped from the first delay stage of the programmable register, this one stage delay is a reference delay and may be considered as zero delay. Of course, alternatively, the input bit could be programmed as the first output bit with no delay and some register stages would be eliminated in such a configuration.

Referring again to FIGURE 2, it will be seen that bit 2 appears in positions four and seven of sequence number 1, reference numeral 100. This means that the programmable register for the bit 2 pair is arranged for a four clock time delay; that is, the output of the programmable register is taken from the fifth stage. The associated fixed length register must then be the three stage fixed length register (20, if the scheme of FIGURE 1 is used) to provide the second bit of the pair in the seventh position. This logic may be extended for determination of all programmable register-fixed register combinations for any given sequence number of the table of FIGURE 2. The table of FIGURE 2 shows 26 sequences. There are also 26 more reverse sequences, which are not shown, for a total of 52 sequences. Of course, other complex sequences are possible as will be well understood by one having skill in this art. (The reader is again directed to Generation of Binary Sequences With Controllable Complexity, supra. ) The partial block diagram of FIGURE 1 also includes multipliers such as 54 and "exclusive OR" adders such as 76 for combining the programmable and fixed register portion outputs and for combining, modulo-two, the outputs of the plurality of segmented registers 10, 16, 22, 28, 34, 40 and 46, for example. A spare input 80 to one of the modulo-two adders, such as 78, may be provided for the purpose of combining the output bit stream of the system of FIGURE 1 with another bit stream. This may sometimes be desirable where combination with an equally balanced 0-1 bit stream is required, for example.

A preferred embodiment of the partial block diagram of FIGURE 1 is shown in schematic diagram form in FIGURE 3. A typical segmented register is shown, 200, 202. Switches 204, 206 are connected to the output of each stage 203, 205 of programmable segment 200. Switch control register 208 is a static shift register in which a key word may be stored. This key word comprises all "zero" bits except for- a single "one". The single "one" bit in register 208 enables only one of the switches (such as 204 and 206) and thus determines which stage of programmable register 200 will supply the output to multiplier 210 and to input 212 of fixed length register 202. Clock lines CLK 01 and CLK 02 supply clock signals for operation of registers 200, 202 and all other such registers. For each pair of clock signals, registers 200, 202 shift input bit stream 214 one stage to the right. The other segmented registers of FIGURE 3 may also be programmed and operate in a similar fashion. Exclusive OR gates, such as 216, 218 and 220 serve to add the outputs of the segmented registers, modulo-two and provide the required output sequences at terminal 222 in response to the setting of a given key word into the various static shift registers such as 208. Static shift registers, such as 208, may be loaded either serially or in parallel fashion, but they are shown loaded serially in FIGURE 3. If loaded in parallel, the key words may be changed between clock pulse inputs to the segmented registers and new complex sequences may be generated "on-the-fly". Of course, other systems for switching the variable register segment lengths might also be employed. For example, simple mechanical switches might be utilized (not shown). The art of developing efficient complex sequences which indicate the key words which lead to these sequences, is taught in the prior art. Generation of Binary Sequences With Controllable Complexity, supra.

While the invention has been particularly shown and described with reference to a preferred embodiment thereof, it will be understood by those skilled in the art that various other modifications and changes may be made to the present invention from the principles of the invention described above without departing from the spirit and scope thereof, as encompassed in the accompanying claims. Therefore-, it is intended in the appended claims to- cover • all such equivalent variations as come within the scope of the invention as described.

Claims

Claims
1. A non-linear digital generator circuit for producing controllably complex bit sequences comprising in combination: a plurality of shift registers each being of predetermined bit length, each of said plurality of shift registers comprising: a first segmented portion being controllable as to a bit delay length between an input thereto and an output thereof; and a second segmented portion having a fixed bit length for implementing a predetermined span between an input thereto and an output thereof, said input being derived from said output of said first segmented portion; means for controlling said bit length of each of said plurality of first segmented portions of said plurality of shift registers; a plurality of means for combining said inputs and outputs of each of said second segmented portions, each of said combining means having an output thereof; and means for modulo-two adding said outputs of said plurality of said combining means.
2. The circuit according to claim 1 further comprising an optional input to said modulo-two adding means for inputting a bit string.
PCT/US1982/000429 1982-04-05 1982-04-05 Non-linear logic module for increasing complexity of bit sequences WO1983003723A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/US1982/000429 WO1983003723A1 (en) 1982-04-05 1982-04-05 Non-linear logic module for increasing complexity of bit sequences

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
JP50156282A JPS59500543A (en) 1982-04-05 1982-04-05
EP19820901569 EP0105258A1 (en) 1982-04-05 1982-04-05 Non-linear logic module for increasing complexity of bit sequences
PCT/US1982/000429 WO1983003723A1 (en) 1982-04-05 1982-04-05 Non-linear logic module for increasing complexity of bit sequences

Publications (1)

Publication Number Publication Date
WO1983003723A1 true true WO1983003723A1 (en) 1983-10-27

Family

ID=22167917

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1982/000429 WO1983003723A1 (en) 1982-04-05 1982-04-05 Non-linear logic module for increasing complexity of bit sequences

Country Status (3)

Country Link
EP (1) EP0105258A1 (en)
JP (1) JPS59500543A (en)
WO (1) WO1983003723A1 (en)

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3691472A (en) * 1967-06-26 1972-09-12 Ericsson Telefon Ab L M Arrangement for the generation of pulses appearing as pseudo-random numbers
US3831013A (en) * 1973-02-20 1974-08-20 Us Navy Correlators using shift registers
US3911216A (en) * 1973-12-17 1975-10-07 Honeywell Inf Systems Nonlinear code generator and decoder for transmitting data securely
US3911330A (en) * 1974-08-27 1975-10-07 Nasa Nonlinear nonsingular feedback shift registers
US3946247A (en) * 1971-11-05 1976-03-23 Texas Instruments Inc. Analogue shift register correlators
US3947705A (en) * 1974-10-24 1976-03-30 Texas Instruments Inc. Method and system for achieving and sampling programmable tap weights in charge coupled devices
US3968454A (en) * 1944-09-27 1976-07-06 Bell Telephone Laboratories, Incorporated Signaling circuit
US4032763A (en) * 1974-10-31 1977-06-28 Licentia Patent-Verwaltungs-Gmbh Production of pseudo-random binary signal sequences
US4038565A (en) * 1974-10-03 1977-07-26 Ramasesha Bharat Frequency divider using a charged coupled device
US4115657A (en) * 1976-11-11 1978-09-19 Datotek, Inc. Random digital code generator

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3968454A (en) * 1944-09-27 1976-07-06 Bell Telephone Laboratories, Incorporated Signaling circuit
US3691472A (en) * 1967-06-26 1972-09-12 Ericsson Telefon Ab L M Arrangement for the generation of pulses appearing as pseudo-random numbers
US3946247A (en) * 1971-11-05 1976-03-23 Texas Instruments Inc. Analogue shift register correlators
US3831013A (en) * 1973-02-20 1974-08-20 Us Navy Correlators using shift registers
US3911216A (en) * 1973-12-17 1975-10-07 Honeywell Inf Systems Nonlinear code generator and decoder for transmitting data securely
US3911330A (en) * 1974-08-27 1975-10-07 Nasa Nonlinear nonsingular feedback shift registers
US4038565A (en) * 1974-10-03 1977-07-26 Ramasesha Bharat Frequency divider using a charged coupled device
US3947705A (en) * 1974-10-24 1976-03-30 Texas Instruments Inc. Method and system for achieving and sampling programmable tap weights in charge coupled devices
US4032763A (en) * 1974-10-31 1977-06-28 Licentia Patent-Verwaltungs-Gmbh Production of pseudo-random binary signal sequences
US4115657A (en) * 1976-11-11 1978-09-19 Datotek, Inc. Random digital code generator

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
IEEE Transactions on Information Theory, issued 03 May 1971, GROTH, Generation of Binary Sequences with Controllable Complexity *

Also Published As

Publication number Publication date Type
JPS59500543A (en) 1984-03-29 application
EP0105258A1 (en) 1984-04-18 application

Similar Documents

Publication Publication Date Title
US3553446A (en) Carry determination logic
US3691472A (en) Arrangement for the generation of pulses appearing as pseudo-random numbers
US6025744A (en) Glitch free delay line multiplexing technique
US6618698B1 (en) Clustered processors in an emulation engine
US3795864A (en) Methods and apparatus for generating walsh functions
US5321368A (en) Synchronized, digital sequential circuit
US6353842B1 (en) Method for synthesizing linear finite state machines
US4979173A (en) Burst mode error detection and definition
US5535402A (en) System for (N•M)-bit correlation using N M-bit correlators
US5548775A (en) System and method for adaptive active monitoring of high speed data streams using finite state machines
US5546545A (en) Rotating priority selection logic circuit
US5943248A (en) w-bit non-linear combiner for pseudo-random number generation
US6816876B2 (en) Apparatus and method for modifying an M-sequence with arbitrary phase shift
US4797848A (en) Pipelined bit-serial Galois Field multiplier
US5534796A (en) Self-clocking pipeline register
US6188240B1 (en) Programmable function block
US5257218A (en) Parallel carry and carry propagation generator apparatus for use with carry-look-ahead adders
US3700869A (en) Pseudonoise sequence generators with three-tap linear feedback shift registers
US4860353A (en) Dynamic feedback arrangement scrambling technique keystream generator
US20040049723A1 (en) Semiconductor integrated circuit with a test circuit
US6170032B1 (en) Priority encoder circuit
US5111455A (en) Interleaved time-division multiplexor with phase-compensated frequency doublers
US5487025A (en) Carry chain adder using regenerative push-pull differential logic
US4723243A (en) CRC calculation machine with variable bit boundary
US4525797A (en) N-bit carry select adder circuit having only one full adder per bit

Legal Events

Date Code Title Description
AK Designated states

Designated state(s): JP

AL Designated countries for regional patents

Designated state(s): CH DE

WWE Wipo information: entry into national phase

Ref document number: 1982901569

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1982901569

Country of ref document: EP

WWW Wipo information: withdrawn in national office

Ref document number: 1982901569

Country of ref document: EP