Patent US5475388A successfully refreshed from Google Patents.
US5475388A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for using finite state machines to perform channel modulation and error correction and entropy coding
Assignee: Ricoh Co Ltd
•
Filing: 1993-10-22
•
Granted: 1995-12-12
•
Expires: 2013-10-22
Abstract
Abstract The present invention provides an encoding and decoding apparatus used for the compression and expansion of data. A state machine is provided having a plurality of states. Each state has at least one transition pair. Each element of the transition pair comprises zero or more bits representative of the compact code to be output and the identification of the next state to proceed to. The transition pair reflects an output for a yes and no response associated with the probability of the data to be compacted and whether the data falls within that probability.
Inventors
- 👤 Michael J. Gormish
- 👤 James D. Allen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 07:48
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/005; H; H03; H03M; H03M13/00; H03M13/03; H03M13/23; H03M13/31; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145; H03M7/00; H03M7/30; H03M7/40; H03M7/4006; G11; G11B; G11B20/00; G11B20/10; G11B20/14; G11B20/1403; G11B20/1423; G11B20/1426
Claims Analysis
Total Claims: 71
Claim 1
Independent Claim
188 words
A method for performing channel modulation and compression on an input bit stream having a plurality of input bits, said method comprising the steps of: locating a transition in at least one transition pair in one of a plurality of states in a transition machine according to a portion of said plurality of input bits, wherein each of said plurality of states in said transition machine has at least one transition pair, and wherein each transition in said at least one transition pair is associated with an output bit stream that is output when said each transition is selected, and further wherein each of the output bit streams comprises a channel coded and compressed representation of input bits; and outputting the output bit stream associated with said transition and transitioning to a next state, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of output bits are generated in response to the input bit stream, such that the input bit stream is channel coded and compressed by use of a single transition machine.
Claim 2
Independent Claim
188 words
A method for performing channel modulation and compression on an input bit stream having a plurality of input bits, said method comprising the steps of: locating a transition in at least one transition pair in one of a plurality of states in a transition machine according to a portion of said plurality of input bits, wherein each of said plurality of states in said transition machine has at least one transition pair, and wherein each transition in said at least one transition pair is associated with an output bit stream that is output when said each transition is selected, and further wherein each of the output bit streams comprises a channel coded and compressed representation of input bits; and outputting the output bit stream associated with said transition and transitioning to a next state, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of output bits are generated in response to the input bit stream, such that the input bit stream is channel coded and compressed by use of a single transition machine.
Claim 3
Dependent Claim
20 words
The method defined in claim 1 wherein the bit stream for each of the transitions adheres to a channel constraint.
Claim 4
Dependent Claim
29 words
The method defined in claim 2 wherein the bit stream output for each of the transitions represents a run length limited coded version of the plurality of input bits.
Claim 5
Dependent Claim
18 words
The method defined in claim 1 wherein each portion of the plurality of input bits comprises one bit.
Claim 6
Dependent Claim
37 words
The method defined in claim 1 wherein each of the output bit streams comprises a compressed representation of the portion of said plurality of input bits, such that the input bit stream is compressed and channel coded.
Claim 7
Dependent Claim
68 words
The method defined in claim 1 further comprising the steps of: receiving a probability for the portion of said plurality of input bits; receiving an indication for said portion of the plurality of input bits, wherein the indication indicates whether said portion of plurality of input bits is within one of a plurality of possible first states, wherein the transition is located according to probability and the indication.
Claim 8
Dependent Claim
14 words
The method defined in claim 6 wherein the indication comprises a binary decision pair.
Claim 9
Dependent Claim
13 words
The method defined in claim 6 wherein the indication comprises a yes/no indicative.
Claim 10
Dependent Claim
13 words
The method defined in claim 6 wherein the probability comprises a probability estimate.
Claim 11
Independent Claim
178 words
A method for performing channel modulation and compression on an input bit stream having a plurality of input bits, said method comprising the steps of: receiving one of said plurality of input bits; locating a transition in at least one transition pair in one of a plurality of states in a transition machine according to said one of said plurality of input bits, wherein each of said plurality of states in the transition machine have at least one transition pair and each of the transitions in said at least one transition pair is associated with an output bit stream, wherein each output bit stream comprises a compressed and channel coded representation of input bits; and outputting the output bit stream associated with said transition, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of output bits are generated in response to the input bit stream, such that the input bit stream is compressed and channel coded by use of a single transition machine.
Claim 12
Independent Claim
178 words
A method for performing channel modulation and compression on an input bit stream having a plurality of input bits, said method comprising the steps of: receiving one of said plurality of input bits; locating a transition in at least one transition pair in one of a plurality of states in a transition machine according to said one of said plurality of input bits, wherein each of said plurality of states in the transition machine have at least one transition pair and each of the transitions in said at least one transition pair is associated with an output bit stream, wherein each output bit stream comprises a compressed and channel coded representation of input bits; and outputting the output bit stream associated with said transition, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of output bits are generated in response to the input bit stream, such that the input bit stream is compressed and channel coded by use of a single transition machine.
Claim 13
Dependent Claim
20 words
The method defined in claim 10 wherein the bit stream for each of the transitions adheres to a channel constraint.
Claim 14
Dependent Claim
29 words
The method defined in claim 10 wherein the bit stream output for each of the transitions represents a run length limited coded version of the plurality of input bits.
Claim 15
Dependent Claim
30 words
The method defined in claim 10 further comprising the step of transitioning to a next state after outputting the bit stream, wherein the next state is indicated by the transition.
Claim 16
Dependent Claim
69 words
The method defined in claim 10 further comprising the steps of: receiving a probability for said one of said plurality of input bits; receiving an indication for said one of the plurality of input bits, wherein the first indication indicates whether said one of plurality of input bits is within one of a plurality of possible first states, wherein the transition is located according to probability and the indication.
Claim 17
Dependent Claim
14 words
The method defined in claim 14 wherein the indication comprises a binary decision pair.
Claim 18
Dependent Claim
13 words
The method defined in claim 14 wherein the indication comprises a yes/no indicative.
Claim 19
Dependent Claim
13 words
The method defined in claim 14 wherein the probability comprises a probability estimate.
Claim 20
Independent Claim
205 words
A method for performing channel modulation and compression on an input bit stream having a plurality of input bits, said method comprising the steps of: receiving a first threshold value for one of the plurality of inputs; receiving a first indication for said one of the plurality of inputs, wherein said first indication indicates whether said one of the plurality of inputs is within one of the plurality of possible first states; selecting one of a plurality of sets of transitions in one of a plurality of transition states according to the first threshold value, wherein each transition in the plurality of sets of transitions is associated with an output and a next state within the plurality of transition states, and further wherein each output comprises a channel modulated and compressed representation of a portion of said plurality of input bits; selecting a transition in said one of a plurality of sets of transitions according to said first indication; and outputting the output associated with the transition, wherein a variable number of bits is output from the transition machine for each of said plurality of input bits, such that the input bit stream is channel coded and compressed by use of a single transition machine.
Claim 21
Independent Claim
205 words
A method for performing channel modulation and compression on an input bit stream having a plurality of input bits, said method comprising the steps of: receiving a first threshold value for one of the plurality of inputs; receiving a first indication for said one of the plurality of inputs, wherein said first indication indicates whether said one of the plurality of inputs is within one of the plurality of possible first states; selecting one of a plurality of sets of transitions in one of a plurality of transition states according to the first threshold value, wherein each transition in the plurality of sets of transitions is associated with an output and a next state within the plurality of transition states, and further wherein each output comprises a channel modulated and compressed representation of a portion of said plurality of input bits; selecting a transition in said one of a plurality of sets of transitions according to said first indication; and outputting the output associated with the transition, wherein a variable number of bits is output from the transition machine for each of said plurality of input bits, such that the input bit stream is channel coded and compressed by use of a single transition machine.
Claim 22
Dependent Claim
52 words
The method defined in claim 18 further comprising the step of transitioning to the next state associated with the transition, such that a transition within the next state is selected using a second threshold value and a second indication corresponding to an input immediately following said one of the plurality of inputs.
Claim 23
Independent Claim
178 words
A method for performing error correction coding and channel coding on an input bit stream having a plurality of input bits, said method comprising the steps of: receiving a portion of said plurality of input bits; locating a transition in at least one transition pair in one of a plurality of states in a transition machine according to said portion of said plurality of input bits, wherein each of said plurality of states in the transition machine has at least one transition pair and each of the transitions in said at least one transition pair is associated with an output bit stream, and further wherein each output bit stream comprises a channel coded and error correction coded representation of the portion of said plurality of input bits; and outputting the output bit stream associated with said transition and transitioning to the next state, wherein a plurality of output bits are generated in response to the input bit stream, such that the input bit stream is error correction coded and channel coded by use of a single transition machine.
Claim 24
Independent Claim
178 words
A method for performing error correction coding and channel coding on an input bit stream having a plurality of input bits, said method comprising the steps of: receiving a portion of said plurality of input bits; locating a transition in at least one transition pair in one of a plurality of states in a transition machine according to said portion of said plurality of input bits, wherein each of said plurality of states in the transition machine has at least one transition pair and each of the transitions in said at least one transition pair is associated with an output bit stream, and further wherein each output bit stream comprises a channel coded and error correction coded representation of the portion of said plurality of input bits; and outputting the output bit stream associated with said transition and transitioning to the next state, wherein a plurality of output bits are generated in response to the input bit stream, such that the input bit stream is error correction coded and channel coded by use of a single transition machine.
Claim 25
Dependent Claim
18 words
The method defined in claim 20 wherein each portion of the plurality of input bits comprises one bit.
Claim 26
Dependent Claim
15 words
The method defined in claim 20 wherein the error correction coding is a convolutional code.
Claim 27
Dependent Claim
15 words
The method defined in claim 20 wherein the error correction coding is a trellis code.
Claim 28
Dependent Claim
30 words
The method defined in claim 20 further comprising the step of transitioning to a next state after outputting the bit stream, wherein the next state is indicated by the transition.
Claim 29
Dependent Claim
68 words
The method defined in claim 20 further comprising the steps of: receiving a probability for the portion of said plurality of input bits; receiving an indication for said portion of the plurality of input bits, wherein the indication indicates whether said portion of plurality of input bits is within one of a plurality of possible first states, wherein the transition is located according to probability and the indication.
Claim 30
Dependent Claim
14 words
The method defined in claim 25 wherein the indication comprises a binary decision pair.
Claim 31
Dependent Claim
13 words
The method defined in claim 25 wherein the indication comprises a yes/no indicative.
Claim 32
Dependent Claim
13 words
The method defined in claim 25 wherein the probability comprises a probability estimate.
Claim 33
Independent Claim
185 words
A method for performing error correction and compression on an input bit stream having a plurality of input bits, said method comprising the steps of: receiving one of said plurality of input bits; locating a transition in at least one transition pair in one of a plurality of states in a transition machine according to said one of said plurality of input bits, wherein each of said plurality of states in the transition machine has at least one transition pair and each of the transitions in said at least one transition pair is associated with an output bit stream, wherein each output bit stream comprises a compressed and error correction coded representation of one of said plurality of input bits; and outputting the output bit stream associated with said transition, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of output bits are generated in response to the input bit stream, such that the input bit stream is compressed and error correction coded by use of a single transition machine.
Claim 34
Independent Claim
185 words
A method for performing error correction and compression on an input bit stream having a plurality of input bits, said method comprising the steps of: receiving one of said plurality of input bits; locating a transition in at least one transition pair in one of a plurality of states in a transition machine according to said one of said plurality of input bits, wherein each of said plurality of states in the transition machine has at least one transition pair and each of the transitions in said at least one transition pair is associated with an output bit stream, wherein each output bit stream comprises a compressed and error correction coded representation of one of said plurality of input bits; and outputting the output bit stream associated with said transition, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of output bits are generated in response to the input bit stream, such that the input bit stream is compressed and error correction coded by use of a single transition machine.
Claim 35
Dependent Claim
15 words
The method defined in claim 29 wherein the error correction coding is a convolutional code.
Claim 36
Dependent Claim
15 words
The method defined in claim 29 wherein the error correction coding is a trellis code.
Claim 37
Dependent Claim
30 words
The method defined in claim 29 further comprising the step of transitioning to a next state after outputting the bit stream, wherein the next state is indicated by the transition.
Claim 38
Dependent Claim
68 words
The method defined in claim 29 further comprising the steps of: receiving a probability for said one of said plurality of input bits; receiving an indication for said one of the plurality of input bits, wherein the indication indicates whether said one of plurality of input bits is within one of a plurality of possible first states, wherein the transition is located according to probability and the indication.
Claim 39
Dependent Claim
14 words
The method defined in claim 33 wherein the indication comprises a binary decision pair.
Claim 40
Dependent Claim
13 words
The method defined in claim 33 wherein the indication comprises a yes/no indicative.
Claim 41
Dependent Claim
13 words
The method defined in claim 33 wherein the probability comprises a probability estimate.
Claim 42
Independent Claim
155 words
A method for performing coding on an input stream, wherein the input stream comprises a plurality of symbols from an alphabet of a symbols, said method comprising the steps of: receiving a symbol in the input stream; selecting a transition in one of a plurality of states in a transition machine having a plurality of states, wherein each of the plurality of states has at least one transition for each of the predetermined number of symbols in the alphabet, and wherein each of the transitions is associated with an output stream, wherein the transition in said one of said plurality of states is selected according to the symbol in the input stream; outputting the output stream associated with said transition and transition to a next state, wherein a variable number of symbols is output from the transition machine for at least two distinct symbols in the input stream, such that the input stream is coded.
Claim 43
Independent Claim
155 words
A method for performing coding on an input stream, wherein the input stream comprises a plurality of symbols from an alphabet of a symbols, said method comprising the steps of: receiving a symbol in the input stream; selecting a transition in one of a plurality of states in a transition machine having a plurality of states, wherein each of the plurality of states has at least one transition for each of the predetermined number of symbols in the alphabet, and wherein each of the transitions is associated with an output stream, wherein the transition in said one of said plurality of states is selected according to the symbol in the input stream; outputting the output stream associated with said transition and transition to a next state, wherein a variable number of symbols is output from the transition machine for at least two distinct symbols in the input stream, such that the input stream is coded.
Claim 44
Dependent Claim
26 words
The method defined in claim 37 wherein each output stream is chosen, such that output stream is outputted, such that the input stream is channel modulated.
Claim 45
Dependent Claim
35 words
The method defined in claim 37 wherein each output stream is chosen, such that output stream is outputted, such that the input stream is channel modulated and compressed by use of a single transition machine.
Claim 46
Dependent Claim
51 words
The method defined in claim 37 further comprising the steps of: receiving a probability for the symbol; receiving an indication for said symbol, wherein the indication indicates whether said symbol is within one of a plurality of possible first states, wherein the transition is located according to probability and the indication.
Claim 47
Dependent Claim
14 words
The method defined in claim 40 wherein the indication comprises a binary decision pair.
Claim 48
Dependent Claim
13 words
The method defined in claim 40 wherein the indication comprises a yes/no indicative.
Claim 49
Dependent Claim
13 words
The method defined in claim 40 wherein the probability comprises a probability estimate.
Claim 50
Independent Claim
163 words
A method for performing coding on an input stream, wherein the input stream comprises a plurality of symbols from an alphabet of a symbols, said method comprising the steps of: receiving a symbol in the input stream; selecting a transition in one of a plurality of states in a transition machine having a plurality of states, wherein each of the plurality of states has at least one transition for each of the predetermined number of symbols in the alphabet, and wherein each of the transitions is associated with an output stream, wherein the transition in said one of said plurality of states is selected according to the symbol in the input stream; outputting the output stream associated with said transition and transition to a next state, wherein a variable number of symbols is output from the transition machine for at least two distinct symbols in the input stream, such that output stream is outputted, such that the input stream is error correction coded.
Claim 51
Independent Claim
163 words
A method for performing coding on an input stream, wherein the input stream comprises a plurality of symbols from an alphabet of a symbols, said method comprising the steps of: receiving a symbol in the input stream; selecting a transition in one of a plurality of states in a transition machine having a plurality of states, wherein each of the plurality of states has at least one transition for each of the predetermined number of symbols in the alphabet, and wherein each of the transitions is associated with an output stream, wherein the transition in said one of said plurality of states is selected according to the symbol in the input stream; outputting the output stream associated with said transition and transition to a next state, wherein a variable number of symbols is output from the transition machine for at least two distinct symbols in the input stream, such that output stream is outputted, such that the input stream is error correction coded.
Claim 52
Dependent Claim
51 words
The method defined in claim 44 further comprising the steps of: receiving a probability for the symbol; receiving a indication for said symbol, wherein the indication indicates whether said symbol is within one of a plurality of possible first states, wherein the transition is located according to probability and the indication.
Claim 53
Dependent Claim
14 words
The method defined in claim 45 wherein the indication comprises a binary decision pair.
Claim 54
Dependent Claim
13 words
The method defined in claim 45 wherein the indication comprises a yes/no indicative.
Claim 55
Dependent Claim
12 words
The method in claim 45 wherein the probability comprises a probability estimate.
Claim 56
Independent Claim
153 words
A method for performing coding on an input stream, wherein the input stream comprises a plurality of symbols from an alphabet of a symbols, said method comprising the steps of: selecting a transition in one of a plurality of states in a transition machine having a plurality of states, wherein each of the plurality of states has at least one transition for each of the predetermined number of symbols in the alphabet, and wherein each of the transitions is associated with an output stream, wherein the transition in said one of said plurality of states is selected according to a symbol in the input stream; outputting the output stream associated with said transition and transition to a next state, wherein a variable number of symbols is output from the transition machine for at least two distinct symbols in the input stream, such that the input stream is channel modulated and error correction coded.
Claim 57
Independent Claim
153 words
A method for performing coding on an input stream, wherein the input stream comprises a plurality of symbols from an alphabet of a symbols, said method comprising the steps of: selecting a transition in one of a plurality of states in a transition machine having a plurality of states, wherein each of the plurality of states has at least one transition for each of the predetermined number of symbols in the alphabet, and wherein each of the transitions is associated with an output stream, wherein the transition in said one of said plurality of states is selected according to a symbol in the input stream; outputting the output stream associated with said transition and transition to a next state, wherein a variable number of symbols is output from the transition machine for at least two distinct symbols in the input stream, such that the input stream is channel modulated and error correction coded.
Claim 58
Independent Claim
154 words
A method for performing coding on an input stream, wherein the input stream comprises a plurality of symbols from an alphabet of a symbols, said method comprising the steps of: selecting a transition in one of a plurality of states in a transition machine having a plurality of states, wherein each of the plurality of states has at least one transition for each of the predetermined number of symbols in the alphabet, and wherein each of the transitions is associated with an output stream, wherein the transition in said one of said plurality of states is selected according to a symbol in the input stream; outputting the output stream associated with said transition and transition to a next state, wherein a variable number of symbols is output from the transition machine for at least two distinct symbols in the input stream, such that the input stream is compressed, channel modulated and error correction coded.
Claim 59
Independent Claim
154 words
A method for performing coding on an input stream, wherein the input stream comprises a plurality of symbols from an alphabet of a symbols, said method comprising the steps of: selecting a transition in one of a plurality of states in a transition machine having a plurality of states, wherein each of the plurality of states has at least one transition for each of the predetermined number of symbols in the alphabet, and wherein each of the transitions is associated with an output stream, wherein the transition in said one of said plurality of states is selected according to a symbol in the input stream; outputting the output stream associated with said transition and transition to a next state, wherein a variable number of symbols is output from the transition machine for at least two distinct symbols in the input stream, such that the input stream is compressed, channel modulated and error correction coded.
Claim 60
Independent Claim
152 words
A method for performing coding on an input stream, wherein the input stream comprises a plurality of symbols from an alphabet of a symbols, said method comprising the steps of: selecting a transition in one of a plurality of states in a transition machine having a plurality of states, wherein each of the plurality of states has at least one transition for each of the predetermined number of symbols in the alphabet, and wherein each of the transitions is associated with an output stream, wherein the transition in said one of said plurality of states is selected according to a symbol in the input stream; outputting the output stream associated with said transition and transition to a next state, wherein a variable number of symbols is output from the transition machine for at least two distinct symbols in the input stream, such that the input stream is error correction coded and compressed.
Claim 61
Independent Claim
152 words
A method for performing coding on an input stream, wherein the input stream comprises a plurality of symbols from an alphabet of a symbols, said method comprising the steps of: selecting a transition in one of a plurality of states in a transition machine having a plurality of states, wherein each of the plurality of states has at least one transition for each of the predetermined number of symbols in the alphabet, and wherein each of the transitions is associated with an output stream, wherein the transition in said one of said plurality of states is selected according to a symbol in the input stream; outputting the output stream associated with said transition and transition to a next state, wherein a variable number of symbols is output from the transition machine for at least two distinct symbols in the input stream, such that the input stream is error correction coded and compressed.
Claim 62
Independent Claim
204 words
An apparatus for performing channel modulation on an input bit streams having a plurality of input bits, said apparatus comprising: a transition machine having a plurality of states, each of said plurality of states having at least one transition pair, and wherein each transition in said at least one transition pair is associated with an output bit stream that is output when each transition is selected, and further wherein said at least one transition pair is chosen according to a portion of said plurality of input bits, wherein each of the output bit streams comprises a channel coded and compressed representation of input bits; means for selecting a transition in said at least one transition pair in said one of said states according to said portion of said plurality of input bits; and means for outputting the output bit streams associated with said transition and transitioning to the next state, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of input bits are generated in response to the input bit streams, such that the input bit streams is channel coded and compressed by use of a single transition machine.
Claim 63
Independent Claim
204 words
An apparatus for performing channel modulation on an input bit streams having a plurality of input bits, said apparatus comprising: a transition machine having a plurality of states, each of said plurality of states having at least one transition pair, and wherein each transition in said at least one transition pair is associated with an output bit stream that is output when each transition is selected, and further wherein said at least one transition pair is chosen according to a portion of said plurality of input bits, wherein each of the output bit streams comprises a channel coded and compressed representation of input bits; means for selecting a transition in said at least one transition pair in said one of said states according to said portion of said plurality of input bits; and means for outputting the output bit streams associated with said transition and transitioning to the next state, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of input bits are generated in response to the input bit streams, such that the input bit streams is channel coded and compressed by use of a single transition machine.
Claim 64
Dependent Claim
13 words
The apparatus defined in claim 52 wherein said transition machine comprises a ROM.
Claim 65
Dependent Claim
18 words
The apparatus defined in claim 52 wherein each portion of a plurality of input bits comprises one bit.
Claim 66
Independent Claim
202 words
An apparatus for performing channel modulation on an input bit streams having a plurality of input bits, said apparatus comprising: a transition machine having a plurality of states, each of said plurality of states having at least one transition pair, and wherein each transition in said at least one transition pair is associated with an output bit stream that is output when each transition is selected, and further wherein said at least one transition pair is chosen according to a portion of said plurality of input bits, wherein each of the output bit streams comprises a channel coded and channel error correction coded representation of input bits; means for selecting a transition in said at least one transition pair in said one of said states according to said portion of said plurality of input bits; and means for outputting the output bit streams associated with said transition and transitioning to the next state, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of input bits are generated in response to the input bit streams, such that the input bit stream is error correction coded and channel coded.
Claim 67
Independent Claim
202 words
An apparatus for performing channel modulation on an input bit streams having a plurality of input bits, said apparatus comprising: a transition machine having a plurality of states, each of said plurality of states having at least one transition pair, and wherein each transition in said at least one transition pair is associated with an output bit stream that is output when each transition is selected, and further wherein said at least one transition pair is chosen according to a portion of said plurality of input bits, wherein each of the output bit streams comprises a channel coded and channel error correction coded representation of input bits; means for selecting a transition in said at least one transition pair in said one of said states according to said portion of said plurality of input bits; and means for outputting the output bit streams associated with said transition and transitioning to the next state, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of input bits are generated in response to the input bit streams, such that the input bit stream is error correction coded and channel coded.
Claim 68
Independent Claim
204 words
An apparatus for performing channel modulation on an input bit streams having a plurality of input bits, said apparatus comprising: a transition machine having a plurality of states, each of said plurality of states having at least one transition pair, and wherein each transition in said at least one transition pair is associated with an output bit stream that is output when each transition is selected, and further wherein said at least one transition pair is chosen according to a portion of said plurality of input bits, wherein each of the output bit streams comprises a compressed, channel coded, and channel error correction coded representation of input bits; means for selecting a transition in said at least one transition pair in said one of said states according to said portion of said plurality of input bits; and means for outputting the output bit streams associated with said transition and transitioning to the next state, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of input bits are generated in response to the input bit streams, such that the input bit stream is compressed, error correction coded and channel coded.
Claim 69
Independent Claim
204 words
An apparatus for performing channel modulation on an input bit streams having a plurality of input bits, said apparatus comprising: a transition machine having a plurality of states, each of said plurality of states having at least one transition pair, and wherein each transition in said at least one transition pair is associated with an output bit stream that is output when each transition is selected, and further wherein said at least one transition pair is chosen according to a portion of said plurality of input bits, wherein each of the output bit streams comprises a compressed, channel coded, and channel error correction coded representation of input bits; means for selecting a transition in said at least one transition pair in said one of said states according to said portion of said plurality of input bits; and means for outputting the output bit streams associated with said transition and transitioning to the next state, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of input bits are generated in response to the input bit streams, such that the input bit stream is compressed, error correction coded and channel coded.
Claim 70
Independent Claim
164 words
An apparatus for performing error correction on an input bit stream having a plurality of input bits, said apparatus comprising a transition machine having a plurality of states, wherein each of the plurality of states has at least one transition pair and each of the transition in said at least one transition pair is associated with an output bit stream, wherein each output bit stream comprises a compressed and error correction coded representation of input bits; means for selecting a transition in said at least one transition pair in said one of said states according to said portion of said plurality of input bits; and means for outputting the output bit stream associated with said transition, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of output bits are generated in response to the input bit stream, such that the input bit stream is compressed and error correction coded.
Claim 71
Independent Claim
164 words
An apparatus for performing error correction on an input bit stream having a plurality of input bits, said apparatus comprising a transition machine having a plurality of states, wherein each of the plurality of states has at least one transition pair and each of the transition in said at least one transition pair is associated with an output bit stream, wherein each output bit stream comprises a compressed and error correction coded representation of input bits; means for selecting a transition in said at least one transition pair in said one of said states according to said portion of said plurality of input bits; and means for outputting the output bit stream associated with said transition, wherein a variable number of bits is output from the transition machine for each portion of said plurality of input bits, wherein a plurality of output bits are generated in response to the input bit stream, such that the input bit stream is compressed and error correction coded.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-12-11 | 1999-06-12 | 1999-12-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-12-11 | 2003-06-12 | 2003-12-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-12-11 | 2007-06-12 | 2007-12-12 | $7700.00 | Window Closed / Lapsed |