EP0105258A1 - Nichtlineares logisches modul zum vergrössern der komplexität von bit-sequenzen - Google Patents

Nichtlineares logisches modul zum vergrössern der komplexität von bit-sequenzen

Info

Publication number
EP0105258A1
EP0105258A1 EP19820901569 EP82901569A EP0105258A1 EP 0105258 A1 EP0105258 A1 EP 0105258A1 EP 19820901569 EP19820901569 EP 19820901569 EP 82901569 A EP82901569 A EP 82901569A EP 0105258 A1 EP0105258 A1 EP 0105258A1
Authority
EP
European Patent Office
Prior art keywords
bit
register
length
registers
output
Prior art date
Legal status (The legal status 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 status listed.)
Withdrawn
Application number
EP19820901569
Other languages
English (en)
French (fr)
Inventor
Edward J. Groth, Jr.
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Motorola Solutions Inc
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
Application filed by Motorola Inc filed Critical Motorola Inc
Publication of EP0105258A1 publication Critical patent/EP0105258A1/de
Withdrawn legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H03ELECTRONIC 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

Definitions

  • the invention relates to a non-linear logic module for generating complex bit sequences.
  • 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.
  • 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;
  • FIGURE 3 is a partial schematic diagram of the block diagram of FIGURE 1.
  • 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.
  • 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.
  • 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.
  • programmable portion 12 of register 10 is arranged to delay an input bit at node 56 by two clock times at node 52.
  • other delay times may have been programmed into register portion 12 by using a different output point for wire 58.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • bit 2 appears in positions four and seven of sequence number 1, reference numeral 100.
  • 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.
  • 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.
  • multipliers such as 54
  • "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.
  • FIGURE 3 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.
  • 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".
  • variable register segment lengths might also be employed.
  • 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.

Landscapes

  • Compression, Expansion, Code Conversion, And Decoders (AREA)
EP19820901569 1982-04-05 1982-04-05 Nichtlineares logisches modul zum vergrössern der komplexität von bit-sequenzen Withdrawn EP0105258A1 (de)

Applications Claiming Priority (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

Publications (1)

Publication Number Publication Date
EP0105258A1 true EP0105258A1 (de) 1984-04-18

Family

ID=22167917

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19820901569 Withdrawn EP0105258A1 (de) 1982-04-05 1982-04-05 Nichtlineares logisches modul zum vergrössern der komplexität von bit-sequenzen

Country Status (3)

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

Family Cites Families (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
GB1190809A (en) * 1967-06-26 1970-05-06 Ericsson Telefon Ab L M Improvements in and relating to the Generation of a Pulse Code
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
NO141294C (no) * 1974-10-31 1980-02-06 Licentia Gmbh Fremgangsmaate ved frembringelse av slumpartede binaertegnfoelger
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
See references of WO8303723A1 *

Also Published As

Publication number Publication date
WO1983003723A1 (en) 1983-10-27
JPS59500543A (ja) 1984-03-29

Similar Documents

Publication Publication Date Title
US4472788A (en) Shift circuit having a plurality of cascade-connected data selectors
US4682303A (en) Parallel binary adder
JP2006521730A (ja) 巡回冗長検査(crc)計算のための反復回路を最適化するためのシステムおよび方法
US5483478A (en) Method and structure for reducing carry delay for a programmable carry chain
US4325129A (en) Non-linear logic module for increasing complexity of bit sequences
US9166795B2 (en) Device and method for forming a signature
JP4195195B2 (ja) シーケンス発生器
US5761265A (en) Parallel architecture for generating pseudo-random sequences
US5636157A (en) Modular 64-bit integer adder
US4775810A (en) Parity check logic circuit
US6751773B2 (en) Coding apparatus capable of high speed operation
JP2577896B2 (ja) m系列符号発生器
US3781822A (en) Data rate-changing and reordering circuits
JP2577914B2 (ja) m系列符号発生器
US7024445B2 (en) Method and apparatus for use in booth-encoded multiplication
US3992612A (en) Rate multiplier
US3474413A (en) Parallel generation of the check bits of a pn sequence
US4704701A (en) Conditional carry adder for a multibit digital computer
EP0105258A1 (de) Nichtlineares logisches modul zum vergrössern der komplexität von bit-sequenzen
JPS62231333A (ja) モジユロ2加算器
US5608741A (en) Fast parity generator using complement pass-transistor logic
JPS6318835A (ja) M系列符号発生装置
KR100203742B1 (ko) 멀티플렉스를 이용한 가산기
US5237597A (en) Binary counter compiler with balanced carry propagation
KR0139335B1 (ko) 랜덤 코드 제너레이터

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 19831203

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): CH DE LI

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN

18W Application withdrawn

Withdrawal date: 19851024

RIN1 Information on inventor provided before grant (corrected)

Inventor name: GROTH, EDWARD J., JR.