EP0039150A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Methods of and apparatuses for processing binary data
Assignee: Sony Corp
•
Filing: 1981-04-07
•
Granted: —
•
Expires: 2001-04-07
Abstract
Abstract Frame information is recovered from a stream of binary data formed at a transmitter (1) from a block of m xn information bits comprising m groups of n bits plus m parity bits, one for each said group of n bits, these parity bits having then been scrambled by performing an exclusive-OR operation in a gate (5) on each parity bit with a respective bit of an m-bit parity scrambling code, said block of bits together with the scrambled parity bits forming a frame for transmission over a transmission link (3). At a receiver (2) new parity bits are produced in a parity bit generator (9) at the incoming bit rate from the incoming stream of binary data by forming a new parity bit from each successive moving group of n +1 incoming bits. The new parity bits are cyclically distributed to n + 1 m-bit shift registers (10,11,12,13), and a framing signal is produced when one of the shift registers (10,11,12,13) holdsm bits substantially corresponding to the m bits of the parity scrambling code.
Inventors
- 👤 James Hedley Wilkinson
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-25 21:06
CPC Classifications
H; H04; H04L; H04L7/00; H04L7/04; H04L7/048
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
180 words
A method of recovering frame information from a stream of binary data, the method comprising: deriving a block of m x n information bits comprising m groups of n bits; forming m parity bits, one for each said group of n bits; scrambling said parity bits by performing a logic operation (5) on each said parity bit with a respective bit of an m-bit parity scrambling code, said block of bits together with said scrambled parity bits forming a frame for transmission over a transmission link (3); at the remote end of said transmission link (3) forming new parity bits at the incoming bit rate (9) from the incoming stream of binary data by forming a new parity bit from each successive moving group of n+1 incoming bits; distributing said new parity bits cyclically to n+1 bit storage means (10, 11, 12, 13) each capable of storing m bits; and generating (19) a framing signal when one of said bit storage means (10, 11, 12, 13) holds m bits substantially corresponding to the m bits of said parity scrambling code.
Claim 2
Independent Claim
180 words
A method of recovering frame information from a stream of binary data, the method comprising: deriving a block of m x n information bits comprising m groups of n bits; forming m parity bits, one for each said group of n bits; scrambling said parity bits by performing a logic operation (5) on each said parity bit with a respective bit of an m-bit parity scrambling code, said block of bits together with said scrambled parity bits forming a frame for transmission over a transmission link (3); at the remote end of said transmission link (3) forming new parity bits at the incoming bit rate (9) from the incoming stream of binary data by forming a new parity bit from each successive moving group of n+1 incoming bits; distributing said new parity bits cyclically to n+1 bit storage means (10, 11, 12, 13) each capable of storing m bits; and generating (19) a framing signal when one of said bit storage means (10, 11, 12, 13) holds m bits substantially corresponding to the m bits of said parity scrambling code.
Claim 3
Dependent Claim
19 words
A method according to claim 1 wherein said parity scrambling code is a predetermined random sequence of m bits.
Claim 4
Dependent Claim
18 words
A method according to claim 1 or claim 2 wherein said logic operation (5) is an exclusive-OR operation.
Claim 5
Dependent Claim
30 words
A method according to claim 1, claim 2 or claim 3 wherein said parity bit is an even parity bit and said new parity bit is an even parity bit.
Claim 6
Independent Claim
14 words
A method according to any one of the preceding claims wherein m is fifteen.
Claim 7
Dependent Claim
13 words
A method according to claim 5 wherein said parity scrambling code is 010100001110110.
Claim 8
Independent Claim
14 words
A method according to any one of the preceding claims wherein n is three.
Claim 9
Dependent Claim
191 words
Apparatus for recovering frame information from a stream of binary data, the apparatus comprising: means for deriving a block of m x n information bits comprising m groups of n bits; first parity bit forming means for forming m parity bits, one for each said group of n bits; means (5) for scrambling said parity bits by performing a logic operation on each said parity bit with a respective bit of an m-bit parity scrambling code, said block of bits together with said scrambled parity bits forming a frame for transmission over a transmission link (3); second parity bit forming means (9) at the remote end of said transmission link for forming new parity bits at the incoming bit rate from the incoming stream of binary data by forming a new parity bit from each successive moving group of n+1 incoming bits; n+1 m-bit shift registers (10, 11, 12, 13) to which said new parity bits are cyclically distributed; and means (19) for generating a framing signal when one of said shift registers (10, 11, 12, 13) holds m bits substantially corresponding to the m bits of said parity scrambling code.
Claim 10
Dependent Claim
191 words
Apparatus for recovering frame information from a stream of binary data, the apparatus comprising: means for deriving a block of m x n information bits comprising m groups of n bits; first parity bit forming means for forming m parity bits, one for each said group of n bits; means (5) for scrambling said parity bits by performing a logic operation on each said parity bit with a respective bit of an m-bit parity scrambling code, said block of bits together with said scrambled parity bits forming a frame for transmission over a transmission link (3); second parity bit forming means (9) at the remote end of said transmission link for forming new parity bits at the incoming bit rate from the incoming stream of binary data by forming a new parity bit from each successive moving group of n+1 incoming bits; n+1 m-bit shift registers (10, 11, 12, 13) to which said new parity bits are cyclically distributed; and means (19) for generating a framing signal when one of said shift registers (10, 11, 12, 13) holds m bits substantially corresponding to the m bits of said parity scrambling code.
Claim 11
Dependent Claim
18 words
Apparatus according to claim 8 wherein said parity scrambling code is a predetermined random sequence of m bits.
Claim 12
Dependent Claim
16 words
Apparatus according to claim 8 or claim 9 wherein said logic operation is an exclusive-OR operation.
Claim 13
Dependent Claim
29 words
Apparatus according to claim 8, claim 9 or claim 10 wherein said parity bit is an even parity bit and said new parity bit is an even parity bit.
Claim 14
Dependent Claim
14 words
Apparatus according to any one of claims 8 to 11 wherein m is fifteen.
Claim 15
Dependent Claim
12 words
Apparatus according to claim 12 wherein said parity scrambling code is 010100001110110.
Claim 16
Dependent Claim
14 words
Apparatus according to any one of claims 8 to 13 wherein n is three.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.