← Back to Patent Explorer
EP0095923A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Communications scrambling systems

Assignee: Plessey Co Ltd
•
Filing: 1983-05-31
•
Granted: —
•
Expires: 2003-05-31
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Scrambled communications signalling uses signals as transmitted and received that are coded by reorganisation of binary words representing original information signals. That reorganisation not only produces different sequences of blocks of binary words but also provides for variation of the lengths and numbers of such blocks (via memori M 100-M 115) within each reorganisation. In addition the blocks are read out in reverse order to their storage, and the preferred organisation is via a logic type pseudo random generator that must be synchronised and «seeded» at both transmitter and receiver prior to any transmission.

Inventors

  • 👤 Kenneth Austin

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-31 19:06
CPC Classifications
H; H04; H04K; H04K1/00; H04K1/06

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 77 words
A method of scrambled communications signalling wherein signals as transmitted and received are in a coded form representing a reorganisation of original information signals made with reference to binary words representing successive original information components by reorganisation according to sequentially different organisations which organisations comprise variable lengths (numbers of binary words) and numbers of blocks of said binary words in variable sequences different from original information order so that said signals are time-different from said original signals.
Claim 2
Independent Claim 77 words
A method of scrambled communications signalling wherein signals as transmitted and received are in a coded form representing a reorganisation of original information signals made with reference to binary words representing successive original information components by reorganisation according to sequentially different organisations which organisations comprise variable lengths (numbers of binary words) and numbers of blocks of said binary words in variable sequences different from original information order so that said signals are time-different from said original signals.
Claim 3
Dependent Claim 32 words
A method according to claim 1, wherein binary word reorganisation is preceded by analogue-to-digital conversion and succeeded by digital to analogue conversion for communications using analogue coded signals from analogue original signals.
Claim 4
Dependent Claim 74 words
Transmitter apparatus for the method of claim 1 or claim 2 comprising a plurality of binary word stores for binary word outputs representing original information and corresponding to said blocks, means for defining effective word capacities of said stores and thus particularise block lengths for each said organisation and means for selectively defining a block order at least relative to reading binary words from said stores which order will correspond to a said organisation.
Claim 5
Dependent Claim 73 words
Receiver apparatus for the method of claim 1 or claim 2, comprising a plurality of binary word stores for binary words representing coded received signals, means for defining effective binary word capacities of said stores and thus particularise block lengths corresponding to block organisations at transmission coding, and means for selectively defining an order for reading binary words from said stores and thus particularise block orders in each block organisation at transmission coding.
Claim 6
Dependent Claim 22 words
Apparatus according to claim 3 or claim 4, comprising code input means for selectively setting a particular coded cyclic sequence of organisations.
Claim 7
Dependent Claim 15 words
Apparatus according to claim 5, comprising display means for showing and thus checking coded input.
Claim 8
Dependent Claim 31 words
Apparatus according to any one of claims 3 to 6, with provision for storing and reading operations relative to said stores to be in opposite directions for the same q tore.
Claim 9
Dependent Claim 23 words
Transceiver apparatus comprising apparatus according to any one of claims 3 to 7 with means for determining transmission and receiving codes of operation.
Claim 10
Dependent Claim 31 words
Apparatus according to any one of claims 3 to 8, wherein said stores comprise snappings on a random needs memory associated with a microprocessor programmed for required storing and reading operations.
Claim 11
Dependent Claim 25 words
Apparatus according to any one of claims 3 to 9, comprising tristate interfacing means for key- controlled data input lines also connected to display means.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag