US4464714A — System for transmitting digital information, codi…

Claim 1

Independent Claim 265 words

A system for transmission of digital information comprising means for receiving digital information in groups of input words, encoding means for converting the inputs words into code words representing the input words, each code word corresponding to an input word, means for applying the code words to a transfer medium, means for receiving the code words from the transfer medium and means for applying the received code words to a decoding means for converting the code words into digital information, wherein each code word has a time duration equal to sτ 0 , where s is an integer and τ 0 is a given time interval, and each code word consists of M subgroups, G m , of I signal positions, t mi , spaced by equal time intervals, τ, where M and I are integers, m is the subgroup, G m , from 1 to M inclusive, and i is the signal position number within each subgroup G m from 1 to I inclusive, a number k of the signal positions t mi in each subgroup G m being always occupied by a signal which is distinguishable from the signals in the unoccupied positions, wherein k is an integer smaller than I (1≦k≦I-1), the first signal positions t mi of the subgroups G m each being located at different time intervals, ε m , from the beginning of the code word, where 0≦ε m ≦τ, with the restriction M≦2 and ##EQU7## and the group of code words for which it holds that: M=2, I=s=2, k=1, τ=τ 0 and ε 2 =ε 1 +1/2τ excepted.

Claim 2

Independent Claim 265 words

A system for transmission of digital information comprising means for receiving digital information in groups of input words, encoding means for converting the inputs words into code words representing the input words, each code word corresponding to an input word, means for applying the code words to a transfer medium, means for receiving the code words from the transfer medium and means for applying the received code words to a decoding means for converting the code words into digital information, wherein each code word has a time duration equal to sτ 0 , where s is an integer and τ 0 is a given time interval, and each code word consists of M subgroups, G m , of I signal positions, t mi , spaced by equal time intervals, τ, where M and I are integers, m is the subgroup, G m , from 1 to M inclusive, and i is the signal position number within each subgroup G m from 1 to I inclusive, a number k of the signal positions t mi in each subgroup G m being always occupied by a signal which is distinguishable from the signals in the unoccupied positions, wherein k is an integer smaller than I (1≦k≦I-1), the first signal positions t mi of the subgroups G m each being located at different time intervals, ε m , from the beginning of the code word, where 0≦ε m ≦τ, with the restriction M≦2 and ##EQU7## and the group of code words for which it holds that: M=2, I=s=2, k=1, τ=τ 0 and ε 2 =ε 1 +1/2τ excepted.

Claim 3

Dependent Claim 16 words

A system as claimed in claim 1 wherein it holds that I=s and τ=τ 0 .

Claim 4

Dependent Claim 33 words

A system as claimed in claim 1 or 2, wherein the initial positions t m1 are located at time intervals ε m =ε 1 +m-1/M τ from the beginning of the code word.

Claim 5

Dependent Claim 53 words

A system as claimed in claim 3 including means for generating a pilot signal having an angular frequency ω0=2π/τ which is applied to said medium by said applying means, and wherein said decoding means includes means for recovering said pilot signal from said medium, said recovered pilot signal serving as a clock signal.

Claim 6

Dependent Claim 31 words

A system as claimed in claim 3 wherein it holds for the group of code words that: I=s=4, M=2, τ=τ 0 , k=1 and ε 2 =ε 1 +1/2τ 0 .

Claim 7

Dependent Claim 70 words

A system as claimed in claim 5 wherein said input words consist of four bits and said encoding means includes means for dividing each input word into two groups of two bits, means for applying each of said two groups to a one-out-of-four decoding circuit, and means for alternately combining the four outputs of each of the two decoding circuits to supply the code words associated with the input word.

Claim 8

Dependent Claim 37 words

A system according to claim 6 including a shift register and means for alternately connecting the outputs of the two decoding circuits to parallel inputs of said shift register to form the code word from both subgroups.

Claim 9

Independent Claim 92 words

A system as claimed in claims 1 or 2 wherein the initial positions t m1 are located at time intervals ε m =ε 1 +M-1/M+δ τ from the beginning of the code word, where δ is the deviation of initial positions t m1 from locations the initial positions would occupy if the initial positions t m1 were spaced apart by time intervals τ/M, and including means for recovering a clock signal from the coded signal, said recovering means comprising a bandpass filter tuned to an angular frequency ω 0 =2π/τ 0 .

Claim 10

Dependent Claim 54 words

A system as claimed in claim 1 including means for dividing the input words into M groups of bits, and wherein said encoding means includes a k-out-of-I coding circuit for forming each group of said bits into a subgroup G m and means for combining said subgroups by superpositioning to form said code word.

Claim 11

Dependent Claim 56 words

A system as claimed in claim 1 wherein said decoding means includes an array of I-1 delay networks connected in series and such having a time delay τ, and a comparison circuit coupled to the inputs and outputs of said delay networks for sequentially detecting in time intervals ε m each occupied position t mi .

Claim 12

Dependent Claim 46 words

A system as claimed in claim 10 including means for forming bits of an output word in dependence on said detection of occupied positions t mi of subgroups G m and means coupled to said bit forming means for releasing said bits in series and/or parallel.

Claim 13

Dependent Claim 59 words

A system as claimed in claim 1, wherein the medium is a record carrier comprising information areas in which information can be recorded or has been recorded in the form of code words, the information areas being separated by address and synchronization areas in which address and synchronization information has been prerecorded in the form of said code words.

Claim 14

Dependent Claim 89 words

A system as claimed in claim 12, wherein the address and synchronization information is recorded in the form of words having predetermined values of the parameters I, s, M, τ, τ 0 , k and ε m and wherein at least two code words having said predetermined values have a different number of occupied positions such that said at least two code words together form a code word having a value of at least one of the parameters I, s, or K which is different from said predetermined values.

Claim 15

Dependent Claim 85 words

A system as claimed in claim 13, wherein the address and synchronization information is recorded in the form of code words of a group having parameters I=s=4, M=2, τ=τ 0 , k=1 and ε 2 =ε 1 +1/2τ 0 and in at least two code words of the synchronization information, an additional position is occupied such that the two code words together form a code word from a group having parameters I=s=8, M=2, τ=τ 0 , k=3 and ε 2 =ε 1 +1/2τ 0 .

Claim 16

Dependent Claim 238 words

A coding arrangement for encoding digital information grouped in input words each comprised of a plurality of bits, the coding arrangement comprising means for receiving said input words, a code word generator for generating code words each corresponding to an input word, said code words belonging to a group of code words and each having a time duration equal to s τ 0 , where s is an integer and τ 0 is a given time interval, each code word generated by said generating means being composed of M subgroups G m of I signal positions t mi which are spaced by equal time intervals τ, where M and I are integers, m is the subgroup G m , from 1 to M, inclusive, and i is the signal position number within each subgroup G m from 1 to I, inclusive, a number k of the signal positions t mi in each subgroup G m being always occupied by a signal which is distinguishable from the signal in unoccupied positions, wherein k is an integer smaller than I (1<k<i-1), the first positions t m1 of the subgroups G m being located at mutually different time intervals ε m from the beginning of the code words where 0<ε m ≦τ, with the restrictions M≧2 and ##EQU8## and the group of code words for which it holds that M=2, I=s=2, k=1, τ=τ 0 and ε 2 =ε 1 +1/2τ, excepted.

Claim 17

Dependent Claim 238 words

A coding arrangement for encoding digital information grouped in input words each comprised of a plurality of bits, the coding arrangement comprising means for receiving said input words, a code word generator for generating code words each corresponding to an input word, said code words belonging to a group of code words and each having a time duration equal to s τ 0 , where s is an integer and τ 0 is a given time interval, each code word generated by said generating means being composed of M subgroups G m of I signal positions t mi which are spaced by equal time intervals τ, where M and I are integers, m is the subgroup G m , from 1 to M, inclusive, and i is the signal position number within each subgroup G m from 1 to I, inclusive, a number k of the signal positions t mi in each subgroup G m being always occupied by a signal which is distinguishable from the signal in unoccupied positions, wherein k is an integer smaller than I (1<k<i-1), the first positions t m1 of the subgroups G m being located at mutually different time intervals ε m from the beginning of the code words where 0<ε m ≦τ, with the restrictions M≧2 and ##EQU8## and the group of code words for which it holds that M=2, I=s=2, k=1, τ=τ 0 and ε 2 =ε 1 +1/2τ, excepted.

Claim 18

Dependent Claim 17 words

A coding arrangement as claimed in claim 15, wherein it holds that: I=s and τ=τ 0 .

Claim 19

Dependent Claim 62 words

A coding arrangement as claimed in claim 15 or 16, wherein the initial positions t m1 are located at time intervals ε m =ε 1 +m-1/M+δ τ from the beginning of the code word, where δ is the deviation of initial positions t m1 from locations they would have if the initial positions t m1 were spaced apart by time intervals τ/M.

Claim 20

Dependent Claim 34 words

A coding arrangement as claimed in claim 15 or 16, wherein the initial positions t m1 are located at time intervals ε m =ε 1 +m-1/M τ from the beginning of the code word.

Claim 21

Dependent Claim 26 words

A coding arrangement as claimed in claim 17, wherein it holds that: I=s=4, M=2, τ=τ 0 , k=1 and ε 2 =ε 1 +1/2τ 0 .

Claim 22

Dependent Claim 67 words

A coding arrangement as claimed in claim 15 wherein the input words are comprised of n.M bits, where n is an integer equal to or greater than one, and including means for dividing those input words into M groups of n bits, M decoding circuits for generating one subgroup G m for each group of n bits and means for superpositioning the M subgroups G m .

Claim 23

Dependent Claim 81 words

A coding arrangement as claimed in claim 20, wherein n=2, M=2 and n=1, the decoding circuits are one-out-of-four decoders each having four outputs of which at all times one output is at a different signal level than the other three outputs depending on which one of the four possible combinations of two bits is present on the input of that decoder, and the outputs of both one-out-of-four decoders are alternately combined for forming the code word associated with the input word.

Claim 24

Dependent Claim 34 words

A coding arrangement as claimed in claim 21, wherein the outputs of both one-out-of-four decoders are alternately connected to parallel inputs of a shift register to thus form the code word from both subgroups.

Claim 25

Dependent Claim 223 words

A decoding arrangement for use in a system for transmission of digital information wherein the decoding arrangement has an input for receiving code words and an output for supplying digital information by decoding those code words and the decoding arrangement is arranged for decoding code words belonging to a group of codes words each having a length of time equal to sτ 0 , where s is an integer and τ 0 is a given time interval, each code word consisting of M subgroups G m of I signal positions t mi which are spaced by equal time intervals τ, where m is a number from 1 to M, inclusive, and i is the signal position number within each subgroup G m from 1 to I, inclusive a number k of signal positions t mi in each subgroup G m being always occupied by a signal which is distinguishable from the signal in unoccupied positions, whereing k is an integer smaller than I (1<k<I-1), the first signal positions t m1 of the subgroups G m each being located at mutually different time intervals ε m from the beginning of the code word, where 0≦εm≦τ, with the restrictions M≦2 and ##EQU9## and the group of code words for which it holds that: M=2, I=s=2, k-1, τ=τ 0 and ε 2 =ε 1 +1/2τ, excepted.

Claim 26

Dependent Claim 223 words

A decoding arrangement for use in a system for transmission of digital information wherein the decoding arrangement has an input for receiving code words and an output for supplying digital information by decoding those code words and the decoding arrangement is arranged for decoding code words belonging to a group of codes words each having a length of time equal to sτ 0 , where s is an integer and τ 0 is a given time interval, each code word consisting of M subgroups G m of I signal positions t mi which are spaced by equal time intervals τ, where m is a number from 1 to M, inclusive, and i is the signal position number within each subgroup G m from 1 to I, inclusive a number k of signal positions t mi in each subgroup G m being always occupied by a signal which is distinguishable from the signal in unoccupied positions, whereing k is an integer smaller than I (1<k<I-1), the first signal positions t m1 of the subgroups G m each being located at mutually different time intervals ε m from the beginning of the code word, where 0≦εm≦τ, with the restrictions M≦2 and ##EQU9## and the group of code words for which it holds that: M=2, I=s=2, k-1, τ=τ 0 and ε 2 =ε 1 +1/2τ, excepted.

Claim 27

Dependent Claim 58 words

A decoding arrangement as claimed in claim 23, wherein the decoding arrangement comprises an array of I-1 delay networks connected in series and each having a time delay τ whose inputs and outputs lead to a comparison circuit to thus detect sequentially for time intervals ε m the occupied positions t mi of each subgroup G m .

Claim 28

Dependent Claim 159 words

A decoder arrangement as claimed in claim 24 wherein, an input of each delay network with an input of each of the other delay networks forms a first series of input pairs and an input of each delay network with an output of the last delay network of said series connected networks form a second series of input/output pairs, and wherein the comparison circuit comprises a plurality of comparators each having an inverting and a non-inverting input, said inputs of an associated one of said comparators being coupled to each of said pairs of said first and second series, first logic gates for comparing output signals of the comparators, the outputs of said first logic gates each being associated with an occupied position t mi of a subgroup G m so that the outputs of those logic gates produce sequentially the subgroups G m , and second logic gates for generating the digital information associated with the code words.

Claim 29

Dependent Claim 36 words

A decoding circuit as claimed in claim 25 including third logic gates connected to the output of one of the first logic gates for generating a word synchronizing signal from a sequence of predetermined code words.

Claim 30

Dependent Claim 38 words

A decoding arrangement as claimed in claim 23, 24 or 25, including a bandpass filter which is turned to an angular frequency w 0 =2π/τ for extracting a clock signal from the signal formed by the code words.

Claim 31

Dependent Claim 28 words

A decoding circuit as claimed in claims 23, 24 or 25 including third logic gates for generating a word synchronizing signal from a sequence of predetermined code words.

Claim 32

Dependent Claim 234 words

A record carrier comprising information areas where information can be recorded or has been recorded in the form of code words, the information areas being separated by address and synchronization areas in which address and synchronization information has been prerecorded in the form of code words which belong to a group of code words each having a time duration equal to sτ 0 , where s is an integer and τ 0 is a given time interval, and each code word consisting of M subgroups, G m , of I signal positions, t mi , which are spaced by equal time intervals, τ, where M and I are integers, M is the subgroup G m , from 1 to M inclusive, and i is the signal position number within each subgroup G m from 1 to I, inclusive, a number k of the signal positions t mi being always occupied in each subgroup G m by a signal which is distinguishable from the signal in unoccupied positions, wherein k is an integer smaller than I (1<k<I-1), the first positions t m1 of the subgroups G m being each located at mutually different time intervals ε m from the beginning of the code word, where 0≦εm≦τ, with the restrictions M≧2 and ##EQU10## and the group of code words for which it holds that: M=2, I=s=2, k-1, τ=τ 0 and ε 2 =ε 1 +1/2τ, excepted.

Claim 33

Dependent Claim 234 words

A record carrier comprising information areas where information can be recorded or has been recorded in the form of code words, the information areas being separated by address and synchronization areas in which address and synchronization information has been prerecorded in the form of code words which belong to a group of code words each having a time duration equal to sτ 0 , where s is an integer and τ 0 is a given time interval, and each code word consisting of M subgroups, G m , of I signal positions, t mi , which are spaced by equal time intervals, τ, where M and I are integers, M is the subgroup G m , from 1 to M inclusive, and i is the signal position number within each subgroup G m from 1 to I, inclusive, a number k of the signal positions t mi being always occupied in each subgroup G m by a signal which is distinguishable from the signal in unoccupied positions, wherein k is an integer smaller than I (1<k<I-1), the first positions t m1 of the subgroups G m being each located at mutually different time intervals ε m from the beginning of the code word, where 0≦εm≦τ, with the restrictions M≧2 and ##EQU10## and the group of code words for which it holds that: M=2, I=s=2, k-1, τ=τ 0 and ε 2 =ε 1 +1/2τ, excepted.

Claim 34

Dependent Claim 17 words

A record carrier as claimed in claim 29, wherein it holds that I=s and τ=τ 0 .

Claim 35

Dependent Claim 34 words

A record carrier as claimed in claim 30 or 33, wherein it holds for the group of code words that I=s=4, M=2, τ=τ 0 , k=1 and ε 2 =ε 1 +1/2τ 0 .

Claim 36

Dependent Claim 66 words

A record carrier as claimed in claim 30 or 31, wherein the initial positions t m1 are located equidistantly at time intervals ε m =ε 1 +m-1 /M+δ τ from the beginning of each code word, where δ is the deviation of initial positions t m1 from locations the initial positions would occupy if the initial positions t m1 were spaced apart by time intervals τ/M.

Claim 37

Dependent Claim 34 words

A record carrier as claimed in claim 29 or 30, wherein the initial positions t m1 are located at time intervals ε m =ε 1 +m-1/M τ from the beginning of the code word.

Claim 38

Dependent Claim 24 words

A record carrier as claimed in claim 33, wherein a pilot signal having angular frequency w 0 =2π/τ is added to the code words.

Claim 39

Dependent Claim 90 words

A record carrier as claimed in claim 30, wherein address and synchronization information is recorded in the form of code words having predetermined values for the parameters I, s, M, τ, τ 0 , k and ε m and wherein at least two code words having said predetermined values have a different number of occupied positions such that said at least two code words together form a code word having a value of at least one of the parameters I, s, or k which is different from said predetermined values.

Claim 40

Dependent Claim 86 words

A record carrier as claimed in claim 35, wherein the address and synchronization information is recorded in the form of code words, from a group having parameters I=s=4, M=2, τ=τ 0 , k=1 and ε 2 =ε 1 +1/2τ 0 and in at least two code words of the synchronization information an additional position is occupied such that the two code words together form a code word from a group having parameters I=s=8, M=2, τ=τ 0 , k=3 and ε 2 =ε 1 +1/2τ 0 .

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1987-08-07	1988-02-06	1988-08-07	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	1991-08-07	1992-02-06	1992-08-07	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	1995-08-07	1996-02-06	1996-08-07	$7700.00	Window Closed / Lapsed

System for transmitting digital information, coding arrangement for use in that system, decoding arrangement for use in that system and record carrier for use in that system

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag